Menachem Kornreich
Show HN: Sokoban AI Solver
Last checked:
What is Menachem Kornreich?
An interactive web-based Sokoban puzzle game with an integrated AI solver. The solver uses A* search with macro-push optimization and deadlock pruning to find provably optimal solutions to warehouse keeper puzzles, displaying the minimum number of moves required.
Menachem Kornreich pricing
Pricing model: Freemium
Menachem Kornreich pros
- Optimal solutions guaranteed using A* search with admissible heuristics
- Fast real-time performance on 14 boards using macro-push optimization and compact bitmask state representation
- Visual feedback showing actual moves vs optimal solution for each puzzle
- Progressive difficulty from warm-up to 8-box maze (Board 15)
Menachem Kornreich cons
- Limited to 15 fixed puzzles (no procedural generation or custom boards)
- Board 15 uses precomputed solution rather than live solving due to >1GB search space
- Browser-based implementation cannot handle extremely large state spaces in real-time
Frequently asked questions about Menachem Kornreich
How does the AI solver find optimal solutions?
Uses move-optimal macro-push A* search where each step is a full box push, packed into compact bitmask states with deadlock pruning to skip unsolvable positions.
What are the game controls?
Arrow keys, WASD, or on-screen directional buttons; Undo steps back one move, Reset restores the board to start.
Why is Board 15 different from the others?
Board 15 requires exploring ~49 million states and >1GB memory, so its optimal solution (184 moves) was precomputed offline using the native C++ solver and verified by replay.