Show HN: Sokoban AI Solver
A developer has released a JavaScript-based Sokoban solver that uses an A* search algorithm to find optimal solutions for the classic puzzle game. The solver handles most boards in milliseconds, while complex boards are solved offline using a C++ implementation.
Why it matters
This project demonstrates the application of pathfinding algorithms and performance optimization techniques in browser-based environments.
Sokoban ("warehouse keeper") is a 1980s puzzle: push every box onto a goal. In this variant the keeper must also finish on a goal.
The warehouse is a grid. On each step the keeper moves one square up, down, left or right. The keeper cannot walk into a wall or a box. It can push a single box if the square just beyond the box (in the push direction) is empty floor or a goal. Only one box moves per step, and a box can be pushed out of a goal again to make room.
Get smarter about the news
Sign up free for a feed built around what you actually care about, Dive Deeper research on any story, and the full text of every article.
Create free accountAlready have an account? Sign in