Bytes
It does not really matter whether we call them caves, mazes, or mines. As long as there are paths, dead ends, and hidden corners to get lost in, there is room for adventure.
In this project, we will use a fictional gold mine as a shared setting to explore different pathfinding problems and the algorithms behind them.
We will start with the foundations: how to represent the map in a structure that can later support search and navigation. From there, we will move to the classic problem of finding the shortest path between two points, and then gradually add more difficulty, with moving enemies and even the challenge of finding the longest possible escape route.
- Representing a Gold Mine
- Escaping the Mine: The Shortest Path
- Escaping the Monster in the Mine
- Escaping with the Most Gold