Python programming and analysis
Explain your heuristics.think these simple criteria and strategies before learning the Dijkstra algorithm
Implement Dijkstra’s algorithm to find the shortest path between 2 points (30%)
How the algorithm maps to the game setting? How it varies for the two game modes?
Do not copy/paste an implementation from online code. Comment the code so that it is clear that you understand what does what.
Use a version of the algorithm close to the original one