Pick an algorithm and watch a mouse route through a maze toward the cheese.
Click any open tile to move the cheese and re-run the pathfinder.
BFS: Finds the shortest path in number of steps.
Dijkstra: Uniform-cost search, equivalent to BFS on this grid.
A*: Uses Manhattan distance to guide search faster.