{'teams': {0: {'team_name': 'search', 'agent': 'search.py', 'url': 'https://github.com/COMP90054-2025-Semester1/assignment-1-search-LUOSYrrrr.git', 'commit_id': '147cce31da9ed5904127aa02b2a9385e3c7c1cb5', 'git_status': True, 'comments': 'N/A', 'submitted_time': '23/03/2025 23:29:10', 'copy_files': True}}} before grades Starting on 3-23 at 12:32:10 after grades Question part1 ============== *** Search time: 0:00:00.314016 *** PASS: marking/part1/food_heuristic_grade_tricky.test *** expanded nodes: 719 *** thresholds: [15000, 12500, 10000, 4200] *** Search time: 0:00:00.244339 *** 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', 'A', 'B', 'D', 'B', 'D', 'A', 'B', 'G', 'D', 'B', 'G', 'D', 'A', 'B', 'C', 'B', 'C', 'A', 'B', 'B', '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'] *** PASS: marking/part3/lrta_1_good_heuristic.test *** solution: ['1:A->B', '0:B->C', '0:C->G'] *** expanded_states: ['A', 'B', 'C', 'B', 'C', 'A', 'A', 'D', 'E', 'D', 'E', 'A', 'D', 'D', 'E', 'A', 'A', 'B', 'C'] *** PASS: marking/part3/lrta_2_bad_heuristic.test *** solution: ['1:A->B', '0:B->C', '0:C->G'] *** expanded_states: ['A', 'D', 'E', 'D', 'E', 'A', 'D', 'E', 'A', 'D', 'E', 'A', 'D', 'D', 'E', 'A', 'D', 'A', 'B', 'C'] *** PASS: marking/part3/lrta_3_hidden.test *** solution: ['0', '0', '2'] *** 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: 1.67/2 ### Finished at 12:32:10 Provisional grades ================== Question part1: 2.00/2 Question part2: 3.00/3 Question part3: 1.67/2 ------------------ Total passed test cases: 6.67/7