Show HN: Sokoban AI Solver

This project implements an optimal Sokoban puzzle solver using A* search with several optimizations including macro-push moves that treat box pushes as single search edges, compact bitmask state representation, and deadlock pruning. The solver runs in JavaScript in the browser and can find provably optimal solutions for most puzzles in milliseconds, though the most complex puzzle required offline computation of its 184-move solution using a parallel C++ implementation.