Show HN: Sokoban AI Solver

This Sokoban solver uses a macro-push A* algorithm to find move-optimal solutions by treating box pushes as single search edges. It minimizes memory overhead using 32-bit integer bitmasks for states and an allocation-free, open-addressed hash table. The engine handles millions of states within tens of megabytes via a dial bucket queue.