Maze Algorithm Analyzer

Verilog Log Playback

Algorithm Control Panel

300ms

Maze Visualization

Real-time Statistics

Steps
0
Dead Ends
0/9
Current Score
0.00/20

Formula: 20 × (Explored/Total) × min(Optimal/Steps, 1)

Algorithm Logic

Sensor Readings:
Left: - | Front: - | Right: -
Decision Process:
Action:
-

Clean Algorithm Documentation

Wall Following Algorithms

Left/Right-Hand Rule: Keep one hand on the wall and follow it. Simple but effective for most mazes. Works well when maze is simply connected.

• Memory-free • Fast • Hardware-friendly

Random Mouse Algorithm

Randomly choose from available directions. Eventually explores everything but can be very inefficient.

• Memory-free • Unpredictable • Variable performance

Pledge Algorithm

Combination of walking straight and wall-following. Uses angle tracking to ensure you don't go in circles.

• Better than pure wall-following • Requires angle tracking

Trémaux Algorithm

Mark paths as you traverse them. Backtrack when reaching dead ends or fully explored junctions.

• Guaranteed solution • Requires memory • Systematic

Dead-End Filling

Iteratively remove dead ends from the maze until only the solution path remains. Requires full maze knowledge.

• Optimal solution • Full map needed • Analysis technique

Recursive Backtracking

Systematically explore all paths using depth-first search with backtracking when dead ends are reached.

• Complete exploration • Stack-based • Memory intensive

Flood Fill

Assign distance values to each cell from the goal, then follow the gradient. Optimal but requires full maze knowledge.

• Optimal path • Full map needed • Fast execution

Custom Optimized Algorithms

New! Four custom algorithms designed for maximum performance:

  • • Optimized Dead-End Hunter: Targets dead ends efficiently
  • • Smart Wall Follower: Enhanced wall following with optimization
  • • Hybrid Explorer: Multi-phase exploration strategy
  • • Minimum Steps Explorer: Optimized for step count

For Your Verilog Project

Recommended: Start with Left-Hand or Right-Hand Rule. They are memory-free, hardware-friendly, and guarantee exploration of all accessible areas.

Pro Tip: Use the custom algorithms to understand optimal strategies, then implement the logic in Verilog!