{'teams': {0: {'team_name': 'search', 'agent': 'search.py', 'url': 'https://github.com/COMP90054-2025-Semester1/assignment-1-search-LUOSYrrrr.git', 'commit_id': 'c69de8a1c0840955d9e1e2eba7e545076e8ca928', 'git_status': True, 'comments': 'N/A', 'submitted_time': '22/03/2025 12:32:15', 'copy_files': True}}}
before grades
Starting on 3-22 at 6:32:30
after grades

Question part1
==============
*** Search time: 0:00:00.303663
*** PASS: marking/part1/food_heuristic_grade_tricky.test
*** 	expanded nodes: 719
*** 	thresholds: [15000, 12500, 10000, 4200]
*** Search time: 0:00:00.235998
*** PASS: marking/part1/hidden_heuristic_grade.test
*** 	expanded nodes: 582
*** 	thresholds: [18000, 17000, 7500, 6500]

### Question part1: 2.00/2 ###


Question part2
==============
*** PASS: marking/part2/graph_manypaths.test
*** 	solution:		['1:A->C', '0:C->D', '1:D->F', '0:F->G']
*** 	expanded_states:	['A', 'B1', 'C', 'D', 'E1', 'F', 'A', 'B2', 'C', 'D', 'E2', 'F', 'A', 'B1', 'C', 'D', 'E1', 'F', 'A', 'B2', 'C', 'D', 'F', 'A', 'B1', 'C', 'D', 'F', 'A', 'B2', 'C', 'D', 'F', 'A', 'B1', 'C', 'D', 'F', 'A', 'C', 'D', 'F', 'A', 'C', 'D', 'F']
*** PASS: marking/part2/lrta_0.test
*** 	solution:		['Right', 'Down', 'Down']
*** 	expanded_states:	['A', 'B', 'D', 'G', 'D', 'A', 'B', 'C', 'B', 'D', 'A', 'B', 'D', 'A', 'B', 'D']
*** PASS: marking/part2/lrta_1_good_heuristic.test
*** 	solution:		['1:A->B', '0:B->C', '0:C->G']
*** 	expanded_states:	['A', 'B', 'C', 'A', 'B', 'C', 'A', 'D', 'E', 'D', 'E', 'A', 'B', 'C', 'A', 'B', 'C']
*** PASS: marking/part2/lrta_2_bad_heuristic.test
*** 	solution:		['1:A->B', '0:B->C', '0:C->G']
*** 	expanded_states:	['A', 'D', 'E', 'D', 'E', 'D', 'E', 'D', 'E', 'D', 'A', 'B', 'C', 'A', 'B', 'C']
*** PASS: marking/part2/lrta_3_hidden.test
*** 	solution:		['0', '0', '2']
*** 	expanded_states:	['S', 'A', 'C', 'S', 'D', 'C', 'S', 'A', 'C', 'S', 'A', 'C', 'S', 'A', 'C']
*** PASS: marking/part2/lrta_4_hidden.test
*** 	solution:		['1:A->B', '0:B->C', '0:C->G']
*** 	expanded_states:	['A', 'B', 'C', 'A', 'B', 'C', 'A', 'B', 'C', 'A', 'B', 'C']

### Question part2: 3.00/3 ###


