Start with a real level
The page uses levels from BoxCat’s real levels.json. After every move, the solver recomputes the optimal distance from the current board.
Watch BFS find the shortest route
A state combines the player position with sorted box positions. BFS expands by depth, so the first completed board has the shortest move count.
One source of truth
The same solver verifies solvability, computes par, and supplies the best next move. CI reuses it across 100 levels, 30 tests, and 491 assertions.