My Sokoban levels

Sōkoban (倉庫番): (n) warehouseman; storekeeper

Sokoban is a game where you are a warehouseman pushing boxes around in a warehouse, and you have to put them in designated locations. Only one box at a time can be pushed and none can be pulled. The game is provably hard; solving Sokoban puzzles has been shown to be NP-hard and even PSPACE-complete. [References]

The levels below were created by me a long time ago when i had just finished solving all levels i could find (several hunderds, especially the ones from MacSokoban and xsokoban were great!). I now think the levels i created are to large and (probably to) difficult. I do not remember exactly how to solve them anymore, though i still have some notes from over a decade ago … So be warned!

PS. you are free to copy and adjust them as long as you attribute them to me, i.e. `Christian Eggermont' (and include your own name if you adjust them of course).

How to play
Move the warehouseman using the arrow keys.
Undo moves with Control-z or Backspace.
Reset a level by pressing Escape.
Click on the level to select it and play!

;1 eenvoudig bedoeld

       ####
      ##  ###
  #####  $  #
###  #  $ # #
#        #  #
# #  ##  $ ##
# ## ###  $ ##
#  #  ###  $ #
##   $ ###@# #
 ###  $ ..*# #
   ##. $.....#
    ##########

;2 hart

  #####
  #   #   #########
  # $ #####.. #...#
 ###  $...........#
 #    ##.........###
 #  $#  ####*####  #
 ##$ # $         $ ##
  # # $ $##   ##$   #
 ## #  $ ### ### $$ #
 #   #  $ ##### $  ## 
 #  $ #  $ ### $  ##
##$$   #  $ # $  ##
#   $#  #  $ $  ##
#        # # # ##
######## $     #
       #### @ ##
          #####

;3 trappen

    ###########
   ##  #  #   #
  ##  $  $$ $ #
 ##  $ #  # ###
##  $ # # ...##
#  $ #   #....##
# # $  #  .....#
#  #  $ # #. ..#
##  # #   ##..## 
 ## $  #$ #####
 ##  $$ $    #
 # $$  # #   #
 #@   $  #####
 ####  ###
    ####

;4 vol

             ####
         #####  #####
      #### @ ...# ..#
      #   .*.# .....#
   ####$$#.**.#. . .#
 ###  $   #..*.#....#
 #   $  $ ##...#....#
## #$$$ ##### ####..#
#    # #  $ $ $   #.#
# #    # $  $ $ $ #.#
#     ##  $ $ $$ $###
######## $  $ $ $   #
       # $  $ $ $   #
       # $$ $ $   ### 
       #  $$ $ ####
       #       #
       #########

; 0 voor Els

   ############# #########
   #@      #   ###  #    ##
   #  $ $$ # #$#  $   $   #
  ###  $ $ $   $ $#$#$#$# #
  #  #$$   $ # #  $       #
  #    $ $  #  #$   #######
  # $######## ...#.## .. #
 ### #..  #..#.## .  .$#$#
 #... ... ...#.. $.$##.. ##
 # .##.......#.###.   # . #
 # . ##.....# ...#...$..  #
 ##. # #...## $######### ## 
 # . #  #*###            #
 #...#      ##$########  #
 ## #  ##$#  $ $   #  ####
###$   $     # $ $ #
#   ####  ###  $$ $###
# $     ## $ $ $ $   #
#  #$$  # $  $ $ $   #
# $$  $ # $  $ $   ###
#  $  ## $ $  $ ####
##  ####        #
 ####  ##########

References

Dorit Dor and Uri Zwick, `Sokoban and other motion planning problems', Computational Geometry 13 No.4 (1999) pp.215-228 [DOI]
J. Culberson, `Sokoban is PSPACE-complete', in: International Conference on Fun with Algorithms, Proceedings in Informatics 4, Carleton Scientific, Waterloo, Canada, Elba, Italy, 1999, pp.65–76. [preprint, ps]
Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, and, Joseph O'Rourke, `Pushing blocks is hard', Computational Geometry 26 No. 1 (2003) pp.21-36 (Special issue on the thirteenth canadian conference on computational geometry - CCCG'01) [DOI]
Problem of the Month (March 2000) by Erich Friedman considers the problem of the largest number of moves needed when using n squares.
Wikipedia
These levels (and level scores) at sokobano.de.