Question part3
==============
*** PASS: marking/part3/graph_manypaths.test
*** 	solution:		['1:A->C', '0:C->D', '1:D->F', '0:F->G']
*** 	expanded_states:	['A', 'B1', 'C', 'D', 'E1', 'F', 'A', 'B2', 'C', 'D', 'E2', 'F', 'A', 'B1', 'C', 'D', 'E1', 'F', 'A', 'B2', 'C', 'D', 'F', 'A', 'B1', 'C', 'D', 'F', 'A', 'B2', 'C', 'D', 'F', 'A', 'B1', 'C', 'D', 'F', 'A', 'C', 'D', 'F', 'A', 'C', 'D', 'F']
*** FAIL: marking/part3/lrta_0.test
*** 	graph:
*** 	              C
*** 	              ^
*** 	              | 2
*** 	         2    V   4 
*** 	    *A <----> B -----> [H]
*** 	              ^
*** 	            1 | 
*** 	         1.5  V  2.5
*** 	     G <----> D <----> E
*** 	              |
*** 	            2 | 
*** 	              V
*** 	             [F]
*** 	    
*** 	    A is the start state, F and H is the goal.  Arrows mark possible state 
*** 	    transitions.  The number next to the arrow is the cost of that transition.
*** 	student solution:		['Right', 'Down', 'Down']
*** 	student expanded_states:	['A', 'B', 'D', 'G', 'A', 'B', 'C', 'D', 'A', 'B', 'D']
*** 
*** 	correct solution:		['Right', 'Down', 'Down']
*** 	correct expanded_states:	['A', 'B', 'A', 'B', 'D', 'B', 'D', 'A', 'B', 'G', 'D', 'B', 'G', 'D', 'D', 'A', 'B', 'C', 'B', 'C', 'A', 'B', 'B', 'B', 'D', 'A', 'B', 'D']
*** 	correct rev_solution:		['Right', 'Down', 'Down']
*** 	correct rev_expanded_states:	['A', 'B', 'A', 'B', 'D', 'B', 'D', 'A', 'B', 'G', 'D', 'B', 'G', 'D', 'D', 'A', 'B', 'C', 'B', 'C', 'A', 'B', 'B', 'B', 'D', 'A', 'B', 'D']
*** FAIL: marking/part3/lrta_1_good_heuristic.test
*** 	graph:
*** 	        3      3      3
*** 	    *A ---- B ---- C ---- [G]
*** 	     |                     ^
*** 	     |  1       1     10   |
*** 	     \----- D ---- E -----/
*** 	    
*** 	    A is the start state, G is the goal.  Arrows mark possible state 
*** 	    transitions.  The number next to the arrow is the cost of that transition.
*** 	    
*** 	    If you fail this test case, you may be incorrectly testing if a node is a goal 
*** 	    before adding it into the queue, instead of testing when you remove the node 
*** 	    from the queue.  See the algorithm pseudocode in lecture.
*** 	student solution:		['1:A->B', '0:B->C', '0:C->G']
*** 	student expanded_states:	['A', 'B', 'C', 'A', 'D', 'E', 'A', 'B', 'C']
*** 
*** 	correct solution:		['1:A->B', '0:B->C', '0:C->G']
*** 	correct expanded_states:	['A', 'B', 'C', 'B', 'C', 'A', 'A', 'D', 'E', 'D', 'E', 'A', 'D', 'D', 'E', 'A', 'A', 'B', 'C']
*** 	correct rev_solution:		['1:A->B', '0:B->C', '0:C->G']
*** 	correct rev_expanded_states:	['A', 'B', 'C', 'B', 'C', 'A', 'A', 'D', 'E', 'D', 'E', 'A', 'D', 'D', 'E', 'A', 'A', 'B', 'C']
*** FAIL: marking/part3/lrta_2_bad_heuristic.test
*** 	graph:
*** 	        3      3      3
*** 	    *A ---- B ---- C ---- [G]
*** 	     |                     ^
*** 	     |  1       1     10   |
*** 	     \----- D ---- E -----/
*** 	    
*** 	    A is the start state, G is the goal.  Arrows mark possible state 
*** 	    transitions.  The number next to the arrow is the cost of that transition.
*** 	    
*** 	    If you fail this test case, you may be incorrectly testing if a node is a goal 
*** 	    before adding it into the queue, instead of testing when you remove the node 
*** 	    from the queue.  See the algorithm pseudocode in lecture.
*** 	student solution:		['1:A->B', '0:B->C', '0:C->G']
*** 	student expanded_states:	['A', 'D', 'E', 'A', 'B', 'C']
*** 
*** 	correct solution:		['1:A->B', '0:B->C', '0:C->G']
*** 	correct expanded_states:	['A', 'D', 'E', 'D', 'E', 'A', 'D', 'E', 'A', 'D', 'E', 'D', 'E', 'A', 'D', 'D', 'E', 'A', 'A', 'B', 'C', 'A', 'B', 'C']
*** 	correct rev_solution:		['1:A->B', '0:B->C', '0:C->G']
*** 	correct rev_expanded_states:	['A', 'D', 'E', 'D', 'E', 'A', 'D', 'E', 'A', 'D', 'E', 'A', 'D', 'D', 'E', 'A', 'D', 'A', 'B', 'C']
*** FAIL: marking/part3/lrta_3_hidden.test
*** 	graph:
*** 	         2     3     2
*** 	      S --- A --- C ---> G
*** 	      | \       /       ^
*** 	    3 |  \ 5   / 1     / 
*** 	      |   \   /       / 
*** 	      B --- D -------/
*** 	         4         5  
*** 	    
*** 	    S is the start state, G is the goal.  Arrows mark possible state 
*** 	    transitions.  The number next to the arrow is the cost of that transition.
*** 	    
*** 	    The heuristic value of each state is:
*** 	    	S 6.0
*** 	    	A 2.5
*** 	    	B 5.25
*** 	    	C 1.125
*** 	    	D 1.0625
*** 	    	G 0
*** 	student solution:		['0', '0', '2']
*** 	student expanded_states:	['S', 'A', 'C', 'S', 'D', 'C', 'S', 'A', 'C']
*** 
*** 	correct solution:		['0', '0', '2']
*** 	correct expanded_states:	['S', 'A', 'S', 'A', 'C', 'A', 'C', 'S', 'S', 'D', 'S', 'D', 'C', 'S', 'A', 'C']
*** 	correct rev_solution:		['0', '0', '2']
*** 	correct rev_expanded_states:	['S', 'A', 'S', 'A', 'C', 'A', 'C', 'S', 'S', 'D', 'S', 'D', 'C', 'S', 'A', 'C']
*** PASS: marking/part3/lrta_4_hidden.test
*** 	solution:		['1:A->B', '0:B->C', '0:C->G']
*** 	expanded_states:	['A', 'B', 'C', 'A', 'B', 'C', 'A', 'B', 'C', 'A', 'B', 'C']

### Question part3: 0.67/2 ###


Finished at 6:32:30

Provisional grades
==================
Question part1: 2.00/2
Question part2: 3.00/3
Question part3: 0.67/2
------------------
Total passed test cases: 5.67/7