{'teams': {0: {'team_name': 'search', 'agent': 'search.py', 'url': 'https://github.com/COMP90054-2025-Semester1/assignment-1-search-pranavpai.git', 'commit_id': 'e55b0d41e7358cbb4c93f77ce160f1f004c61d58', 'git_status': True, 'comments': 'N/A', 'submitted_time': '24/03/2025 15:25:14', 'copy_files': True}}} DEBUG:root:Successor B1: cost=1.0, heuristic=0 -> f=1.0 DEBUG:root:Successor C: cost=2.0, heuristic=0 -> f=2.0 DEBUG:root:Successor B2: cost=4.0, heuristic=0 -> f=4.0 DEBUG:root:For state A: old heuristic=0, new computed heuristic=1.0 DEBUG:root:Updating heuristic for A from 0 to 1.0 DEBUG:root:Chosen successor for A: B1 with action '0:A->B1' (f-value=1.0) DEBUG:root:Appending action '0:A->B1' to path. Current path: ['0:A->B1'] DEBUG:root:Moving to new current state: B1 DEBUG:root:Successor C: cost=8.0, heuristic=0 -> f=8.0 DEBUG:root:For state B1: old heuristic=0, new computed heuristic=8.0 DEBUG:root:Updating heuristic for B1 from 0 to 8.0 DEBUG:root:Chosen successor for B1: C with action '0:B1->C' (f-value=8.0) DEBUG:root:Appending action '0:B1->C' to path. Current path: ['0:A->B1', '0:B1->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor D: cost=32.0, heuristic=0 -> f=32.0 DEBUG:root:For state C: old heuristic=0, new computed heuristic=32.0 DEBUG:root:Updating heuristic for C from 0 to 32.0 DEBUG:root:Chosen successor for C: D with action '0:C->D' (f-value=32.0) DEBUG:root:Appending action '0:C->D' to path. Current path: ['0:A->B1', '0:B1->C', '0:C->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E1: cost=64.0, heuristic=0 -> f=64.0 DEBUG:root:Successor F: cost=128.0, heuristic=0 -> f=128.0 DEBUG:root:Successor E2: cost=256.0, heuristic=0 -> f=256.0 DEBUG:root:For state D: old heuristic=0, new computed heuristic=64.0 DEBUG:root:Updating heuristic for D from 0 to 64.0 DEBUG:root:Chosen successor for D: E1 with action '0:D->E1' (f-value=64.0) DEBUG:root:Appending action '0:D->E1' to path. Current path: ['0:A->B1', '0:B1->C', '0:C->D', '0:D->E1'] DEBUG:root:Moving to new current state: E1 DEBUG:root:Successor F: cost=512.0, heuristic=0 -> f=512.0 DEBUG:root:For state E1: old heuristic=0, new computed heuristic=512.0 DEBUG:root:Updating heuristic for E1 from 0 to 512.0 DEBUG:root:Chosen successor for E1: F with action '0:E1->F' (f-value=512.0) DEBUG:root:Appending action '0:E1->F' to path. Current path: ['0:A->B1', '0:B1->C', '0:C->D', '0:D->E1', '0:E1->F'] DEBUG:root:Moving to new current state: F DEBUG:root:Successor G: cost=2048.0, heuristic=0 -> f=2048.0 DEBUG:root:For state F: old heuristic=0, new computed heuristic=2048.0 DEBUG:root:Updating heuristic for F from 0 to 2048.0 DEBUG:root:Chosen successor for F: G with action '0:F->G' (f-value=2048.0) DEBUG:root:Appending action '0:F->G' to path. Current path: ['0:A->B1', '0:B1->C', '0:C->D', '0:D->E1', '0:E1->F', '0:F->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['0:A->B1', '0:B1->C', '0:C->D', '0:D->E1', '0:E1->F', '0:F->G'] DEBUG:root:Successor B1: cost=1.0, heuristic=8.0 -> f=9.0 DEBUG:root:Successor C: cost=2.0, heuristic=32.0 -> f=34.0 DEBUG:root:Successor B2: cost=4.0, heuristic=0 -> f=4.0 DEBUG:root:For state A: old heuristic=1.0, new computed heuristic=4.0 DEBUG:root:Updating heuristic for A from 1.0 to 4.0 DEBUG:root:Chosen successor for A: B2 with action '2:A->B2' (f-value=4.0) DEBUG:root:Appending action '2:A->B2' to path. Current path: ['2:A->B2'] DEBUG:root:Moving to new current state: B2 DEBUG:root:Successor C: cost=16.0, heuristic=32.0 -> f=48.0 DEBUG:root:For state B2: old heuristic=0, new computed heuristic=48.0 DEBUG:root:Updating heuristic for B2 from 0 to 48.0 DEBUG:root:Chosen successor for B2: C with action '0:B2->C' (f-value=48.0) DEBUG:root:Appending action '0:B2->C' to path. Current path: ['2:A->B2', '0:B2->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor D: cost=32.0, heuristic=64.0 -> f=96.0 DEBUG:root:For state C: old heuristic=32.0, new computed heuristic=96.0 DEBUG:root:Updating heuristic for C from 32.0 to 96.0 DEBUG:root:Chosen successor for C: D with action '0:C->D' (f-value=96.0) DEBUG:root:Appending action '0:C->D' to path. Current path: ['2:A->B2', '0:B2->C', '0:C->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E1: cost=64.0, heuristic=512.0 -> f=576.0 DEBUG:root:Successor F: cost=128.0, heuristic=2048.0 -> f=2176.0 DEBUG:root:Successor E2: cost=256.0, heuristic=0 -> f=256.0 DEBUG:root:For state D: old heuristic=64.0, new computed heuristic=256.0 DEBUG:root:Updating heuristic for D from 64.0 to 256.0 DEBUG:root:Chosen successor for D: E2 with action '2:D->E2' (f-value=256.0) DEBUG:root:Appending action '2:D->E2' to path. Current path: ['2:A->B2', '0:B2->C', '0:C->D', '2:D->E2'] DEBUG:root:Moving to new current state: E2 DEBUG:root:Successor F: cost=1024.0, heuristic=2048.0 -> f=3072.0 DEBUG:root:For state E2: old heuristic=0, new computed heuristic=3072.0 DEBUG:root:Updating heuristic for E2 from 0 to 3072.0 DEBUG:root:Chosen successor for E2: F with action '0:E2->F' (f-value=3072.0) DEBUG:root:Appending action '0:E2->F' to path. Current path: ['2:A->B2', '0:B2->C', '0:C->D', '2:D->E2', '0:E2->F'] DEBUG:root:Moving to new current state: F DEBUG:root:Successor G: cost=2048.0, heuristic=0 -> f=2048.0 DEBUG:root:For state F: old heuristic=2048.0, new computed heuristic=2048.0 DEBUG:root:Chosen successor for F: G with action '0:F->G' (f-value=2048.0) DEBUG:root:Appending action '0:F->G' to path. Current path: ['2:A->B2', '0:B2->C', '0:C->D', '2:D->E2', '0:E2->F', '0:F->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['2:A->B2', '0:B2->C', '0:C->D', '2:D->E2', '0:E2->F', '0:F->G'] DEBUG:root:Successor B1: cost=1.0, heuristic=8.0 -> f=9.0 DEBUG:root:Successor C: cost=2.0, heuristic=96.0 -> f=98.0 DEBUG:root:Successor B2: cost=4.0, heuristic=48.0 -> f=52.0 DEBUG:root:For state A: old heuristic=4.0, new computed heuristic=9.0 DEBUG:root:Updating heuristic for A from 4.0 to 9.0 DEBUG:root:Chosen successor for A: B1 with action '0:A->B1' (f-value=9.0) DEBUG:root:Appending action '0:A->B1' to path. Current path: ['0:A->B1'] DEBUG:root:Moving to new current state: B1 DEBUG:root:Successor C: cost=8.0, heuristic=96.0 -> f=104.0 DEBUG:root:For state B1: old heuristic=8.0, new computed heuristic=104.0 DEBUG:root:Updating heuristic for B1 from 8.0 to 104.0 DEBUG:root:Chosen successor for B1: C with action '0:B1->C' (f-value=104.0) DEBUG:root:Appending action '0:B1->C' to path. Current path: ['0:A->B1', '0:B1->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor D: cost=32.0, heuristic=256.0 -> f=288.0 DEBUG:root:For state C: old heuristic=96.0, new computed heuristic=288.0 DEBUG:root:Updating heuristic for C from 96.0 to 288.0 DEBUG:root:Chosen successor for C: D with action '0:C->D' (f-value=288.0) DEBUG:root:Appending action '0:C->D' to path. Current path: ['0:A->B1', '0:B1->C', '0:C->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E1: cost=64.0, heuristic=512.0 -> f=576.0 DEBUG:root:Successor F: cost=128.0, heuristic=2048.0 -> f=2176.0 DEBUG:root:Successor E2: cost=256.0, heuristic=3072.0 -> f=3328.0 DEBUG:root:For state D: old heuristic=256.0, new computed heuristic=576.0 DEBUG:root:Updating heuristic for D from 256.0 to 576.0 DEBUG:root:Chosen successor for D: E1 with action '0:D->E1' (f-value=576.0) DEBUG:root:Appending action '0:D->E1' to path. Current path: ['0:A->B1', '0:B1->C', '0:C->D', '0:D->E1'] DEBUG:root:Moving to new current state: E1 DEBUG:root:Successor F: cost=512.0, heuristic=2048.0 -> f=2560.0 DEBUG:root:For state E1: old heuristic=512.0, new computed heuristic=2560.0 DEBUG:root:Updating heuristic for E1 from 512.0 to 2560.0 DEBUG:root:Chosen successor for E1: F with action '0:E1->F' (f-value=2560.0) DEBUG:root:Appending action '0:E1->F' to path. Current path: ['0:A->B1', '0:B1->C', '0:C->D', '0:D->E1', '0:E1->F'] DEBUG:root:Moving to new current state: F DEBUG:root:Successor G: cost=2048.0, heuristic=0 -> f=2048.0 DEBUG:root:For state F: old heuristic=2048.0, new computed heuristic=2048.0 DEBUG:root:Chosen successor for F: G with action '0:F->G' (f-value=2048.0) DEBUG:root:Appending action '0:F->G' to path. Current path: ['0:A->B1', '0:B1->C', '0:C->D', '0:D->E1', '0:E1->F', '0:F->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['0:A->B1', '0:B1->C', '0:C->D', '0:D->E1', '0:E1->F', '0:F->G'] DEBUG:root:Successor B1: cost=1.0, heuristic=104.0 -> f=105.0 DEBUG:root:Successor C: cost=2.0, heuristic=288.0 -> f=290.0 DEBUG:root:Successor B2: cost=4.0, heuristic=48.0 -> f=52.0 DEBUG:root:For state A: old heuristic=9.0, new computed heuristic=52.0 DEBUG:root:Updating heuristic for A from 9.0 to 52.0 DEBUG:root:Chosen successor for A: B2 with action '2:A->B2' (f-value=52.0) DEBUG:root:Appending action '2:A->B2' to path. Current path: ['2:A->B2'] DEBUG:root:Moving to new current state: B2 DEBUG:root:Successor C: cost=16.0, heuristic=288.0 -> f=304.0 DEBUG:root:For state B2: old heuristic=48.0, new computed heuristic=304.0 DEBUG:root:Updating heuristic for B2 from 48.0 to 304.0 DEBUG:root:Chosen successor for B2: C with action '0:B2->C' (f-value=304.0) DEBUG:root:Appending action '0:B2->C' to path. Current path: ['2:A->B2', '0:B2->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor D: cost=32.0, heuristic=576.0 -> f=608.0 DEBUG:root:For state C: old heuristic=288.0, new computed heuristic=608.0 DEBUG:root:Updating heuristic for C from 288.0 to 608.0 DEBUG:root:Chosen successor for C: D with action '0:C->D' (f-value=608.0) DEBUG:root:Appending action '0:C->D' to path. Current path: ['2:A->B2', '0:B2->C', '0:C->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E1: cost=64.0, heuristic=2560.0 -> f=2624.0 DEBUG:root:Successor F: cost=128.0, heuristic=2048.0 -> f=2176.0 DEBUG:root:Successor E2: cost=256.0, heuristic=3072.0 -> f=3328.0 DEBUG:root:For state D: old heuristic=576.0, new computed heuristic=2176.0 DEBUG:root:Updating heuristic for D from 576.0 to 2176.0 DEBUG:root:Chosen successor for D: F with action '1:D->F' (f-value=2176.0) DEBUG:root:Appending action '1:D->F' to path. Current path: ['2:A->B2', '0:B2->C', '0:C->D', '1:D->F'] DEBUG:root:Moving to new current state: F DEBUG:root:Successor G: cost=2048.0, heuristic=0 -> f=2048.0 DEBUG:root:For state F: old heuristic=2048.0, new computed heuristic=2048.0 DEBUG:root:Chosen successor for F: G with action '0:F->G' (f-value=2048.0) DEBUG:root:Appending action '0:F->G' to path. Current path: ['2:A->B2', '0:B2->C', '0:C->D', '1:D->F', '0:F->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['2:A->B2', '0:B2->C', '0:C->D', '1:D->F', '0:F->G'] DEBUG:root:Successor B1: cost=1.0, heuristic=104.0 -> f=105.0 DEBUG:root:Successor C: cost=2.0, heuristic=608.0 -> f=610.0 DEBUG:root:Successor B2: cost=4.0, heuristic=304.0 -> f=308.0 DEBUG:root:For state A: old heuristic=52.0, new computed heuristic=105.0 DEBUG:root:Updating heuristic for A from 52.0 to 105.0 DEBUG:root:Chosen successor for A: B1 with action '0:A->B1' (f-value=105.0) DEBUG:root:Appending action '0:A->B1' to path. Current path: ['0:A->B1'] DEBUG:root:Moving to new current state: B1 DEBUG:root:Successor C: cost=8.0, heuristic=608.0 -> f=616.0 DEBUG:root:For state B1: old heuristic=104.0, new computed heuristic=616.0 DEBUG:root:Updating heuristic for B1 from 104.0 to 616.0 DEBUG:root:Chosen successor for B1: C with action '0:B1->C' (f-value=616.0) DEBUG:root:Appending action '0:B1->C' to path. Current path: ['0:A->B1', '0:B1->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor D: cost=32.0, heuristic=2176.0 -> f=2208.0 DEBUG:root:For state C: old heuristic=608.0, new computed heuristic=2208.0 DEBUG:root:Updating heuristic for C from 608.0 to 2208.0 DEBUG:root:Chosen successor for C: D with action '0:C->D' (f-value=2208.0) DEBUG:root:Appending action '0:C->D' to path. Current path: ['0:A->B1', '0:B1->C', '0:C->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E1: cost=64.0, heuristic=2560.0 -> f=2624.0 DEBUG:root:Successor F: cost=128.0, heuristic=2048.0 -> f=2176.0 DEBUG:root:Successor E2: cost=256.0, heuristic=3072.0 -> f=3328.0 DEBUG:root:For state D: old heuristic=2176.0, new computed heuristic=2176.0 DEBUG:root:Chosen successor for D: F with action '1:D->F' (f-value=2176.0) DEBUG:root:Appending action '1:D->F' to path. Current path: ['0:A->B1', '0:B1->C', '0:C->D', '1:D->F'] DEBUG:root:Moving to new current state: F DEBUG:root:Successor G: cost=2048.0, heuristic=0 -> f=2048.0 DEBUG:root:For state F: old heuristic=2048.0, new computed heuristic=2048.0 DEBUG:root:Chosen successor for F: G with action '0:F->G' (f-value=2048.0) DEBUG:root:Appending action '0:F->G' to path. Current path: ['0:A->B1', '0:B1->C', '0:C->D', '1:D->F', '0:F->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['0:A->B1', '0:B1->C', '0:C->D', '1:D->F', '0:F->G'] DEBUG:root:Successor B1: cost=1.0, heuristic=616.0 -> f=617.0 DEBUG:root:Successor C: cost=2.0, heuristic=2208.0 -> f=2210.0 DEBUG:root:Successor B2: cost=4.0, heuristic=304.0 -> f=308.0 DEBUG:root:For state A: old heuristic=105.0, new computed heuristic=308.0 DEBUG:root:Updating heuristic for A from 105.0 to 308.0 DEBUG:root:Chosen successor for A: B2 with action '2:A->B2' (f-value=308.0) DEBUG:root:Appending action '2:A->B2' to path. Current path: ['2:A->B2'] DEBUG:root:Moving to new current state: B2 DEBUG:root:Successor C: cost=16.0, heuristic=2208.0 -> f=2224.0 DEBUG:root:For state B2: old heuristic=304.0, new computed heuristic=2224.0 DEBUG:root:Updating heuristic for B2 from 304.0 to 2224.0 DEBUG:root:Chosen successor for B2: C with action '0:B2->C' (f-value=2224.0) DEBUG:root:Appending action '0:B2->C' to path. Current path: ['2:A->B2', '0:B2->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor D: cost=32.0, heuristic=2176.0 -> f=2208.0 DEBUG:root:For state C: old heuristic=2208.0, new computed heuristic=2208.0 DEBUG:root:Chosen successor for C: D with action '0:C->D' (f-value=2208.0) DEBUG:root:Appending action '0:C->D' to path. Current path: ['2:A->B2', '0:B2->C', '0:C->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E1: cost=64.0, heuristic=2560.0 -> f=2624.0 DEBUG:root:Successor F: cost=128.0, heuristic=2048.0 -> f=2176.0 DEBUG:root:Successor E2: cost=256.0, heuristic=3072.0 -> f=3328.0 DEBUG:root:For state D: old heuristic=2176.0, new computed heuristic=2176.0 DEBUG:root:Chosen successor for D: F with action '1:D->F' (f-value=2176.0) DEBUG:root:Appending action '1:D->F' to path. Current path: ['2:A->B2', '0:B2->C', '0:C->D', '1:D->F'] DEBUG:root:Moving to new current state: F DEBUG:root:Successor G: cost=2048.0, heuristic=0 -> f=2048.0 DEBUG:root:For state F: old heuristic=2048.0, new computed heuristic=2048.0 DEBUG:root:Chosen successor for F: G with action '0:F->G' (f-value=2048.0) DEBUG:root:Appending action '0:F->G' to path. Current path: ['2:A->B2', '0:B2->C', '0:C->D', '1:D->F', '0:F->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['2:A->B2', '0:B2->C', '0:C->D', '1:D->F', '0:F->G'] DEBUG:root:Successor B1: cost=1.0, heuristic=616.0 -> f=617.0 DEBUG:root:Successor C: cost=2.0, heuristic=2208.0 -> f=2210.0 DEBUG:root:Successor B2: cost=4.0, heuristic=2224.0 -> f=2228.0 DEBUG:root:For state A: old heuristic=308.0, new computed heuristic=617.0 DEBUG:root:Updating heuristic for A from 308.0 to 617.0 DEBUG:root:Chosen successor for A: B1 with action '0:A->B1' (f-value=617.0) DEBUG:root:Appending action '0:A->B1' to path. Current path: ['0:A->B1'] DEBUG:root:Moving to new current state: B1 DEBUG:root:Successor C: cost=8.0, heuristic=2208.0 -> f=2216.0 DEBUG:root:For state B1: old heuristic=616.0, new computed heuristic=2216.0 DEBUG:root:Updating heuristic for B1 from 616.0 to 2216.0 DEBUG:root:Chosen successor for B1: C with action '0:B1->C' (f-value=2216.0) DEBUG:root:Appending action '0:B1->C' to path. Current path: ['0:A->B1', '0:B1->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor D: cost=32.0, heuristic=2176.0 -> f=2208.0 DEBUG:root:For state C: old heuristic=2208.0, new computed heuristic=2208.0 DEBUG:root:Chosen successor for C: D with action '0:C->D' (f-value=2208.0) DEBUG:root:Appending action '0:C->D' to path. Current path: ['0:A->B1', '0:B1->C', '0:C->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E1: cost=64.0, heuristic=2560.0 -> f=2624.0 DEBUG:root:Successor F: cost=128.0, heuristic=2048.0 -> f=2176.0 DEBUG:root:Successor E2: cost=256.0, heuristic=3072.0 -> f=3328.0 DEBUG:root:For state D: old heuristic=2176.0, new computed heuristic=2176.0 DEBUG:root:Chosen successor for D: F with action '1:D->F' (f-value=2176.0) DEBUG:root:Appending action '1:D->F' to path. Current path: ['0:A->B1', '0:B1->C', '0:C->D', '1:D->F'] DEBUG:root:Moving to new current state: F DEBUG:root:Successor G: cost=2048.0, heuristic=0 -> f=2048.0 DEBUG:root:For state F: old heuristic=2048.0, new computed heuristic=2048.0 DEBUG:root:Chosen successor for F: G with action '0:F->G' (f-value=2048.0) DEBUG:root:Appending action '0:F->G' to path. Current path: ['0:A->B1', '0:B1->C', '0:C->D', '1:D->F', '0:F->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['0:A->B1', '0:B1->C', '0:C->D', '1:D->F', '0:F->G'] DEBUG:root:Successor B1: cost=1.0, heuristic=2216.0 -> f=2217.0 DEBUG:root:Successor C: cost=2.0, heuristic=2208.0 -> f=2210.0 DEBUG:root:Successor B2: cost=4.0, heuristic=2224.0 -> f=2228.0 DEBUG:root:For state A: old heuristic=617.0, new computed heuristic=2210.0 DEBUG:root:Updating heuristic for A from 617.0 to 2210.0 DEBUG:root:Chosen successor for A: C with action '1:A->C' (f-value=2210.0) DEBUG:root:Appending action '1:A->C' to path. Current path: ['1:A->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor D: cost=32.0, heuristic=2176.0 -> f=2208.0 DEBUG:root:For state C: old heuristic=2208.0, new computed heuristic=2208.0 DEBUG:root:Chosen successor for C: D with action '0:C->D' (f-value=2208.0) DEBUG:root:Appending action '0:C->D' to path. Current path: ['1:A->C', '0:C->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E1: cost=64.0, heuristic=2560.0 -> f=2624.0 DEBUG:root:Successor F: cost=128.0, heuristic=2048.0 -> f=2176.0 DEBUG:root:Successor E2: cost=256.0, heuristic=3072.0 -> f=3328.0 DEBUG:root:For state D: old heuristic=2176.0, new computed heuristic=2176.0 DEBUG:root:Chosen successor for D: F with action '1:D->F' (f-value=2176.0) DEBUG:root:Appending action '1:D->F' to path. Current path: ['1:A->C', '0:C->D', '1:D->F'] DEBUG:root:Moving to new current state: F DEBUG:root:Successor G: cost=2048.0, heuristic=0 -> f=2048.0 DEBUG:root:For state F: old heuristic=2048.0, new computed heuristic=2048.0 DEBUG:root:Chosen successor for F: G with action '0:F->G' (f-value=2048.0) DEBUG:root:Appending action '0:F->G' to path. Current path: ['1:A->C', '0:C->D', '1:D->F', '0:F->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['1:A->C', '0:C->D', '1:D->F', '0:F->G'] DEBUG:root:Successor B1: cost=1.0, heuristic=2216.0 -> f=2217.0 DEBUG:root:Successor C: cost=2.0, heuristic=2208.0 -> f=2210.0 DEBUG:root:Successor B2: cost=4.0, heuristic=2224.0 -> f=2228.0 DEBUG:root:For state A: old heuristic=2210.0, new computed heuristic=2210.0 DEBUG:root:Chosen successor for A: C with action '1:A->C' (f-value=2210.0) DEBUG:root:Appending action '1:A->C' to path. Current path: ['1:A->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor D: cost=32.0, heuristic=2176.0 -> f=2208.0 DEBUG:root:For state C: old heuristic=2208.0, new computed heuristic=2208.0 DEBUG:root:Chosen successor for C: D with action '0:C->D' (f-value=2208.0) DEBUG:root:Appending action '0:C->D' to path. Current path: ['1:A->C', '0:C->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E1: cost=64.0, heuristic=2560.0 -> f=2624.0 DEBUG:root:Successor F: cost=128.0, heuristic=2048.0 -> f=2176.0 DEBUG:root:Successor E2: cost=256.0, heuristic=3072.0 -> f=3328.0 DEBUG:root:For state D: old heuristic=2176.0, new computed heuristic=2176.0 DEBUG:root:Chosen successor for D: F with action '1:D->F' (f-value=2176.0) DEBUG:root:Appending action '1:D->F' to path. Current path: ['1:A->C', '0:C->D', '1:D->F'] DEBUG:root:Moving to new current state: F DEBUG:root:Successor G: cost=2048.0, heuristic=0 -> f=2048.0 DEBUG:root:For state F: old heuristic=2048.0, new computed heuristic=2048.0 DEBUG:root:Chosen successor for F: G with action '0:F->G' (f-value=2048.0) DEBUG:root:Appending action '0:F->G' to path. Current path: ['1:A->C', '0:C->D', '1:D->F', '0:F->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['1:A->C', '0:C->D', '1:D->F', '0:F->G'] DEBUG:root:Successor B: cost=2.0, heuristic=0 -> f=2.0 DEBUG:root:For state A: old heuristic=0, new computed heuristic=2.0 DEBUG:root:Updating heuristic for A from 0 to 2.0 DEBUG:root:Chosen successor for A: B with action 'Right' (f-value=2.0) DEBUG:root:Appending action 'Right' to path. Current path: ['Right'] DEBUG:root:Moving to new current state: B DEBUG:root:Successor H: cost=4.0, heuristic=0 -> f=4.0 DEBUG:root:Successor D: cost=1.0, heuristic=0 -> f=1.0 DEBUG:root:Successor C: cost=2.0, heuristic=0 -> f=2.0 DEBUG:root:Successor A: cost=2.0, heuristic=2.0 -> f=4.0 DEBUG:root:For state B: old heuristic=0, new computed heuristic=1.0 DEBUG:root:Updating heuristic for B from 0 to 1.0 DEBUG:root:Chosen successor for B: D with action 'Down' (f-value=1.0) DEBUG:root:Appending action 'Down' to path. Current path: ['Right', 'Down'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E: cost=2.5, heuristic=0 -> f=2.5 DEBUG:root:Successor F: cost=2.0, heuristic=0 -> f=2.0 DEBUG:root:Successor B: cost=1.0, heuristic=1.0 -> f=2.0 DEBUG:root:Successor G: cost=1.5, heuristic=0 -> f=1.5 DEBUG:root:For state D: old heuristic=0, new computed heuristic=1.5 DEBUG:root:Updating heuristic for D from 0 to 1.5 DEBUG:root:Chosen successor for D: G with action 'Left' (f-value=1.5) DEBUG:root:Appending action 'Left' to path. Current path: ['Right', 'Down', 'Left'] DEBUG:root:Moving to new current state: G DEBUG:root:Successor D: cost=1.5, heuristic=1.5 -> f=3.0 DEBUG:root:For state G: old heuristic=0, new computed heuristic=3.0 DEBUG:root:Updating heuristic for G from 0 to 3.0 DEBUG:root:Chosen successor for G: D with action 'Right' (f-value=3.0) DEBUG:root:Appending action 'Right' to path. Current path: ['Right', 'Down', 'Left', 'Right'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E: cost=2.5, heuristic=0 -> f=2.5 DEBUG:root:Successor F: cost=2.0, heuristic=0 -> f=2.0 DEBUG:root:Successor B: cost=1.0, heuristic=1.0 -> f=2.0 DEBUG:root:Successor G: cost=1.5, heuristic=3.0 -> f=4.5 DEBUG:root:For state D: old heuristic=1.5, new computed heuristic=2.0 DEBUG:root:Updating heuristic for D from 1.5 to 2.0 DEBUG:root:Chosen successor for D: F with action 'Down' (f-value=2.0) DEBUG:root:Appending action 'Down' to path. Current path: ['Right', 'Down', 'Left', 'Right', 'Down'] DEBUG:root:Moving to new current state: F DEBUG:root:Goal reached at state: F. Final path in trial: ['Right', 'Down', 'Left', 'Right', 'Down'] DEBUG:root:Successor B: cost=2.0, heuristic=1.0 -> f=3.0 DEBUG:root:For state A: old heuristic=2.0, new computed heuristic=3.0 DEBUG:root:Updating heuristic for A from 2.0 to 3.0 DEBUG:root:Chosen successor for A: B with action 'Right' (f-value=3.0) DEBUG:root:Appending action 'Right' to path. Current path: ['Right'] DEBUG:root:Moving to new current state: B DEBUG:root:Successor H: cost=4.0, heuristic=0 -> f=4.0 DEBUG:root:Successor D: cost=1.0, heuristic=2.0 -> f=3.0 DEBUG:root:Successor C: cost=2.0, heuristic=0 -> f=2.0 DEBUG:root:Successor A: cost=2.0, heuristic=3.0 -> f=5.0 DEBUG:root:For state B: old heuristic=1.0, new computed heuristic=2.0 DEBUG:root:Updating heuristic for B from 1.0 to 2.0 DEBUG:root:Chosen successor for B: C with action 'Up' (f-value=2.0) DEBUG:root:Appending action 'Up' to path. Current path: ['Right', 'Up'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor B: cost=2.0, heuristic=2.0 -> f=4.0 DEBUG:root:For state C: old heuristic=0, new computed heuristic=4.0 DEBUG:root:Updating heuristic for C from 0 to 4.0 DEBUG:root:Chosen successor for C: B with action 'Down' (f-value=4.0) DEBUG:root:Appending action 'Down' to path. Current path: ['Right', 'Up', 'Down'] DEBUG:root:Moving to new current state: B DEBUG:root:Successor H: cost=4.0, heuristic=0 -> f=4.0 DEBUG:root:Successor D: cost=1.0, heuristic=2.0 -> f=3.0 DEBUG:root:Successor C: cost=2.0, heuristic=4.0 -> f=6.0 DEBUG:root:Successor A: cost=2.0, heuristic=3.0 -> f=5.0 DEBUG:root:For state B: old heuristic=2.0, new computed heuristic=3.0 DEBUG:root:Updating heuristic for B from 2.0 to 3.0 DEBUG:root:Chosen successor for B: D with action 'Down' (f-value=3.0) DEBUG:root:Appending action 'Down' to path. Current path: ['Right', 'Up', 'Down', 'Down'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E: cost=2.5, heuristic=0 -> f=2.5 DEBUG:root:Successor F: cost=2.0, heuristic=0 -> f=2.0 DEBUG:root:Successor B: cost=1.0, heuristic=3.0 -> f=4.0 DEBUG:root:Successor G: cost=1.5, heuristic=3.0 -> f=4.5 DEBUG:root:For state D: old heuristic=2.0, new computed heuristic=2.0 DEBUG:root:Chosen successor for D: F with action 'Down' (f-value=2.0) DEBUG:root:Appending action 'Down' to path. Current path: ['Right', 'Up', 'Down', 'Down', 'Down'] DEBUG:root:Moving to new current state: F DEBUG:root:Goal reached at state: F. Final path in trial: ['Right', 'Up', 'Down', 'Down', 'Down'] DEBUG:root:Successor B: cost=2.0, heuristic=3.0 -> f=5.0 DEBUG:root:For state A: old heuristic=3.0, new computed heuristic=5.0 DEBUG:root:Updating heuristic for A from 3.0 to 5.0 DEBUG:root:Chosen successor for A: B with action 'Right' (f-value=5.0) DEBUG:root:Appending action 'Right' to path. Current path: ['Right'] DEBUG:root:Moving to new current state: B DEBUG:root:Successor H: cost=4.0, heuristic=0 -> f=4.0 DEBUG:root:Successor D: cost=1.0, heuristic=2.0 -> f=3.0 DEBUG:root:Successor C: cost=2.0, heuristic=4.0 -> f=6.0 DEBUG:root:Successor A: cost=2.0, heuristic=5.0 -> f=7.0 DEBUG:root:For state B: old heuristic=3.0, new computed heuristic=3.0 DEBUG:root:Chosen successor for B: D with action 'Down' (f-value=3.0) DEBUG:root:Appending action 'Down' to path. Current path: ['Right', 'Down'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E: cost=2.5, heuristic=0 -> f=2.5 DEBUG:root:Successor F: cost=2.0, heuristic=0 -> f=2.0 DEBUG:root:Successor B: cost=1.0, heuristic=3.0 -> f=4.0 DEBUG:root:Successor G: cost=1.5, heuristic=3.0 -> f=4.5 DEBUG:root:For state D: old heuristic=2.0, new computed heuristic=2.0 DEBUG:root:Chosen successor for D: F with action 'Down' (f-value=2.0) DEBUG:root:Appending action 'Down' to path. Current path: ['Right', 'Down', 'Down'] DEBUG:root:Moving to new current state: F DEBUG:root:Goal reached at state: F. Final path in trial: ['Right', 'Down', 'Down'] DEBUG:root:Successor B: cost=2.0, heuristic=3.0 -> f=5.0 DEBUG:root:For state A: old heuristic=5.0, new computed heuristic=5.0 DEBUG:root:Chosen successor for A: B with action 'Right' (f-value=5.0) DEBUG:root:Appending action 'Right' to path. Current path: ['Right'] DEBUG:root:Moving to new current state: B DEBUG:root:Successor H: cost=4.0, heuristic=0 -> f=4.0 DEBUG:root:Successor D: cost=1.0, heuristic=2.0 -> f=3.0 DEBUG:root:Successor C: cost=2.0, heuristic=4.0 -> f=6.0 DEBUG:root:Successor A: cost=2.0, heuristic=5.0 -> f=7.0 DEBUG:root:For state B: old heuristic=3.0, new computed heuristic=3.0 DEBUG:root:Chosen successor for B: D with action 'Down' (f-value=3.0) DEBUG:root:Appending action 'Down' to path. Current path: ['Right', 'Down'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E: cost=2.5, heuristic=0 -> f=2.5 DEBUG:root:Successor F: cost=2.0, heuristic=0 -> f=2.0 DEBUG:root:Successor B: cost=1.0, heuristic=3.0 -> f=4.0 DEBUG:root:Successor G: cost=1.5, heuristic=3.0 -> f=4.5 DEBUG:root:For state D: old heuristic=2.0, new computed heuristic=2.0 DEBUG:root:Chosen successor for D: F with action 'Down' (f-value=2.0) DEBUG:root:Appending action 'Down' to path. Current path: ['Right', 'Down', 'Down'] DEBUG:root:Moving to new current state: F DEBUG:root:Goal reached at state: F. Final path in trial: ['Right', 'Down', 'Down'] DEBUG:root:Successor D: cost=1.0, heuristic=7.0 -> f=8.0 DEBUG:root:Successor B: cost=3.0, heuristic=4.0 -> f=7.0 DEBUG:root:For state A: old heuristic=8.0, new computed heuristic=7.0 DEBUG:root:Chosen successor for A: B with action '1:A->B' (f-value=7.0) DEBUG:root:Appending action '1:A->B' to path. Current path: ['1:A->B'] DEBUG:root:Moving to new current state: B DEBUG:root:Successor C: cost=3.0, heuristic=1.0 -> f=4.0 DEBUG:root:Successor A: cost=3.0, heuristic=8.0 -> f=11.0 DEBUG:root:For state B: old heuristic=4.0, new computed heuristic=4.0 DEBUG:root:Chosen successor for B: C with action '0:B->C' (f-value=4.0) DEBUG:root:Appending action '0:B->C' to path. Current path: ['1:A->B', '0:B->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor G: cost=3.0, heuristic=0.0 -> f=3.0 DEBUG:root:Successor B: cost=3.0, heuristic=4.0 -> f=7.0 DEBUG:root:For state C: old heuristic=1.0, new computed heuristic=3.0 DEBUG:root:Updating heuristic for C from 1.0 to 3.0 DEBUG:root:Chosen successor for C: G with action '0:C->G' (f-value=3.0) DEBUG:root:Appending action '0:C->G' to path. Current path: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Successor D: cost=1.0, heuristic=7.0 -> f=8.0 DEBUG:root:Successor B: cost=3.0, heuristic=4.0 -> f=7.0 DEBUG:root:For state A: old heuristic=8.0, new computed heuristic=7.0 DEBUG:root:Chosen successor for A: B with action '1:A->B' (f-value=7.0) DEBUG:root:Appending action '1:A->B' to path. Current path: ['1:A->B'] DEBUG:root:Moving to new current state: B DEBUG:root:Successor C: cost=3.0, heuristic=3.0 -> f=6.0 DEBUG:root:Successor A: cost=3.0, heuristic=8.0 -> f=11.0 DEBUG:root:For state B: old heuristic=4.0, new computed heuristic=6.0 DEBUG:root:Updating heuristic for B from 4.0 to 6.0 DEBUG:root:Chosen successor for B: C with action '0:B->C' (f-value=6.0) DEBUG:root:Appending action '0:B->C' to path. Current path: ['1:A->B', '0:B->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor G: cost=3.0, heuristic=0.0 -> f=3.0 DEBUG:root:Successor B: cost=3.0, heuristic=6.0 -> f=9.0 DEBUG:root:For state C: old heuristic=3.0, new computed heuristic=3.0 DEBUG:root:Chosen successor for C: G with action '0:C->G' (f-value=3.0) DEBUG:root:Appending action '0:C->G' to path. Current path: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Successor D: cost=1.0, heuristic=7.0 -> f=8.0 DEBUG:root:Successor B: cost=3.0, heuristic=6.0 -> f=9.0 DEBUG:root:For state A: old heuristic=8.0, new computed heuristic=8.0 DEBUG:root:Chosen successor for A: D with action '0:A->D' (f-value=8.0) DEBUG:root:Appending action '0:A->D' to path. Current path: ['0:A->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E: cost=1.0, heuristic=6.0 -> f=7.0 DEBUG:root:Successor A: cost=1.0, heuristic=8.0 -> f=9.0 DEBUG:root:For state D: old heuristic=7.0, new computed heuristic=7.0 DEBUG:root:Chosen successor for D: E with action '0:D->E' (f-value=7.0) DEBUG:root:Appending action '0:D->E' to path. Current path: ['0:A->D', '0:D->E'] DEBUG:root:Moving to new current state: E DEBUG:root:Successor G: cost=10.0, heuristic=0.0 -> f=10.0 DEBUG:root:Successor D: cost=1.0, heuristic=7.0 -> f=8.0 DEBUG:root:For state E: old heuristic=6.0, new computed heuristic=8.0 DEBUG:root:Updating heuristic for E from 6.0 to 8.0 DEBUG:root:Chosen successor for E: D with action '0:E->D' (f-value=8.0) DEBUG:root:Appending action '0:E->D' to path. Current path: ['0:A->D', '0:D->E', '0:E->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E: cost=1.0, heuristic=8.0 -> f=9.0 DEBUG:root:Successor A: cost=1.0, heuristic=8.0 -> f=9.0 DEBUG:root:For state D: old heuristic=7.0, new computed heuristic=9.0 DEBUG:root:Updating heuristic for D from 7.0 to 9.0 DEBUG:root:Chosen successor for D: E with action '0:D->E' (f-value=9.0) DEBUG:root:Appending action '0:D->E' to path. Current path: ['0:A->D', '0:D->E', '0:E->D', '0:D->E'] DEBUG:root:Moving to new current state: E DEBUG:root:Successor G: cost=10.0, heuristic=0.0 -> f=10.0 DEBUG:root:Successor D: cost=1.0, heuristic=9.0 -> f=10.0 DEBUG:root:For state E: old heuristic=8.0, new computed heuristic=10.0 DEBUG:root:Updating heuristic for E from 8.0 to 10.0 DEBUG:root:Chosen successor for E: G with action '0:E->G' (f-value=10.0) DEBUG:root:Appending action '0:E->G' to path. Current path: ['0:A->D', '0:D->E', '0:E->D', '0:D->E', '0:E->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['0:A->D', '0:D->E', '0:E->D', '0:D->E', '0:E->G'] DEBUG:root:Successor D: cost=1.0, heuristic=9.0 -> f=10.0 DEBUG:root:Successor B: cost=3.0, heuristic=6.0 -> f=9.0 DEBUG:root:For state A: old heuristic=8.0, new computed heuristic=9.0 DEBUG:root:Updating heuristic for A from 8.0 to 9.0 DEBUG:root:Chosen successor for A: B with action '1:A->B' (f-value=9.0) DEBUG:root:Appending action '1:A->B' to path. Current path: ['1:A->B'] DEBUG:root:Moving to new current state: B DEBUG:root:Successor C: cost=3.0, heuristic=3.0 -> f=6.0 DEBUG:root:Successor A: cost=3.0, heuristic=9.0 -> f=12.0 DEBUG:root:For state B: old heuristic=6.0, new computed heuristic=6.0 DEBUG:root:Chosen successor for B: C with action '0:B->C' (f-value=6.0) DEBUG:root:Appending action '0:B->C' to path. Current path: ['1:A->B', '0:B->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor G: cost=3.0, heuristic=0.0 -> f=3.0 DEBUG:root:Successor B: cost=3.0, heuristic=6.0 -> f=9.0 DEBUG:root:For state C: old heuristic=3.0, new computed heuristic=3.0 DEBUG:root:Chosen successor for C: G with action '0:C->G' (f-value=3.0) DEBUG:root:Appending action '0:C->G' to path. Current path: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Successor D: cost=1.0, heuristic=9.0 -> f=10.0 DEBUG:root:Successor B: cost=3.0, heuristic=6.0 -> f=9.0 DEBUG:root:For state A: old heuristic=9.0, new computed heuristic=9.0 DEBUG:root:Chosen successor for A: B with action '1:A->B' (f-value=9.0) DEBUG:root:Appending action '1:A->B' to path. Current path: ['1:A->B'] DEBUG:root:Moving to new current state: B DEBUG:root:Successor C: cost=3.0, heuristic=3.0 -> f=6.0 DEBUG:root:Successor A: cost=3.0, heuristic=9.0 -> f=12.0 DEBUG:root:For state B: old heuristic=6.0, new computed heuristic=6.0 DEBUG:root:Chosen successor for B: C with action '0:B->C' (f-value=6.0) DEBUG:root:Appending action '0:B->C' to path. Current path: ['1:A->B', '0:B->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor G: cost=3.0, heuristic=0.0 -> f=3.0 DEBUG:root:Successor B: cost=3.0, heuristic=6.0 -> f=9.0 DEBUG:root:For state C: old heuristic=3.0, new computed heuristic=3.0 DEBUG:root:Chosen successor for C: G with action '0:C->G' (f-value=3.0) DEBUG:root:Appending action '0:C->G' to path. Current path: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Successor D: cost=1.0, heuristic=2.0 -> f=3.0 DEBUG:root:Successor B: cost=3.0, heuristic=6.0 -> f=9.0 DEBUG:root:For state A: old heuristic=8.0, new computed heuristic=3.0 DEBUG:root:Chosen successor for A: D with action '0:A->D' (f-value=3.0) DEBUG:root:Appending action '0:A->D' to path. Current path: ['0:A->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E: cost=1.0, heuristic=1.0 -> f=2.0 DEBUG:root:Successor A: cost=1.0, heuristic=8.0 -> f=9.0 DEBUG:root:For state D: old heuristic=2.0, new computed heuristic=2.0 DEBUG:root:Chosen successor for D: E with action '0:D->E' (f-value=2.0) DEBUG:root:Appending action '0:D->E' to path. Current path: ['0:A->D', '0:D->E'] DEBUG:root:Moving to new current state: E DEBUG:root:Successor G: cost=10.0, heuristic=0.0 -> f=10.0 DEBUG:root:Successor D: cost=1.0, heuristic=2.0 -> f=3.0 DEBUG:root:For state E: old heuristic=1.0, new computed heuristic=3.0 DEBUG:root:Updating heuristic for E from 1.0 to 3.0 DEBUG:root:Chosen successor for E: D with action '0:E->D' (f-value=3.0) DEBUG:root:Appending action '0:E->D' to path. Current path: ['0:A->D', '0:D->E', '0:E->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E: cost=1.0, heuristic=3.0 -> f=4.0 DEBUG:root:Successor A: cost=1.0, heuristic=8.0 -> f=9.0 DEBUG:root:For state D: old heuristic=2.0, new computed heuristic=4.0 DEBUG:root:Updating heuristic for D from 2.0 to 4.0 DEBUG:root:Chosen successor for D: E with action '0:D->E' (f-value=4.0) DEBUG:root:Appending action '0:D->E' to path. Current path: ['0:A->D', '0:D->E', '0:E->D', '0:D->E'] DEBUG:root:Moving to new current state: E DEBUG:root:Successor G: cost=10.0, heuristic=0.0 -> f=10.0 DEBUG:root:Successor D: cost=1.0, heuristic=4.0 -> f=5.0 DEBUG:root:For state E: old heuristic=3.0, new computed heuristic=5.0 DEBUG:root:Updating heuristic for E from 3.0 to 5.0 DEBUG:root:Chosen successor for E: D with action '0:E->D' (f-value=5.0) DEBUG:root:Appending action '0:E->D' to path. Current path: ['0:A->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E: cost=1.0, heuristic=5.0 -> f=6.0 DEBUG:root:Successor A: cost=1.0, heuristic=8.0 -> f=9.0 DEBUG:root:For state D: old heuristic=4.0, new computed heuristic=6.0 DEBUG:root:Updating heuristic for D from 4.0 to 6.0 DEBUG:root:Chosen successor for D: E with action '0:D->E' (f-value=6.0) DEBUG:root:Appending action '0:D->E' to path. Current path: ['0:A->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E'] DEBUG:root:Moving to new current state: E DEBUG:root:Successor G: cost=10.0, heuristic=0.0 -> f=10.0 DEBUG:root:Successor D: cost=1.0, heuristic=6.0 -> f=7.0 DEBUG:root:For state E: old heuristic=5.0, new computed heuristic=7.0 DEBUG:root:Updating heuristic for E from 5.0 to 7.0 DEBUG:root:Chosen successor for E: D with action '0:E->D' (f-value=7.0) DEBUG:root:Appending action '0:E->D' to path. Current path: ['0:A->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E: cost=1.0, heuristic=7.0 -> f=8.0 DEBUG:root:Successor A: cost=1.0, heuristic=8.0 -> f=9.0 DEBUG:root:For state D: old heuristic=6.0, new computed heuristic=8.0 DEBUG:root:Updating heuristic for D from 6.0 to 8.0 DEBUG:root:Chosen successor for D: E with action '0:D->E' (f-value=8.0) DEBUG:root:Appending action '0:D->E' to path. Current path: ['0:A->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E'] DEBUG:root:Moving to new current state: E DEBUG:root:Successor G: cost=10.0, heuristic=0.0 -> f=10.0 DEBUG:root:Successor D: cost=1.0, heuristic=8.0 -> f=9.0 DEBUG:root:For state E: old heuristic=7.0, new computed heuristic=9.0 DEBUG:root:Updating heuristic for E from 7.0 to 9.0 DEBUG:root:Chosen successor for E: D with action '0:E->D' (f-value=9.0) DEBUG:root:Appending action '0:E->D' to path. Current path: ['0:A->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor E: cost=1.0, heuristic=9.0 -> f=10.0 DEBUG:root:Successor A: cost=1.0, heuristic=8.0 -> f=9.0 DEBUG:root:For state D: old heuristic=8.0, new computed heuristic=9.0 DEBUG:root:Updating heuristic for D from 8.0 to 9.0 DEBUG:root:Chosen successor for D: A with action '1:D->A' (f-value=9.0) DEBUG:root:Appending action '1:D->A' to path. Current path: ['0:A->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '1:D->A'] DEBUG:root:Moving to new current state: A DEBUG:root:Successor D: cost=1.0, heuristic=9.0 -> f=10.0 DEBUG:root:Successor B: cost=3.0, heuristic=6.0 -> f=9.0 DEBUG:root:For state A: old heuristic=8.0, new computed heuristic=9.0 DEBUG:root:Updating heuristic for A from 8.0 to 9.0 DEBUG:root:Chosen successor for A: B with action '1:A->B' (f-value=9.0) DEBUG:root:Appending action '1:A->B' to path. Current path: ['0:A->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '1:D->A', '1:A->B'] DEBUG:root:Moving to new current state: B DEBUG:root:Successor C: cost=3.0, heuristic=3.0 -> f=6.0 DEBUG:root:Successor A: cost=3.0, heuristic=9.0 -> f=12.0 DEBUG:root:For state B: old heuristic=6.0, new computed heuristic=6.0 DEBUG:root:Chosen successor for B: C with action '0:B->C' (f-value=6.0) DEBUG:root:Appending action '0:B->C' to path. Current path: ['0:A->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '1:D->A', '1:A->B', '0:B->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor G: cost=3.0, heuristic=0.0 -> f=3.0 DEBUG:root:Successor B: cost=3.0, heuristic=6.0 -> f=9.0 DEBUG:root:For state C: old heuristic=3.0, new computed heuristic=3.0 DEBUG:root:Chosen successor for C: G with action '0:C->G' (f-value=3.0) DEBUG:root:Appending action '0:C->G' to path. Current path: ['0:A->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '1:D->A', '1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['0:A->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '0:D->E', '0:E->D', '1:D->A', '1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Successor D: cost=1.0, heuristic=9.0 -> f=10.0 DEBUG:root:Successor B: cost=3.0, heuristic=6.0 -> f=9.0 DEBUG:root:For state A: old heuristic=9.0, new computed heuristic=9.0 DEBUG:root:Chosen successor for A: B with action '1:A->B' (f-value=9.0) DEBUG:root:Appending action '1:A->B' to path. Current path: ['1:A->B'] DEBUG:root:Moving to new current state: B DEBUG:root:Successor C: cost=3.0, heuristic=3.0 -> f=6.0 DEBUG:root:Successor A: cost=3.0, heuristic=9.0 -> f=12.0 DEBUG:root:For state B: old heuristic=6.0, new computed heuristic=6.0 DEBUG:root:Chosen successor for B: C with action '0:B->C' (f-value=6.0) DEBUG:root:Appending action '0:B->C' to path. Current path: ['1:A->B', '0:B->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor G: cost=3.0, heuristic=0.0 -> f=3.0 DEBUG:root:Successor B: cost=3.0, heuristic=6.0 -> f=9.0 DEBUG:root:For state C: old heuristic=3.0, new computed heuristic=3.0 DEBUG:root:Chosen successor for C: G with action '0:C->G' (f-value=3.0) DEBUG:root:Appending action '0:C->G' to path. Current path: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Successor A: cost=2.0, heuristic=2.5 -> f=4.5 DEBUG:root:Successor B: cost=3.0, heuristic=5.25 -> f=8.25 DEBUG:root:Successor D: cost=5.0, heuristic=1.0625 -> f=6.0625 DEBUG:root:For state S: old heuristic=6.0, new computed heuristic=4.5 DEBUG:root:Chosen successor for S: A with action '0' (f-value=4.5) DEBUG:root:Appending action '0' to path. Current path: ['0'] DEBUG:root:Moving to new current state: A DEBUG:root:Successor C: cost=3.0, heuristic=1.125 -> f=4.125 DEBUG:root:Successor S: cost=2.0, heuristic=6.0 -> f=8.0 DEBUG:root:For state A: old heuristic=2.5, new computed heuristic=4.125 DEBUG:root:Updating heuristic for A from 2.5 to 4.125 DEBUG:root:Chosen successor for A: C with action '0' (f-value=4.125) DEBUG:root:Appending action '0' to path. Current path: ['0', '0'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor A: cost=3.0, heuristic=4.125 -> f=7.125 DEBUG:root:Successor D: cost=1.0, heuristic=1.0625 -> f=2.0625 DEBUG:root:Successor G: cost=2.0, heuristic=0.0 -> f=2.0 DEBUG:root:For state C: old heuristic=1.125, new computed heuristic=2.0 DEBUG:root:Updating heuristic for C from 1.125 to 2.0 DEBUG:root:Chosen successor for C: G with action '2' (f-value=2.0) DEBUG:root:Appending action '2' to path. Current path: ['0', '0', '2'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['0', '0', '2'] DEBUG:root:Successor A: cost=2.0, heuristic=4.125 -> f=6.125 DEBUG:root:Successor B: cost=3.0, heuristic=5.25 -> f=8.25 DEBUG:root:Successor D: cost=5.0, heuristic=1.0625 -> f=6.0625 DEBUG:root:For state S: old heuristic=6.0, new computed heuristic=6.0625 DEBUG:root:Updating heuristic for S from 6.0 to 6.0625 DEBUG:root:Chosen successor for S: D with action '2' (f-value=6.0625) DEBUG:root:Appending action '2' to path. Current path: ['2'] DEBUG:root:Moving to new current state: D DEBUG:root:Successor B: cost=4.0, heuristic=5.25 -> f=9.25 DEBUG:root:Successor C: cost=1.0, heuristic=2.0 -> f=3.0 DEBUG:root:Successor G: cost=5.0, heuristic=0.0 -> f=5.0 DEBUG:root:Successor S: cost=5.0, heuristic=6.0625 -> f=11.0625 DEBUG:root:For state D: old heuristic=1.0625, new computed heuristic=3.0 DEBUG:root:Updating heuristic for D from 1.0625 to 3.0 DEBUG:root:Chosen successor for D: C with action '1' (f-value=3.0) DEBUG:root:Appending action '1' to path. Current path: ['2', '1'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor A: cost=3.0, heuristic=4.125 -> f=7.125 DEBUG:root:Successor D: cost=1.0, heuristic=3.0 -> f=4.0 DEBUG:root:Successor G: cost=2.0, heuristic=0.0 -> f=2.0 DEBUG:root:For state C: old heuristic=2.0, new computed heuristic=2.0 DEBUG:root:Chosen successor for C: G with action '2' (f-value=2.0) DEBUG:root:Appending action '2' to path. Current path: ['2', '1', '2'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['2', '1', '2'] DEBUG:root:Successor A: cost=2.0, heuristic=4.125 -> f=6.125 DEBUG:root:Successor B: cost=3.0, heuristic=5.25 -> f=8.25 DEBUG:root:Successor D: cost=5.0, heuristic=3.0 -> f=8.0 DEBUG:root:For state S: old heuristic=6.0625, new computed heuristic=6.125 DEBUG:root:Updating heuristic for S from 6.0625 to 6.125 DEBUG:root:Chosen successor for S: A with action '0' (f-value=6.125) DEBUG:root:Appending action '0' to path. Current path: ['0'] DEBUG:root:Moving to new current state: A DEBUG:root:Successor C: cost=3.0, heuristic=2.0 -> f=5.0 DEBUG:root:Successor S: cost=2.0, heuristic=6.125 -> f=8.125 DEBUG:root:For state A: old heuristic=4.125, new computed heuristic=5.0 DEBUG:root:Updating heuristic for A from 4.125 to 5.0 DEBUG:root:Chosen successor for A: C with action '0' (f-value=5.0) DEBUG:root:Appending action '0' to path. Current path: ['0', '0'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor A: cost=3.0, heuristic=5.0 -> f=8.0 DEBUG:root:Successor D: cost=1.0, heuristic=3.0 -> f=4.0 DEBUG:root:Successor G: cost=2.0, heuristic=0.0 -> f=2.0 DEBUG:root:For state C: old heuristic=2.0, new computed heuristic=2.0 DEBUG:root:Chosen successor for C: G with action '2' (f-value=2.0) DEBUG:root:Appending action '2' to path. Current path: ['0', '0', '2'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['0', '0', '2'] DEBUG:root:Successor A: cost=2.0, heuristic=5.0 -> f=7.0 DEBUG:root:Successor B: cost=3.0, heuristic=5.25 -> f=8.25 DEBUG:root:Successor D: cost=5.0, heuristic=3.0 -> f=8.0 DEBUG:root:For state S: old heuristic=6.125, new computed heuristic=7.0 DEBUG:root:Updating heuristic for S from 6.125 to 7.0 DEBUG:root:Chosen successor for S: A with action '0' (f-value=7.0) DEBUG:root:Appending action '0' to path. Current path: ['0'] DEBUG:root:Moving to new current state: A DEBUG:root:Successor C: cost=3.0, heuristic=2.0 -> f=5.0 DEBUG:root:Successor S: cost=2.0, heuristic=7.0 -> f=9.0 DEBUG:root:For state A: old heuristic=5.0, new computed heuristic=5.0 DEBUG:root:Chosen successor for A: C with action '0' (f-value=5.0) DEBUG:root:Appending action '0' to path. Current path: ['0', '0'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor A: cost=3.0, heuristic=5.0 -> f=8.0 DEBUG:root:Successor D: cost=1.0, heuristic=3.0 -> f=4.0 DEBUG:root:Successor G: cost=2.0, heuristic=0.0 -> f=2.0 DEBUG:root:For state C: old heuristic=2.0, new computed heuristic=2.0 DEBUG:root:Chosen successor for C: G with action '2' (f-value=2.0) DEBUG:root:Appending action '2' to path. Current path: ['0', '0', '2'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['0', '0', '2'] DEBUG:root:Successor A: cost=2.0, heuristic=5.0 -> f=7.0 DEBUG:root:Successor B: cost=3.0, heuristic=5.25 -> f=8.25 DEBUG:root:Successor D: cost=5.0, heuristic=3.0 -> f=8.0 DEBUG:root:For state S: old heuristic=7.0, new computed heuristic=7.0 DEBUG:root:Chosen successor for S: A with action '0' (f-value=7.0) DEBUG:root:Appending action '0' to path. Current path: ['0'] DEBUG:root:Moving to new current state: A DEBUG:root:Successor C: cost=3.0, heuristic=2.0 -> f=5.0 DEBUG:root:Successor S: cost=2.0, heuristic=7.0 -> f=9.0 DEBUG:root:For state A: old heuristic=5.0, new computed heuristic=5.0 DEBUG:root:Chosen successor for A: C with action '0' (f-value=5.0) DEBUG:root:Appending action '0' to path. Current path: ['0', '0'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor A: cost=3.0, heuristic=5.0 -> f=8.0 DEBUG:root:Successor D: cost=1.0, heuristic=3.0 -> f=4.0 DEBUG:root:Successor G: cost=2.0, heuristic=0.0 -> f=2.0 DEBUG:root:For state C: old heuristic=2.0, new computed heuristic=2.0 DEBUG:root:Chosen successor for C: G with action '2' (f-value=2.0) DEBUG:root:Appending action '2' to path. Current path: ['0', '0', '2'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['0', '0', '2'] DEBUG:root:Successor G: cost=10.0, heuristic=0 -> f=10.0 DEBUG:root:Successor B: cost=1.0, heuristic=0 -> f=1.0 DEBUG:root:For state A: old heuristic=0, new computed heuristic=1.0 DEBUG:root:Updating heuristic for A from 0 to 1.0 DEBUG:root:Chosen successor for A: B with action '1:A->B' (f-value=1.0) DEBUG:root:Appending action '1:A->B' to path. Current path: ['1:A->B'] DEBUG:root:Moving to new current state: B DEBUG:root:Successor C: cost=1.0, heuristic=0 -> f=1.0 DEBUG:root:For state B: old heuristic=0, new computed heuristic=1.0 DEBUG:root:Updating heuristic for B from 0 to 1.0 DEBUG:root:Chosen successor for B: C with action '0:B->C' (f-value=1.0) DEBUG:root:Appending action '0:B->C' to path. Current path: ['1:A->B', '0:B->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor G: cost=1.0, heuristic=0 -> f=1.0 DEBUG:root:For state C: old heuristic=0, new computed heuristic=1.0 DEBUG:root:Updating heuristic for C from 0 to 1.0 DEBUG:root:Chosen successor for C: G with action '0:C->G' (f-value=1.0) DEBUG:root:Appending action '0:C->G' to path. Current path: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Successor G: cost=10.0, heuristic=0 -> f=10.0 DEBUG:root:Successor B: cost=1.0, heuristic=1.0 -> f=2.0 DEBUG:root:For state A: old heuristic=1.0, new computed heuristic=2.0 DEBUG:root:Updating heuristic for A from 1.0 to 2.0 DEBUG:root:Chosen successor for A: B with action '1:A->B' (f-value=2.0) DEBUG:root:Appending action '1:A->B' to path. Current path: ['1:A->B'] DEBUG:root:Moving to new current state: B DEBUG:root:Successor C: cost=1.0, heuristic=1.0 -> f=2.0 DEBUG:root:For state B: old heuristic=1.0, new computed heuristic=2.0 DEBUG:root:Updating heuristic for B from 1.0 to 2.0 DEBUG:root:Chosen successor for B: C with action '0:B->C' (f-value=2.0) DEBUG:root:Appending action '0:B->C' to path. Current path: ['1:A->B', '0:B->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor G: cost=1.0, heuristic=0 -> f=1.0 DEBUG:root:For state C: old heuristic=1.0, new computed heuristic=1.0 DEBUG:root:Chosen successor for C: G with action '0:C->G' (f-value=1.0) DEBUG:root:Appending action '0:C->G' to path. Current path: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Successor G: cost=10.0, heuristic=0 -> f=10.0 DEBUG:root:Successor B: cost=1.0, heuristic=2.0 -> f=3.0 DEBUG:root:For state A: old heuristic=2.0, new computed heuristic=3.0 DEBUG:root:Updating heuristic for A from 2.0 to 3.0 DEBUG:root:Chosen successor for A: B with action '1:A->B' (f-value=3.0) DEBUG:root:Appending action '1:A->B' to path. Current path: ['1:A->B'] DEBUG:root:Moving to new current state: B DEBUG:root:Successor C: cost=1.0, heuristic=1.0 -> f=2.0 DEBUG:root:For state B: old heuristic=2.0, new computed heuristic=2.0 DEBUG:root:Chosen successor for B: C with action '0:B->C' (f-value=2.0) DEBUG:root:Appending action '0:B->C' to path. Current path: ['1:A->B', '0:B->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor G: cost=1.0, heuristic=0 -> f=1.0 DEBUG:root:For state C: old heuristic=1.0, new computed heuristic=1.0 DEBUG:root:Chosen successor for C: G with action '0:C->G' (f-value=1.0) DEBUG:root:Appending action '0:C->G' to path. Current path: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Successor G: cost=10.0, heuristic=0 -> f=10.0 DEBUG:root:Successor B: cost=1.0, heuristic=2.0 -> f=3.0 DEBUG:root:For state A: old heuristic=3.0, new computed heuristic=3.0 DEBUG:root:Chosen successor for A: B with action '1:A->B' (f-value=3.0) DEBUG:root:Appending action '1:A->B' to path. Current path: ['1:A->B'] DEBUG:root:Moving to new current state: B DEBUG:root:Successor C: cost=1.0, heuristic=1.0 -> f=2.0 DEBUG:root:For state B: old heuristic=2.0, new computed heuristic=2.0 DEBUG:root:Chosen successor for B: C with action '0:B->C' (f-value=2.0) DEBUG:root:Appending action '0:B->C' to path. Current path: ['1:A->B', '0:B->C'] DEBUG:root:Moving to new current state: C DEBUG:root:Successor G: cost=1.0, heuristic=0 -> f=1.0 DEBUG:root:For state C: old heuristic=1.0, new computed heuristic=1.0 DEBUG:root:Chosen successor for C: G with action '0:C->G' (f-value=1.0) DEBUG:root:Appending action '0:C->G' to path. Current path: ['1:A->B', '0:B->C', '0:C->G'] DEBUG:root:Moving to new current state: G DEBUG:root:Goal reached at state: G. Final path in trial: ['1:A->B', '0:B->C', '0:C->G'] before grades Starting on 3-24 at 4:28:34 after grades Question part1 ============== *** Search time: 0:00:00.290539 *** PASS: marking/part1/food_heuristic_grade_tricky.test *** expanded nodes: 719 *** thresholds: [15000, 12500, 10000, 4200] *** Search time: 0:00:00.220049 *** 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', 'D', 'B', 'A', 'G', 'D', 'B', 'D', 'A', 'B', 'C', 'B', 'A', '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'] *** 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', 'B', 'A', 'A', 'D', 'E', 'D', 'A', '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', 'D', 'A', 'D', 'E', 'A', 'A', 'B', 'C', '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', 'S', 'C', 'A', 'S', 'S', 'D', 'S', '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 4:28:35 Provisional grades ================== Question part1: 2.00/2 Question part2: 3.00/3 Question part3: 0.67/2 ------------------ Total passed test cases: 5.67/7