Get AI summaries of any video or article — Sign up free
The Fastest Maze-Solving Competition On Earth thumbnail

The Fastest Maze-Solving Competition On Earth

Veritasium·
6 min read

Based on Veritasium's video on YouTube. If you like this content, support the original creators by watching, liking and subscribing to their content.

TL;DR

Micromouse rules demand fully autonomous robots with strict size limits and no GPS or remote control, making sensing and control central to performance.

Briefing

Micromouse racing has evolved from a maze-solving curiosity into a high-stakes robotics discipline where the fastest route often beats the shortest one—and where success depends as much on how a robot moves as on how it thinks. The competition’s modern rules force fully autonomous robots to fit tight size and power limits, run without GPS or remote control, and race through a maze whose layout is revealed only at the start. With only a handful of timed runs allowed, teams must balance early exploration with later sprinting, turning navigation into a real-time optimization problem under uncertainty.

The roots trace back to Claude Shannon’s 1952 “electronic mouse” Theseus, which used a computer embedded in the maze to guide a magnet-on-wheels through trial-and-error learning. That idea—learning paths and then using memory to avoid false turns—became associated with early machine learning. Decades later, IEEE’s Amazing Micro-Mouse Maze Contest drew thousands of entrants, but few reached the finals, even as public interest spread and Micromouse clubs proliferated worldwide.

As the field matured, strategies for finding the goal shifted from brute-force certainty toward efficient decision-making. Depth-first search can eventually reach the goal but may miss shortcuts because it backtracks only when forced. Breadth-first search guarantees the shortest path but wastes time revisiting routes. Flood fill became the dominant approach: the robot starts with an optimistic map that assumes no walls, follows a gradient of distances to the goal, then updates its internal distance field when it hits unexpected obstacles. After reaching the goal, it can “smooth” the path and—crucially—use the return trip to refine the map further, making it highly likely to discover the true shortest route without exploring every cell.

Yet the headline twist came in performance terms. In the 2017 All Japan Micromouse Competition, many top finishers found the shortest path and then drove it in about 7.4 seconds. Masakazu Utsunomiya’s winning mouse, Red Comet, took a route 5.5 meters longer than the common shortest path because it contained fewer turns. The robot was effectively searching for the fastest path, not the shortest one, and won by 131 milliseconds.

The remaining gap between “solving” and “racing” is physical. As robots got faster, friction and control—not raw computation—became the limiting factors. A major breakthrough, dubbed a “Fosbury flop” for Micromouse, came from vacuum-style fans that generate several times the robot’s weight in downward force, enabling high cornering accelerations approaching six Gs. Diagonal driving also reshaped the sport: implemented first by the mouse Mitee 3, diagonals required new chassis dimensions and new control algorithms, and they increased crash risk while reducing turn-heavy paths into longer straightaways.

Nearly 50 years on, Micromouse remains unsolved in the sense that it keeps producing new paradigms—more wheels, omnidirectional motion, and even computer vision—because the challenge is fundamentally robotics: navigation plus speed plus mechanical interaction with the maze. The competition’s enduring lesson is that a “simple” maze hides a complex problem of control, sensing, and strategy under real-world constraints.

Cornell Notes

Micromouse turns maze-solving into an autonomous robotics sprint where speed—not just correctness—decides winners. Robots must fit strict size limits, run without GPS or remote help, and cope with a maze revealed only at the start, with only a few runs allowed. Flood fill dominates strategy: the robot begins with an optimistic distance map, follows decreasing distance values toward the goal, updates the map when walls are encountered, and often uses the return trip to improve the route. Even when the shortest path is known, the fastest route can be longer if it reduces turns; Red Comet won by taking a 5.5-meter-longer path with fewer turns. The biggest performance leaps came from mechanical “Fosbury flops” like vacuum fans for grip and diagonal driving for smoother motion.

Why did Micromouse shift from “shortest path” thinking to “fastest path” outcomes?

In many maze races, the goal is to reach the finish as quickly as possible, but time penalties come heavily from turning and control errors. Flood fill can identify a shortest route in terms of distance through the grid, yet a longer route with fewer turns can still be faster because turns require deceleration and precise alignment. The 2017 All Japan Micromouse Competition illustrates this: multiple top mice found the shortest path and then ran it in about 7.4 seconds, while Masakazu Utsunomiya’s Red Comet took a path 5.5 meters longer than the common shortest route because it had fewer turns. Red Comet won by 131 milliseconds, showing that minimizing distance is not the same as minimizing time.

How does flood fill work, and why is it efficient for Micromouse?

