{'teams': {0: {'team_name': 'search', 'agent': 'search.py', 'url': 'https://github.com/COMP90054-2025-Semester1/assignment-1-search-JoshuaW723.git', 'commit_id': '39f7d76dba7e3059809261477124c6e5daa539e7', 'git_status': True, 'comments': 'N/A', 'submitted_time': '24/03/2025 14:11:02', 'copy_files': True}}}
before grades
Starting on 3-24 at 3:19:04
after grades

Question part1
==============
*** FAIL: marking/part1/food_heuristic_grade_tricky.test
*** FAIL: marking/part1/hidden_heuristic_grade.test

### Question part1: 0.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
==============
*** FAIL: marking/part3/graph_manypaths.test
*** 	graph:
*** 	        B1          E1
*** 	       ^  \        ^  \
*** 	      /    V      /    V
*** 	    *A --> C --> D --> F --> [G]
*** 	      \    ^      \    ^
*** 	       V  /        V  /
*** 	        B2          E2
*** 	    
*** 	    A is the start state, G is the goal.  Arrows mark 
*** 	    possible state transitions.  This graph has multiple
*** 	    paths to the goal, where nodes with the same state 
*** 	    are added to the fringe multiple times before they
*** 	    are expanded.
*** 	student solution:		['1:A->C', '0:C->D', '1:D->F', '0:F->G']
*** 	student expanded_states:	['A', 'A', 'B1', 'B1', 'C', 'C', 'B2', 'B2', 'D', 'D', 'E1', 'E1', 'F', 'F', 'E2', 'E2', 'G', 'A', 'B1', 'B1', 'C', 'C', 'D', 'D', 'E1', 'E1', 'F', 'E2', 'B1', 'C', 'C', 'D', 'D', 'F', 'E1', 'E2', 'C', 'D', 'D', 'F', 'F', 'A', 'A', 'B1', 'B1', 'B2', 'B2', 'C', 'C', 'D', 'A', 'B1', 'B1', 'C', 'B1', 'C', 'C', 'D', 'D', 'F', 'F', 'A', 'A', 'B2', 'B2', 'C', 'B1', 'A', 'C', 'C', 'D', 'D', 'F', 'F', 'A', 'A', 'C', 'B1', 'B2', 'A', 'C', 'C', 'D', 'D', 'F', 'F', 'A', 'A', 'C', 'C', 'D', 'D', 'F', 'F']
*** 
*** 	correct solution:		['1:A->C', '0:C->D', '1:D->F', '0:F->G']
*** 	correct 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']
*** 	correct rev_solution:		['1:A->C', '0:C->D', '1:D->F', '0:F->G']
*** 	correct rev_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', 'A', 'B', 'B', 'D', 'D', 'C', 'C', 'G', 'G', 'F', 'E', 'E', 'H', 'A', 'B', 'B', 'D', 'D', 'F', 'H', 'A', 'A', 'C', 'C', 'G', 'G', 'E', 'E', 'B', 'D', 'D', 'A', 'A', 'B', 'B', 'D', 'H', 'C', 'C', 'A', 'A', 'B', 'D', 'D', 'A', 'A', 'B', 'B', 'D', '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', 'A', 'B', 'D', 'A', 'B', 'B', 'C', 'C', 'G', 'B', 'B', 'A', 'A', 'D', 'C', 'A', 'A', 'D', 'D', 'E', 'E', 'D', 'D', 'G', 'A', 'A', 'B', 'E', 'A', 'A', 'B', 'B', 'C', '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', 'A', 'D', 'B', 'A', 'D', 'D', 'E', 'E', 'D', 'D', 'A', 'A', 'G', 'B', 'E', 'D', 'D', 'E', 'E', 'D', 'D', 'A', 'A', 'G', 'B', 'E', 'D', 'D', 'E', 'E', 'D', 'D', 'A', 'A', 'G', 'B', 'E', 'D', 'D', 'E', 'E', 'D', 'D', 'G', 'A', 'E', 'A', 'A', 'B', 'B', 'C', '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']
Traceback (most recent call last):
  File "/code/assignment1/code_base/searchTestClasses.py", line 903, in execute
    path = func_timeout(self.timeout, test_search.astar, args=(problem, heuristic))
  File "/usr/local/lib/python3.8/site-packages/func_timeout/dafunc.py", line 108, in func_timeout
    raise_exception(exception)
  File "/usr/local/lib/python3.8/site-packages/func_timeout/py3_raise.py", line 7, in raise_exception
    raise exception[0] from None
  File "/code/assignment1/code_base/testSearch.py", line 34, in aStarSearch
    myPQ.push(startNode, heuristic(startState, problem))
  File "/code/assignment1/code_base/search.py", line 131, in foodHeuristic
    from searchAgents import mazeDistance
ImportError: cannot import name 'mazeDistance' from 'searchAgents' (/code/assignment1/code_base/searchAgents.py)
Traceback (most recent call last):
  File "/code/assignment1/code_base/searchTestClasses.py", line 903, in execute
    path = func_timeout(self.timeout, test_search.astar, args=(problem, heuristic))
  File "/usr/local/lib/python3.8/site-packages/func_timeout/dafunc.py", line 108, in func_timeout
    raise_exception(exception)
  File "/usr/local/lib/python3.8/site-packages/func_timeout/py3_raise.py", line 7, in raise_exception
    raise exception[0] from None
  File "/code/assignment1/code_base/testSearch.py", line 34, in aStarSearch
    myPQ.push(startNode, heuristic(startState, problem))
  File "/code/assignment1/code_base/search.py", line 131, in foodHeuristic
    from searchAgents import mazeDistance
ImportError: cannot import name 'mazeDistance' from 'searchAgents' (/code/assignment1/code_base/searchAgents.py)
*** 	student expanded_states:	['S', 'S', 'A', 'A', 'D', 'D', 'C', 'C', 'B', 'B', 'G', 'S', 'A', 'A', 'C', 'S', 'S', 'D', 'D', 'B', 'B', 'G', 'A', 'C', 'C', 'S', 'S', 'A', 'A', 'C', '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', 'A', 'B', 'B', 'C', 'C', 'G', 'A', 'B', 'B', 'C', 'B', 'C', 'C', 'A', 'A', 'B', 'G', 'A', 'B', 'B', 'C', 'C', 'A', 'A', 'B', 'B', 'C', 'C']

### Question part3: 0.33/2 ###


Finished at 3:19:04

Provisional grades
==================
Question part1: 0.00/2
Question part2: 3.00/3
Question part3: 0.33/2
------------------
Total passed test cases: 3.33/7