Sokoban AI Solver
An interactive browser demonstration and algorithm project that combines the classic Sokoban game with verifiable optimal search.
Who it is for: Sokoban players who want to directly experience the optimal solving process, developers and learners interested in A*, heuristic search, and browser-based algorithm implementation, and algorithm enthusiasts who need to observe state compression, deadlock pruning, and search performance.
Core capabilities
- Browser-based Sokoban Interaction: Provides a board, movement, undo, reset, and speed control.
- Optimal Macro Sokoban A*: Treats box pushes as search edges and incorporates operator walking cost into total steps.
- Compact State and Efficient Queue: Uses bitmasks, bucket queues, and typed array hashing to reduce state storage and allocation costs.
- Deadlock Pruning: Identifies dead cells, frozen states, and reduces invalid search using admissible lower bounds.
Pricing
Not disclosed.
Updated 2026-08-18