Flood fill maintains a map of distances from every maze square to the goal. At first, the robot assumes an optimistic world—often treating the maze as if there are no walls—then draws a shortest path on that assumption and drives it. When the robot hits a wall that contradicts its map, it updates the distance values to reflect the new shortest distances. The robot repeatedly runs and updates, always aiming along the decreasing-distance gradient toward zero at the goal. Because Micromouse rules require returning to the start for additional runs, the return trip becomes another opportunity to refine the map, making it likely to converge on the true shortest path without exhaustive exploration of all cells.

Why are depth-first search and breadth-first search less attractive in practice?

Depth-first search can reach the goal but may not find the shortest route because it backtracks only when it can’t proceed, potentially skipping shortcuts it never tries. Breadth-first search finds the shortest path by exploring layer by layer, but it revisits many paths repeatedly, causing heavy backtracking overhead. In Micromouse, that overhead can be worse than simply searching more intelligently: even “search the whole maze” can be slower than targeted strategies like flood fill, especially under strict time limits and limited runs.

What constraints make Micromouse a robotics problem rather than just a software problem?

Micromouse robots must be fully autonomous with no internet, no GPS, and no remote nudging. They must pack computing, motors, sensors, and power into a compact frame no longer or wider than 25 centimeters (and smaller for half-size categories). The maze is about three meters per side with corridors only 18 centimeters wide, and the layout is revealed only at the start, so the robot must sense and adapt quickly. As speeds rise, physical effects dominate: friction changes from dust, turning requires centripetal force, and small control errors can cause crashes. That’s why hardware innovations—sensing, motor control, and grip—often matter as much as the navigation algorithm.

How did vacuum fans become a “Fosbury flop” for Micromouse performance?

As robots accelerated, control during turns became the bottleneck because centripetal force comes from friction. Vacuum fans create additional downward force, increasing the normal force and therefore the available friction for turning. At Micromouse scale, fans built from handheld drone parts can generate downward force about five times the mouse’s weight. With that grip, modern Micromice can corner with centripetal acceleration approaching six Gs, comparable to F1 cars. Once many competitors adopted fans, the speed ceiling rose because the robots could maintain traction through aggressive maneuvers.

What did diagonal driving change, and why was it risky?

Diagonal driving reduces the number of stop-and-turn events by allowing motion that cuts across grid cells, turning jagged paths into longer straightaways. The mouse Mitee 3 implemented diagonals, and maze designers began including diagonal segments, making the approach broadly useful. But diagonals require major changes: the chassis must be narrower (less than 11 centimeters wide, or five centimeters for half-size), sensors and software must change, and control must guide the robot without the same “wall-following” cues used in straight corridors. Even slight veering can snag a corner, making diagonals a major crash source. The tradeoff is clear: higher risk for fewer turns and faster overall runs.

Review Questions

  1. What specific mechanism allows flood fill to update its map and converge on a useful route without exhaustive exploration?
  2. Why can a longer path outperform a shorter one in Micromouse, and what evidence from competition results supports that?
  3. Which physical factors (friction, centripetal force, dust, turning control) most directly limit Micromouse speed as robots get faster?

Key Points

  1. 1

    Micromouse rules demand fully autonomous robots with strict size limits and no GPS or remote control, making sensing and control central to performance.

  2. 2

    Flood fill is popular because it uses a distance-to-goal map, starts with optimistic assumptions, updates when walls are discovered, and often leverages the return trip to refine the route.

  3. 3

    Shortest-path algorithms can underperform in racing because turning costs time; winners may choose a longer route with fewer turns.

  4. 4

    Red Comet’s 2017 victory showed the fastest path can differ from the shortest path: it ran a route 5.5 meters longer than the common shortest route and won by 131 milliseconds.

  5. 5

    Diagonal driving (introduced by Mitee 3) can speed runs by reducing turns, but it increases crash risk and requires new chassis dimensions and control algorithms.

  6. 6

    Vacuum fans act like a grip upgrade by generating several times the robot’s weight in downward force, enabling cornering accelerations approaching six Gs.

  7. 7

    Micromouse progress repeatedly comes from “Fosbury flop” style paradigm shifts that combine navigation strategy with mechanical interaction with the maze.

Highlights

Red Comet won the 2017 All Japan Micromouse Competition by taking a route 5.5 meters longer than the shortest path because it had fewer turns, finishing 131 milliseconds ahead.
Flood fill starts with an optimistic wall-free map, follows a gradient of decreasing distances to the goal, then revises the distance field when it hits real walls.
Diagonal driving, pioneered by Mitee 3, trades higher crash risk for smoother motion by converting many turns into longer straightaways.
Vacuum fans can generate downward force about five times the mouse’s weight, letting Micromice corner with centripetal acceleration approaching six Gs.

Topics

  • Micromouse Rules
  • Flood Fill Algorithm
  • Fastest vs Shortest Path
  • Diagonal Driving
  • Vacuum Grip Fans

Mentioned