To play online press the screenshot above and then the start button.

# Play Sokoban Online.

 "Sokoban" is a free online knowledge level game, to cover all the orange holders (X) by moving the boxes over them. Play Sokoban online on computer. Classic game with more than 50 types of mazes. Fun logic learning game. Move with arrow keys and sort all crates on the X's. Play more than 50 different crates set.

This fun logic game include the following properties:
• 62 mazes.
• Moves counter.
• Time counter.
Game code by Francesco Pastore.

## How to play Sokoban.

 Move the sokoban (in Japanese, the warehouse manager) with arrow keys up, down, left and right. 1. You can move boxes by pushing them using the arrow keys. 2. You can only push one box at a time. 3. The level is won when all the blue holders are covered. 4. Sometimes you may push a box into a corner, or against another box in such a way that it is impossible to further move the box. In that case click Restart and try again.

Knowledge Achievements:
Know how to win a Sokoban game and get +1 Knowledge Level.
Difficulty: Hard.

### Class subject: Sokoban Game Rules:

 Sokoban ("warehouse keeper") is a type of puzzle video game, in which the player pushes crates or boxes around in a warehouse, trying to get them to storage locations. Sokoban was created in 1981 by Hiroyuki Imabayashi, and published in December 1982 by Thinking Rabbit, a software house based in Takarazuka, Japan. The game is played on a board of squares, where each square is a floor or a wall. Some floor squares contain boxes, and some floor squares are marked as storage locations. The player is confined to the board, and may move horizontally or vertically onto empty squares (never through walls or boxes). The player can also move into a box, which pushes it into the square beyond. Boxes may not be pushed into other boxes or walls, and they cannot be pulled. The number of boxes is equal to the number of storage locations. The puzzle is solved when all boxes are at storage locations. Sokoban can be studied using the theory of computational complexity. The problem of solving Sokoban puzzles has been proven to be NP-hard. Further work showed that it was significantly more difficult than NP problems; it is PSPACE-complete. This is also interesting for artificial intelligence researchers, because solving Sokoban can be compared to the automated planning that needs to be done by a robot that moves boxes in a warehouse. Sokoban is difficult not only due to its branching factor (which is comparable to chess), but also its enormous search tree depth; some levels can be extended indefinitely, with each iteration requiring an exponentially growing number of moves and pushes. Skilled human players rely mostly on heuristics; they are usually able to quickly discard futile or redundant lines of play, and recognize patterns and subgoals, drastically cutting down on the amount of search. Some Sokoban puzzles can be solved automatically by using a single-agent search algorithm, such as IDA, enhanced by several techniques which make use of domain-specific knowledge. This is the method used by Rolling Stone, a Sokoban solver developed by the University of Alberta GAMES Group. The more complex Sokoban levels are, however, out of reach even for the best automated solvers.