Search the map
The bot tests available neighboring floor cells, tracking where it has been. Walls are never legal moves.
REAL ALGORITHMIC OPPONENT · NO LOGIN
CAN YOU THINK
LIKE A PATHFINDER?
Navigate three changing obstacle maps. An actual breadth-first-search bot finds the shortest route. Your mission: match its efficiency and master the entire arena.
0%CHALLENGES CLEARED
0 / 3
0BEST TOTAL POINTS
RECRUITPATHFINDER CLASS
0 / 3OPTIMAL CLEARS
THE ARENA
Choose a route challenge
Complete missions in order. The bot is a deterministic search algorithm, not a paid API or a human pretending to be an AI.
THE SCIENCE BEHIND THE GAME
How the AI thinks
Choose shortest first
Breadth-first search explores paths by number of moves. On an unweighted grid, its first route to the goal is provably shortest.
Try to match it
Move with your keyboard or arrow buttons. Match the optimal number of moves for a three-star clear; longer but valid routes can still win.
AI transparency: The opponent is a real programmatic pathfinding algorithm executed in your browser. It is not a connected frontier language model. You can inspect the published rule format without any API keys. Local progress is not a verified online leaderboard.