diff options
Diffstat (limited to 'test_cases/q2/graph_infinite.test')
| -rw-r--r-- | test_cases/q2/graph_infinite.test | 30 |
1 files changed, 30 insertions, 0 deletions
diff --git a/test_cases/q2/graph_infinite.test b/test_cases/q2/graph_infinite.test new file mode 100644 index 0000000..2cae9ad --- /dev/null +++ b/test_cases/q2/graph_infinite.test @@ -0,0 +1,30 @@ +# Graph where natural action choice leads to an infinite loop +class: "GraphSearchTest" +algorithm: "breadthFirstSearch" + +diagram: """ + B <--> C + ^ /| + | / | + V / V +*A<-/ [G] + +A is the start state, G is the goal. Arrows mark +possible state transitions. +""" +# 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: +# <start state> <actions> <end state> <cost> +graph: """ +start_state: A +goal_states: G +A 0:A->B B 1.0 +B 0:B->A A 2.0 +B 1:B->C C 4.0 +C 0:C->A A 8.0 +C 1:C->G G 16.0 +C 2:C->B B 32.0 +""" + |