How does the simulation handle the differences created by the different move types
a. Where and how is A* implemented?
b. How does the simulation handle the differences created by the different move types?
i. Are there differences in how node expansion is handled?
ii. Are there differences in how the heuristic is calculated?
c. Is there a move type that results in more efficient movement?
d. Is it possible to get stuck, i.e., fail to find a solution?
e. Can you think of a scenario where some move types will fail to produce a solution but
others will succeed?
f. Write a short paragraph explaining how you would repurpose this code to solve a
practical problem, whether in game AI, Robotics or some other real-world application.
