algorithms

From a maze to the Müller–Brown surface with one cost function: Dijkstra and A* hunting the lowest route between two minima, with temperature deciding what ’lowest’ means.