Soksolv is a Sokoban puzzle solver that reports solving more levels than any previously published solver across the Large and Open Test Suites: 3,272 and 10,043 levels respectively. At the ten-minute mark, it leads rival Festival by 10 percentage points on the Large suite and 18 on the Open suite, and solves shared levels about 3.2 times faster in total. It also achieves 24 first-ever automated solves. Sokoban’s simple rule - push boxes onto goals, never pull them - creates huge search spaces and frequent deadlocks, so a straightforward strategy such as moving boxes toward goals can trap the solver.
The project builds Soksolv from scratch, using a Go implementation, a 15 GB memory limit, and a verifier that replays every proposed solution and rejects invalid results. Its search focuses on box pushes rather than free worker movement, merges states that have identical box positions and reachable worker regions, and uses deadlock detection, forced tunnel moves, corral pruning, and careful goal-filling order to reduce wasted exploration. It also searches backward from solved states by simulating pulls, allowing forward and reverse searches to meet in the middle and sharply reduce the number of positions examined. The solver was developed through a 14-day Claude Code session with roughly 430 subagents; research and benchmark runs consumed 15,000 CPU-hours. The account emphasizes controlled experiments, frozen verification, and rules against machine learning, rival-code inspection, and level-specific hardcoding.
Summary generated by AI from the linked article. hn.today is not affiliated with Hacker News or Y Combinator.