class: “GraphSearchTest”
algorithm: “waStarSearch”
diagram: “””
2 4
*A —-> B —–> [H]
|
V 2
D
A is the start state, and H is the goal. Arrows mark possible state
transitions. The number next to the arrow is the cost of that transition.
“””
# The following section specifies the search problem and the solution.
# The graph is specified by first the set of start states, followed by
# the set of goal states, and lastly by the state transitions which are
# of the form:
#
graph: “””
start_state: A
goal_states: H F
A Right B 2.0
B Right H 4.0
B Down D 2.0
“””