Skip to main content
πŸ“– The AI Tool Bible
Sokoban logo

Sokoban

βœ“ Text source-checked Nov 2, 2026

A web-based Sokoban puzzle where the keeper pushes boxes onto goals and must also finish on a goal.

Source-checked against the vendor's site Β· rebuilt from the vendor's own pagesProfile updated Link checked How we rate

Free(not source-checked)Coding

In short

A free web-based Sokoban puzzle featuring a JavaScript AI solver that finds provably optimal solutions for most boards using A* search.

The vendor says that Sokoban is a web-based implementation of the 1980s puzzle where the objective is to push every box onto a goal and the keeper must also finish on a goal. The tool includes an AI solver that returns an optimal solution on the boards it can search exhaustively.

The AI solver is a plain-JavaScript port of a native C++ optimal solver. The solver uses Move-optimal macro-push A* search to return the provably fewest-moves solution. The solver uses compact bitmask states where boxes are packed into a 32-bit integer and the keeper into one more number. The solver utilizes a dial bucket queue for the A* frontier and a flat typed-array hash for the visited set.

Boards 1-14 are solved live to the proven optimum in milliseconds by the solver. The vendor says that board 15 is an exception where the optimal search explores approximately 49 million states and requires more than 1 GB of memory, which is too long to run inside a browser tab.

From the vendor's pages

According to Sokoban: The tool includes an AI solver that returns an optimal solution on the boards it can search exhaustively. Its pages list this strength: Returns the provably fewest-moves solution.

β€” The AI Tool Bible editorial team

Pros

  • βœ… Returns the provably fewest-moves solution.
  • βœ… Solves boards 1-14 live to the proven optimum in milliseconds.
  • βœ… Uses compact bitmask states to reduce memory usage per state.
  • βœ… The hash implementation is allocation-free and cache-friendly.

Facts

Platforms
web (not source-checked)
Pricing
free (not source-checked)
Hacker News
4 stories Β· top 72 points Β· last Sep 7, 2026 Β· checked Nov 21, 2026

Where this tool sits

Use cases

Playing Sokoban puzzles in a browserViewing provably optimal solutions for Sokoban boardsDemonstrating A* search with macro-push optimization

Frequently asked

Is Sokoban free to use?
Yes, the tool is listed as free. The provided documentation does not specify any additional costs, subscription tiers, or premium features associated with using the web-based puzzle or its solver.
How does the AI solver work?
The solver is a JavaScript port of a C++ optimal solver. It uses Move-optimal macro-push A* search with compact bitmask states and a dial bucket queue to return the provably fewest-moves solution.
Can the solver handle all boards?
Boards 1-14 are solved live to the proven optimum in milliseconds. Board 15 is an exception; its optimal search explores approximately 49 million states and requires over 1 GB of memory, making it too long for a browser tab.
What are the main use cases?
It is used for playing Sokoban puzzles in a browser, viewing provably optimal solutions for specific boards, and demonstrating A* search with macro-push optimization. The objective is to push boxes onto goals and finish on a goal.
What technology stack does it use?
The tool is a web-based implementation. The AI solver is written in plain JavaScript, ported from native C++. It utilizes flat typed-array hashes for the visited set and packs boxes into 32-bit integers for state management.
See alternatives to Sokoban β†’

Explore related

Reviews