class Theseus::Algorithms::RecursiveBacktracker
The recursive backtracking algorithm is a quick, flexible algorithm for generating mazes. It tends to produce mazes with fewer dead-ends than algorithms like Kruskal's or Prim's.
Attributes
x[R]
The x-coordinate that the generation algorithm will consider next.
y[R]
The y-coordinate that the generation algorithm will consider next.