Assignment A4

Description

Part 4

Breakdown
For part 4, we had to implement an increase to the weight of the hueristic cost. Essentially, to create weighted A*. We considered the bigger g-value for setting the tie-breaker between f-values. However, the number of expanded nodes and length of the path do not change when the heuristic is increased.

Euclidean Outputs
1. Testcase 1
• Part 1
Heurisitc multiplied by 2
Length of solution: 26. Number of expanded nodes: 359
• Part 2
Heurisitc multiplied by 4
Length of solution: 26. Number of expanded nodes: 359
• Part 3
Heurisitc multiplied by 8
Length of solution: 26. Number of expanded nodes: 359
2. Testcase 2
• Part 1
Heurisitc multiplied by 2
Length of solution: 75 Number of expanded nodes: 2180
• Part 2
Heurisitc multiplied by 4
Length of solution: 75 Number of expanded nodes: 2180
• Part 3
Heurisitc multiplied by 8
Length of solution: 75 Number of expanded nodes: 2180

Manhattan Outputs
1. Testcase 1
• Part 1
Heurisitc multiplied by 2
Length of solution: 33 Number of expanded nodes: 318
• Part 2
Heurisitc multiplied by 4
Length of solution: 33 Number of expanded nodes: 318
• Part 3
Heurisitc multiplied by 8
Length of solution: 33 Number of expanded nodes: 318
2. Testcase 2
• Part 1
Heurisitc multiplied by 2
Length of solution: 77 Number of expanded nodes: 1650
• Part 2
Heurisitc multiplied by 4
Length of solution: 77 Number of expanded nodes: 1650
• Part 3
Heurisitc multiplied by 8
Length of solution: 77 Number of expanded nodes: 1650