From af648f856bb1517449e4bae86b7e7f4e326c2268 Mon Sep 17 00:00:00 2001 From: Toby Vincent Date: Tue, 31 Aug 2021 13:16:22 -0500 Subject: initial commit --- test_cases/q3/graph_infinite.test | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 test_cases/q3/graph_infinite.test (limited to 'test_cases/q3/graph_infinite.test') diff --git a/test_cases/q3/graph_infinite.test b/test_cases/q3/graph_infinite.test new file mode 100644 index 0000000..80d807f --- /dev/null +++ b/test_cases/q3/graph_infinite.test @@ -0,0 +1,30 @@ +# Graph where natural action choice leads to an infinite loop +class: "GraphSearchTest" +algorithm: "uniformCostSearch" + +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: +# +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 +""" + -- cgit v1.2.3-70-g09d2