Sokoban AI Solver - Optimal puzzle solver in JavaScript

This is an interactive Sokoban puzzle solver that runs entirely in the browser. It features a custom AI that finds the provably fewest-moves solution for each board, using advanced techniques like macro-push A* search, compact bitmask states, and deadlock pruning. The solver is a plain-JavaScript port of a native C++ optimal solver, and it solves boards 1–14 to the proven optimum in milliseconds. For the largest board (15), the optimal solution was computed offline and is played back. The interface includes controls for arrow keys or WASD, undo, and reset, making it easy to play and learn from the AI's strategies.
The AI returns the provably fewest-moves solution, not just some solution, using a move-optimal macro-push A* search that skips over individual walking steps.