class Theseus::Solvers::Backtracker
An implementation of a recursive backtracker for solving a maze. Although it will work (eventually) for multiply-connected mazes, it will almost certainly not return an optimal solution in that case. Thus, this solver is best suited only for “perfect” mazes (those with no loops).
For mazes that contain loops, see the Theseus::Solvers::Astar
class.
Constants
- VISIT_MASK