Notes
This function is in beta test. Please help improve it in the issues
here.
Hints
Your answer may be identical to the JOJ answer in the first several lines.
However, you will still get Wrong Answer because the complete output may be longer and there might be errors in the future lines.
Please double check your code to solve this problem and try again.
Your Answer
*** FAIL: ./test_cases/q2/graph_backtrack.test *** graph: *** B *** ^ *** | *** *A --> C --> G *** | *** V *** D *** *** A is the start state, G is the goal. Arrows mark *** possible state transitions. This tests whether *** you extract the sequence of actions correctly even *** if your search backtracks. If you fail this, your *** nodes are not correctly tracking the sequences of *** actions required to reach them. *** student solution: ['1:A->C', '0:C->G'] *** student expanded_states: ['A', 'B', 'C', 'D', 'G'] *** *** correct solution: ['1:A->C', '0:C->G'] *** correct expanded_states: ['A', 'B', 'C', 'D'] *** correct rev_solution: ['1:A->C', '0:C->G'] *** correct rev_expanded_states: ['A', 'D', 'C', 'B']
JOJ Answer
*** PASS: ./test_cases/q2/graph_backtrack.test