Mazes in general (and hence algorithms to create Mazes) can be organized along seven different classifications. - Maze Classification / HN

see also

• Zero Lines Maze: What the 8-Bit Guy’s One-Liner Can Still Teach Us / HN
  • 10 PRINT CHR$(205.5+RND(1)); :GOTO 10 - There’s a 300-page MIT Press book analyzing exactly this line of code - see HN / 2

ruby version

$ echo 'loop do print ["\u2571","\u2572"].sample ; sleep 0.001 end'|ruby

# Labyrinth Algorithms ⮺ with code

• A* Search (Amit) C++
• Breadth First Search (BFS)
• Depth First Search (DFS)

# Online path-finding ⮺

# Maze solving algorithm ⮺