About
In this game, you are given a map with obstacles, and your task is to guess how good the A* algorithm will be at finding the shortest path from the entrance to the exit. What is A*? Let us start with Breadth First Search (BFS). In this algorithm, we proceed in waves: find all locations next to the source, then next to these locations, etc., until we reach the target. It is obvious that we will…
