Sokoban Wiki - User contributions [en]

Solver Statistics

2026-03-11T20:48:12Z

Matthias Meger: /* General benchmarking information */ new JSoko version

A Sokoban solver program is a program that ''tries to'' solve Sokoban levels. There are several solver programs available. (See [[Links#Sokoban Solvers |Sokoban solvers]].)

Solver programs may have different objectives:
# Find any solution
# Find push optimal solutions
# Find push optimal solutions with best moves
# Find move optimal solutions
# Find move optimal solutions with best pushes

Given the computational complexity of these tasks, a solver program is usually designed for just finding any solution. If a solution is to be optimized, an optimizer program can be used. (See [[Links#Sokoban Solvers |Optimizers]].)

The statistics presented here provide a picture of what the best freely available Sokoban solvers can do. 
For copyrights, credits and redistribution of these statistics, please read the disclaimer.

== General benchmarking information ==

For practical reasons, almost all tests have been performed with a 10 minutes time limit. The tests are, however, not a 10 minutes contest but a showcase for what the solvers can do, so other time limits are entirely feasible.

The hardware used for the tests is a standard PC with a modern operating system (64bit).

Tests are performed with default solver settings.

{| class="soko-table feature-list"
!Solver || Version || Author || Architecture || CPU usage || Source code available || More info

|-
|[https://festival-solver.site/ Festival] || 3.1 || Yaron Shoham || 64bit || 8 threads || [https://festival-solver.site/ Festival 3.1] || [https://festival-solver.site/ Website with papers about the solver]

|-
|[http://sokolution.infinityfreeapp.com/ Sokolution] || 7.32 || Florent Diedler || 64bit || all threads || no || [[Sokoban solver "scribbles" by Florent Diedler about the Sokolution solver | Sokoban solver "scribbles" by Florent Diedler]]

|-
|[https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken] || 7.4 || Ken'ichiro Takahashi (takaken) || 64bit || 2 threads || no || [https://computerpuzzle.net/puzzle/sokoban/ver731/index.html Description of the used algorithms]

|-
|[https://festival-solver.site/curry/ Curry] || 0.3 || Yaron Shoham || 64bit || 1 thread || [https://festival-solver.site/curry/ Curry 0.3] || [https://festival-solver.site/curry/ Website with paper about the solver]

|-
|[https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch] || 7.0 beta 1 || 葛永 (Ge Yong) || 64bit || 1 thread || no || [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch Website of BoxSearch]

|-
|[https://sourceforge.net/projects/sokobanyasc/files/sokobanyasc/ YASS] || 2.153 || Brian Damgaard || 32bit + 64bit || 1 thread || [https://sourceforge.net/projects/sokobanyasc/files/sokobanyasc/ YASS 2.153] || [[Sokoban solver "scribbles" by Brian Damgaard about the YASS solver | Sokoban solver "scribbles" by Brian Damgaard]]

|-
|[https://jsokoapplet.sourceforge.io/ JSoko] || 2.26 || Matthias Meger || 64bit || 1 thread || [https://sourceforge.net/projects/jsokoapplet/files/JSoko/Version%202.24/ JSoko 2.26] || [[Solver | Solver information]]
|-
|[https://webdocs.cs.ualberta.ca/~games/Sokoban/program.html Rolling Stone] || 1.0 || Andreas Junghanns || 32bit || 1 thread || [https://webdocs.cs.ualberta.ca/~games/Sokoban/Src/ RS] || [https://scholar.google.com/scholar?hl=de&as_sdt=0%2C5&q=rolling+stone+sokoban&btnG= Rolling Stone papers]

|}

Contact: SokobanoWiki@gmail.com

== XSokoban Test Suite ==

The XSokoban level set is the de facto standard test suite in the academic literature on Sokoban solver programming.

{| class="soko-table"
|-
! colspan="11" | Sokoban Solver Statistics - XSokoban Test Suite - Solved Levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" | Collection
| width="160" | Author
| width=" 70" | Levels
| width= "90" | [https://www.researchgate.net/publication/2305703_Pushing_the_Limits_New_Developments_in_Single-Agent_Search Rolling Stone]
| width= "80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width=" 80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]
| width=" 80" | [[JSoko Solver | JSoko]]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution ]
| width=" 80" | [https://festival-solver.site/curry/ Curry ]
| width=" 80" | [https://festival-solver.site/ Festival ]
| width=" 80" | [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch]




|- align="right"
| align="left" bgcolor="#f1efe5" | [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/ XSokoban]
| align="left" | Thinking Rabbit, ...
| 90
| [https://webdocs.cs.ualberta.ca/~games/Sokoban/program.html 59*]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Takaken%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/YASS%20-%20XSokoban.html 89]
| [[SolverStatistics-jsoko-ThinkingRabbit-XSokoban | 67 ]]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Sokolution%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Curry%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Festival%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/BoxSearch%20-%20XSokoban.html '''89''']

|}

*) 59 solved puzzles according to paper [https://sokoban.dk/wp-content/uploads/2016/02/Single-Agent.pdf Sokoban Enhancing general single-agent search methods using domain knowledge]

{| class="soko-table"
|-


! colspan="7" | Sokoban Solver Statistics - XSokoban Test Suite - Push-optimal Solutions
|- bgcolor="#f1efe5" align="center"
| width="115" align="left" | Collection
| width="160" | Author
| width=" 70" | Levels
| width=" 80" | [https://www.researchgate.net/publication/2305703_Pushing_the_Limits_New_Developments_in_Single-Agent_Search Rolling Stone]
| width=" 80" | [http://www.ijcai.org/Abstract/16/100 Pereira et al.]
| width=" 80" | [http://sourceforge.net/projects/jsokoapplet/ JSoko]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution ]


|- align="right"
| align="left" bgcolor="#f1efe5" | XSokoban
| align="left" | Thinking Rabbit, ...
| 90
| [https://webdocs.cs.ualberta.ca/~games/Sokoban/program.html 6 ]
| [[SolverStatistics-Pereira-ThinkingRabbit-XSokoban-Push-Optimal | 28 ]]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/JSoko%20-%20XSokoban.html 25]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/Sokolution%20-%20XSokoban.html '''73''']

|}

The statistic shows that Sokolution is by far the best solver when searching for push optimal solutions.

== Large Test Suite ==

The large test suite comprises level packs selected for being a challenge for the solvers, but not too difficult. The statistics shows the results for the leading Sokoban solver programs.

This test suite is not subject to change, as it is intended to be a "Large Standard Test Suite" for Sokoban solver programs.

{| class="soko-table"
|-
! colspan="7" | Sokoban Solver Statistics - Large Test Suite - Solved levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" |
| width=" 70" | Levels
| width= "80" | [https://festival-solver.site/ Festival ]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution]
| width=" 80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width=" 80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]
| width=" 80" | [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch]

|- bgcolor="#f1efe5" align="right"
| align="left" | Total levels
| 3272 
| '''3208''' 
| 3207 
| 2953 
| 2899 
| 2749 

|}

'''[https://sokoban-solver-statistics.sourceforge.io/statistics/LargeTestSuite/ Click here to see the detailed results for the Large Test Suite].'''

Download the entire test suite [https://sourceforge.net/projects/sokoban-solver-statistics/files/Large%20Test%20Suite.zip/download here] or the individual level sets from [http://sokobano.de/de/levels.php www.sokobano.de].

== Open Test Suite ==

The statistics shows the results for the leading Sokoban solvers for various level collections. Please note that the grand totals are simple summations. The number of solved unique levels may differ slightly due to duplicate levels in the level packs.

This test suite may be changed by adding new level collections from time to time.

{| class="soko-table"
|-
! colspan="7" | Sokoban Solver Statistics - Open Test Suite - Solved levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" |
| width=" 70" | Levels
| width= "80" | [https://festival-solver.site/ Festival]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution]
| width=" 80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width=" 80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]
| width=" 80" | [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch]

|- bgcolor="#f1efe5" align="right"
| align="left" | Total levels
| 10043 
| '''9596''' 
| 9516 
| 8721 
| 8339 
| 8111 

|}

'''[https://sokoban-solver-statistics.sourceforge.io/statistics/OpenTestSuite/ Click here to see the detailed results for the Open Test Suite].'''

[https://sokoban-solver-statistics.sourceforge.io/statistics/Sokolution/ Comparison for the Open Test Suite for all Sokolution versions].

== Push-optimal Test Suite ==

The "Push-optimal Test Suite" comprises level packs selected for being a challenge for the solvers, but not too difficult. The statistics shows the results for the leading Sokoban solver programs.

For this test suite the solvers must solve the puzzles push optimal.

{| class="soko-table"
|-
! colspan="6" | Sokoban Solver Statistics - Large Test Suite - Solved levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" |
| width=" 70" | Levels
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution]

|- bgcolor="#f1efe5" align="right"
| align="left" | Total levels
| 1588 
| [https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/ '''1529'''] 
|}

'''[https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/ Click here to see the detailed results for the Push-Optimal Test Suite].'''

== GroupEffort Test Suite ==

The only reason for benchmarking the GroupEffort test suite is to demonstrate the limited veracity of the statement made in section "6 Conclusion" of the thesis, where the author writes that the GroupEffort solver "outperforms existing solvers".

The benchmarks show that this was only true for the cherry-picked small test set at the time the thesis was published, never for the presumably more representative large test set.

{| class="soko-table"
|-
! colspan="8" | Sokoban Solver Statistics - GroupEffort Test Suite - Solved Levels




|- bgcolor="#f1efe5" align="center" 
| width = "115" align="left" | Collection
| width = "80" | Levels
| width = "80" | [https://baldur.iti.kit.edu/theses/SokobanPortfolio.pdf GroupEffort]
| width = "80" | [https://festival-solver.site/ Festival]
| width = "80" | [http://sokolution.infinityfreeapp.com/ Sokolution]
| width = "80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width = "80" | [https://sourceforge.net/projects/jsokoapplet/ JSoko]
| width = "80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]




|- align="right"
| align="left" bgcolor="#f1efe5" | [[SolverStatistics-GroupEffort-Small-Set | Small Set]]
| 200
| 196 (a)(c)
| [[SolverStatistics-Festival-GroupEffort-Small-Set | '''200''' (b) ]]
| [[SolverStatistics-Sokolution-GroupEffort-Small-Set | '''200''' (a) ]]
| [[SolverStatistics-Takaken-GroupEffort-Small-Set | 192 (b) ]]
| [[SolverStatistics-JSoko-GroupEffort-Small-Set | 180 (b) ]]
| [[SolverStatistics-YASS-GroupEffort-Small-Set | 191 (b) ]]




|- align="right"
| align="left" bgcolor="#f1efe5"| [[SolverStatistics-GroupEffort-Large-Set | Large Set]]
| 2851
| 1566 (a)(c)
| [[SolverStatistics-Festival-GroupEffort-Large-Set | '''2766''' (b) ]]
| [[SolverStatistics-Sokolution-GroupEffort-Large-Set | 2471 (a) ]]
| [[SolverStatistics-Takaken-GroupEffort-Large-Set | 2462 (b) ]]
| [[SolverStatistics-JSoko-GroupEffort-Large-Set | 2165 (b) ]]
| [[SolverStatistics-YASS-GroupEffort-Large-Set | 2260 (b) ]]




|- align="right" bgcolor="#f1efe5" align="right"
| align="left"| Total
| 3051 
| 1762 
| '''2966''' 
| 2671 
| 2654 
| 2345 
| 2471 
|}

(a): Time limit: 5 minutes     (b): Time limit: 10 minutes     (c): Best GroupEffort solver configuration

== Disclaimer ==

Sokoban
=======
 
Sokoban (R) Registered Trademark of Falcon Co., Ltd., Japan
Sokoban Copyright (C) 1982-2004 by Hiroyuki Imabayashi, Japan
Sokoban Copyright (C) 1989, 1990, 2001-2004 by Falcon Co., Ltd., Japan
 
License
=======
 
Redistribution and use of the Sokoban Solver statistics are permitted
provided that the following conditions are met:
 
* Redistributions may not be sold, nor may they be used in a commercial product or activity.
* Redistributions must reproduce the entire content of this disclaimer in the documentation
and/or other materials provided with the distribution.
 
Credits (in no particular order)
================================
 
CosmoNotes, CosmoPoly, LOMA, MicroCosmos, MiniCosmos,
NaboCosmos and PicoCosmos level sets
Copyright (C) by Aymeric du Peloux.
E-mail: aymeric.du-peloux@gadz.org
Web site: unknown
 
dh1, dh2, bagatelle, cantrip, and maelstrom level sets
Copyright (C) by David Holland
E-mail: unknown
Web site: unknown
 
Microban, Mas Microban, Sasquatch, Mas Sasquatch, Sasquatch III,
Sasquatch IV, Sasquatch V, Sasquatch VI and Sasquatch VII level sets.
Copyright (C) by David W. Skinner
E-mail: sasquatch@bentonrea.com
Web site: unknown
 
Grigr2001, Grigr2002 and GrigrSpecial level sets
Copyright (C) by Evgeny Grigoriev (aka GRIGoRusha)
E-mail: grigr@yandex.ru
Web site: http://grigr.narod.ru/
 
SokEvo and SokHard level sets
Copyright (C) 2002-2006 by Lee J Haywood
E-mail: fruise@gmail.com
Web Site: https://ljhaywood.uk/games/sokoban/
 
Sven level set
Copyright (C) 2007 by Sven Egevad
E-mail: sven.egevad@telia.com
Web Site: unknown
 
Sokoban Perfect and Sokoban Revenge level sets
Copyright (C) 1989, 1991 by Thinking Rabbit
Web Site: https://sokoban.jp/
 
Y.M. Auto and Y.M. Handmade level sets
Copyright (C) Yoshio Murase
E-mail: yoshio@asahi.email.ne.jp
Web Site: http://www.ne.jp/asahi/ai/yoshio/sokoban/index.html
 
JSoko
Copyright (C) by Matthias Meger
E-mail: JSoko@mail.de
Web site: https://jsokoapplet.sourceforge.io/
 
Sokoban Automatic Solver (aka Takaken solver)
Copyright (C) 2002 - 200X Ken'ichiro Takahashi (aka takaken)
E-mail: takaken@ic-net.or.jp
Web site: https://computerpuzzle.net/english/sokoban/ver740/index.html
 
YASS - Yet Another Sokoban Solver and Optimizer - For Small Levels
Copyright (C) 2007 by Brian Damgaard
Web site: https://sourceforge.net/projects/sokobanyasc/
 
Sokoban YASC
Copyright (C) 2001-2020 by Brian Damgaard
Web Site: https://sourceforge.net/projects/sokobanyasc/
 
YSokoban
Copyright (C) 2007 by George Petrov
E-mail: YGP@WriteMe.com
Web Site: http://ygp.orgfree.com/sokoban.html
 
XSokoban
Copyright (C) by Andrew Myers
E-mail: andru@cs.cornell.edu
Web Site: http://www.cs.cornell.edu/andru/xsokoban.html
 
Sokofan
Copyright (C) 2005-2007 by Eric Leung
E-mail: eleung2@hotpop.com
Web Site: unknown
 
Sokolution
Copyright (C) 2016-2019 by Florent DIEDLER
E-mail: fdiedler2000@gmail.com
Web site: http://sokolution.infinityfreeapp.com/
 
Festival
Copyright (C) 2020 by Yaron Shoham
Web site: https://festival-solver.site/
 
Trademarks
==========
 
Company names, brand names and product names are trademarks
or registered trademarks of their respective holders.
 
Contact
=======
 
E-mail: sokobanowiki@gmail.com

Solver Statistics

2026-03-11T20:47:44Z

Matthias Meger: /* General benchmarking information */ New JSoko version

A Sokoban solver program is a program that ''tries to'' solve Sokoban levels. There are several solver programs available. (See [[Links#Sokoban Solvers |Sokoban solvers]].)

Solver programs may have different objectives:
# Find any solution
# Find push optimal solutions
# Find push optimal solutions with best moves
# Find move optimal solutions
# Find move optimal solutions with best pushes

Given the computational complexity of these tasks, a solver program is usually designed for just finding any solution. If a solution is to be optimized, an optimizer program can be used. (See [[Links#Sokoban Solvers |Optimizers]].)

The statistics presented here provide a picture of what the best freely available Sokoban solvers can do. 
For copyrights, credits and redistribution of these statistics, please read the disclaimer.

== General benchmarking information ==

For practical reasons, almost all tests have been performed with a 10 minutes time limit. The tests are, however, not a 10 minutes contest but a showcase for what the solvers can do, so other time limits are entirely feasible.

The hardware used for the tests is a standard PC with a modern operating system (64bit).

Tests are performed with default solver settings.

{| class="soko-table feature-list"
!Solver || Version || Author || Architecture || CPU usage || Source code available || More info

|-
|[https://festival-solver.site/ Festival] || 3.1 || Yaron Shoham || 64bit || 8 threads || [https://festival-solver.site/ Festival 3.1] || [https://festival-solver.site/ Website with papers about the solver]

|-
|[http://sokolution.infinityfreeapp.com/ Sokolution] || 7.32 || Florent Diedler || 64bit || all threads || no || [[Sokoban solver "scribbles" by Florent Diedler about the Sokolution solver | Sokoban solver "scribbles" by Florent Diedler]]

|-
|[https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken] || 7.4 || Ken'ichiro Takahashi (takaken) || 64bit || 2 threads || no || [https://computerpuzzle.net/puzzle/sokoban/ver731/index.html Description of the used algorithms]

|-
|[https://festival-solver.site/curry/ Curry] || 0.3 || Yaron Shoham || 64bit || 1 thread || [https://festival-solver.site/curry/ Curry 0.3] || [https://festival-solver.site/curry/ Website with paper about the solver]

|-
|[https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch] || 7.0 beta 1 || 葛永 (Ge Yong) || 64bit || 1 thread || no || [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch Website of BoxSearch]

|-
|[https://sourceforge.net/projects/sokobanyasc/files/sokobanyasc/ YASS] || 2.153 || Brian Damgaard || 32bit + 64bit || 1 thread || [https://sourceforge.net/projects/sokobanyasc/files/sokobanyasc/ YASS 2.153] || [[Sokoban solver "scribbles" by Brian Damgaard about the YASS solver | Sokoban solver "scribbles" by Brian Damgaard]]

|-
|[https://jsokoapplet.sourceforge.io/ JSoko] || 2.26 || Matthias Meger || 64bit || 1 thread || [https://sourceforge.net/projects/jsokoapplet/files/JSoko/Version%202.24/ JSoko 2.25] || [[Solver | Solver information]]
|-
|[https://webdocs.cs.ualberta.ca/~games/Sokoban/program.html Rolling Stone] || 1.0 || Andreas Junghanns || 32bit || 1 thread || [https://webdocs.cs.ualberta.ca/~games/Sokoban/Src/ RS] || [https://scholar.google.com/scholar?hl=de&as_sdt=0%2C5&q=rolling+stone+sokoban&btnG= Rolling Stone papers]

|}

Contact: SokobanoWiki@gmail.com

== XSokoban Test Suite ==

The XSokoban level set is the de facto standard test suite in the academic literature on Sokoban solver programming.

{| class="soko-table"
|-
! colspan="11" | Sokoban Solver Statistics - XSokoban Test Suite - Solved Levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" | Collection
| width="160" | Author
| width=" 70" | Levels
| width= "90" | [https://www.researchgate.net/publication/2305703_Pushing_the_Limits_New_Developments_in_Single-Agent_Search Rolling Stone]
| width= "80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width=" 80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]
| width=" 80" | [[JSoko Solver | JSoko]]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution ]
| width=" 80" | [https://festival-solver.site/curry/ Curry ]
| width=" 80" | [https://festival-solver.site/ Festival ]
| width=" 80" | [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch]




|- align="right"
| align="left" bgcolor="#f1efe5" | [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/ XSokoban]
| align="left" | Thinking Rabbit, ...
| 90
| [https://webdocs.cs.ualberta.ca/~games/Sokoban/program.html 59*]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Takaken%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/YASS%20-%20XSokoban.html 89]
| [[SolverStatistics-jsoko-ThinkingRabbit-XSokoban | 67 ]]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Sokolution%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Curry%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Festival%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/BoxSearch%20-%20XSokoban.html '''89''']

|}

*) 59 solved puzzles according to paper [https://sokoban.dk/wp-content/uploads/2016/02/Single-Agent.pdf Sokoban Enhancing general single-agent search methods using domain knowledge]

{| class="soko-table"
|-


! colspan="7" | Sokoban Solver Statistics - XSokoban Test Suite - Push-optimal Solutions
|- bgcolor="#f1efe5" align="center"
| width="115" align="left" | Collection
| width="160" | Author
| width=" 70" | Levels
| width=" 80" | [https://www.researchgate.net/publication/2305703_Pushing_the_Limits_New_Developments_in_Single-Agent_Search Rolling Stone]
| width=" 80" | [http://www.ijcai.org/Abstract/16/100 Pereira et al.]
| width=" 80" | [http://sourceforge.net/projects/jsokoapplet/ JSoko]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution ]


|- align="right"
| align="left" bgcolor="#f1efe5" | XSokoban
| align="left" | Thinking Rabbit, ...
| 90
| [https://webdocs.cs.ualberta.ca/~games/Sokoban/program.html 6 ]
| [[SolverStatistics-Pereira-ThinkingRabbit-XSokoban-Push-Optimal | 28 ]]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/JSoko%20-%20XSokoban.html 25]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/Sokolution%20-%20XSokoban.html '''73''']

|}

The statistic shows that Sokolution is by far the best solver when searching for push optimal solutions.

== Large Test Suite ==

The large test suite comprises level packs selected for being a challenge for the solvers, but not too difficult. The statistics shows the results for the leading Sokoban solver programs.

This test suite is not subject to change, as it is intended to be a "Large Standard Test Suite" for Sokoban solver programs.

{| class="soko-table"
|-
! colspan="7" | Sokoban Solver Statistics - Large Test Suite - Solved levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" |
| width=" 70" | Levels
| width= "80" | [https://festival-solver.site/ Festival ]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution]
| width=" 80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width=" 80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]
| width=" 80" | [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch]

|- bgcolor="#f1efe5" align="right"
| align="left" | Total levels
| 3272 
| '''3208''' 
| 3207 
| 2953 
| 2899 
| 2749 

|}

'''[https://sokoban-solver-statistics.sourceforge.io/statistics/LargeTestSuite/ Click here to see the detailed results for the Large Test Suite].'''

Download the entire test suite [https://sourceforge.net/projects/sokoban-solver-statistics/files/Large%20Test%20Suite.zip/download here] or the individual level sets from [http://sokobano.de/de/levels.php www.sokobano.de].

== Open Test Suite ==

The statistics shows the results for the leading Sokoban solvers for various level collections. Please note that the grand totals are simple summations. The number of solved unique levels may differ slightly due to duplicate levels in the level packs.

This test suite may be changed by adding new level collections from time to time.

{| class="soko-table"
|-
! colspan="7" | Sokoban Solver Statistics - Open Test Suite - Solved levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" |
| width=" 70" | Levels
| width= "80" | [https://festival-solver.site/ Festival]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution]
| width=" 80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width=" 80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]
| width=" 80" | [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch]

|- bgcolor="#f1efe5" align="right"
| align="left" | Total levels
| 10043 
| '''9596''' 
| 9516 
| 8721 
| 8339 
| 8111 

|}

'''[https://sokoban-solver-statistics.sourceforge.io/statistics/OpenTestSuite/ Click here to see the detailed results for the Open Test Suite].'''

[https://sokoban-solver-statistics.sourceforge.io/statistics/Sokolution/ Comparison for the Open Test Suite for all Sokolution versions].

== Push-optimal Test Suite ==

The "Push-optimal Test Suite" comprises level packs selected for being a challenge for the solvers, but not too difficult. The statistics shows the results for the leading Sokoban solver programs.

For this test suite the solvers must solve the puzzles push optimal.

{| class="soko-table"
|-
! colspan="6" | Sokoban Solver Statistics - Large Test Suite - Solved levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" |
| width=" 70" | Levels
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution]

|- bgcolor="#f1efe5" align="right"
| align="left" | Total levels
| 1588 
| [https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/ '''1529'''] 
|}

'''[https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/ Click here to see the detailed results for the Push-Optimal Test Suite].'''

== GroupEffort Test Suite ==

The only reason for benchmarking the GroupEffort test suite is to demonstrate the limited veracity of the statement made in section "6 Conclusion" of the thesis, where the author writes that the GroupEffort solver "outperforms existing solvers".

The benchmarks show that this was only true for the cherry-picked small test set at the time the thesis was published, never for the presumably more representative large test set.

{| class="soko-table"
|-
! colspan="8" | Sokoban Solver Statistics - GroupEffort Test Suite - Solved Levels




|- bgcolor="#f1efe5" align="center" 
| width = "115" align="left" | Collection
| width = "80" | Levels
| width = "80" | [https://baldur.iti.kit.edu/theses/SokobanPortfolio.pdf GroupEffort]
| width = "80" | [https://festival-solver.site/ Festival]
| width = "80" | [http://sokolution.infinityfreeapp.com/ Sokolution]
| width = "80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width = "80" | [https://sourceforge.net/projects/jsokoapplet/ JSoko]
| width = "80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]




|- align="right"
| align="left" bgcolor="#f1efe5" | [[SolverStatistics-GroupEffort-Small-Set | Small Set]]
| 200
| 196 (a)(c)
| [[SolverStatistics-Festival-GroupEffort-Small-Set | '''200''' (b) ]]
| [[SolverStatistics-Sokolution-GroupEffort-Small-Set | '''200''' (a) ]]
| [[SolverStatistics-Takaken-GroupEffort-Small-Set | 192 (b) ]]
| [[SolverStatistics-JSoko-GroupEffort-Small-Set | 180 (b) ]]
| [[SolverStatistics-YASS-GroupEffort-Small-Set | 191 (b) ]]




|- align="right"
| align="left" bgcolor="#f1efe5"| [[SolverStatistics-GroupEffort-Large-Set | Large Set]]
| 2851
| 1566 (a)(c)
| [[SolverStatistics-Festival-GroupEffort-Large-Set | '''2766''' (b) ]]
| [[SolverStatistics-Sokolution-GroupEffort-Large-Set | 2471 (a) ]]
| [[SolverStatistics-Takaken-GroupEffort-Large-Set | 2462 (b) ]]
| [[SolverStatistics-JSoko-GroupEffort-Large-Set | 2165 (b) ]]
| [[SolverStatistics-YASS-GroupEffort-Large-Set | 2260 (b) ]]




|- align="right" bgcolor="#f1efe5" align="right"
| align="left"| Total
| 3051 
| 1762 
| '''2966''' 
| 2671 
| 2654 
| 2345 
| 2471 
|}

(a): Time limit: 5 minutes     (b): Time limit: 10 minutes     (c): Best GroupEffort solver configuration

== Disclaimer ==

Sokoban
=======
 
Sokoban (R) Registered Trademark of Falcon Co., Ltd., Japan
Sokoban Copyright (C) 1982-2004 by Hiroyuki Imabayashi, Japan
Sokoban Copyright (C) 1989, 1990, 2001-2004 by Falcon Co., Ltd., Japan
 
License
=======
 
Redistribution and use of the Sokoban Solver statistics are permitted
provided that the following conditions are met:
 
* Redistributions may not be sold, nor may they be used in a commercial product or activity.
* Redistributions must reproduce the entire content of this disclaimer in the documentation
and/or other materials provided with the distribution.
 
Credits (in no particular order)
================================
 
CosmoNotes, CosmoPoly, LOMA, MicroCosmos, MiniCosmos,
NaboCosmos and PicoCosmos level sets
Copyright (C) by Aymeric du Peloux.
E-mail: aymeric.du-peloux@gadz.org
Web site: unknown
 
dh1, dh2, bagatelle, cantrip, and maelstrom level sets
Copyright (C) by David Holland
E-mail: unknown
Web site: unknown
 
Microban, Mas Microban, Sasquatch, Mas Sasquatch, Sasquatch III,
Sasquatch IV, Sasquatch V, Sasquatch VI and Sasquatch VII level sets.
Copyright (C) by David W. Skinner
E-mail: sasquatch@bentonrea.com
Web site: unknown
 
Grigr2001, Grigr2002 and GrigrSpecial level sets
Copyright (C) by Evgeny Grigoriev (aka GRIGoRusha)
E-mail: grigr@yandex.ru
Web site: http://grigr.narod.ru/
 
SokEvo and SokHard level sets
Copyright (C) 2002-2006 by Lee J Haywood
E-mail: fruise@gmail.com
Web Site: https://ljhaywood.uk/games/sokoban/
 
Sven level set
Copyright (C) 2007 by Sven Egevad
E-mail: sven.egevad@telia.com
Web Site: unknown
 
Sokoban Perfect and Sokoban Revenge level sets
Copyright (C) 1989, 1991 by Thinking Rabbit
Web Site: https://sokoban.jp/
 
Y.M. Auto and Y.M. Handmade level sets
Copyright (C) Yoshio Murase
E-mail: yoshio@asahi.email.ne.jp
Web Site: http://www.ne.jp/asahi/ai/yoshio/sokoban/index.html
 
JSoko
Copyright (C) by Matthias Meger
E-mail: JSoko@mail.de
Web site: https://jsokoapplet.sourceforge.io/
 
Sokoban Automatic Solver (aka Takaken solver)
Copyright (C) 2002 - 200X Ken'ichiro Takahashi (aka takaken)
E-mail: takaken@ic-net.or.jp
Web site: https://computerpuzzle.net/english/sokoban/ver740/index.html
 
YASS - Yet Another Sokoban Solver and Optimizer - For Small Levels
Copyright (C) 2007 by Brian Damgaard
Web site: https://sourceforge.net/projects/sokobanyasc/
 
Sokoban YASC
Copyright (C) 2001-2020 by Brian Damgaard
Web Site: https://sourceforge.net/projects/sokobanyasc/
 
YSokoban
Copyright (C) 2007 by George Petrov
E-mail: YGP@WriteMe.com
Web Site: http://ygp.orgfree.com/sokoban.html
 
XSokoban
Copyright (C) by Andrew Myers
E-mail: andru@cs.cornell.edu
Web Site: http://www.cs.cornell.edu/andru/xsokoban.html
 
Sokofan
Copyright (C) 2005-2007 by Eric Leung
E-mail: eleung2@hotpop.com
Web Site: unknown
 
Sokolution
Copyright (C) 2016-2019 by Florent DIEDLER
E-mail: fdiedler2000@gmail.com
Web site: http://sokolution.infinityfreeapp.com/
 
Festival
Copyright (C) 2020 by Yaron Shoham
Web site: https://festival-solver.site/
 
Trademarks
==========
 
Company names, brand names and product names are trademarks
or registered trademarks of their respective holders.
 
Contact
=======
 
E-mail: sokobanowiki@gmail.com

Feature list : Map Viewing

2026-02-09T08:23:04Z

Matthias Meger: /* Map Viewing */ removed last changed time

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Map Viewing ==




{| class="soko-table"
! colspan="6" | Map Viewing !! colspan="50" | <div align="right">Map Viewing</div>
|- {{programs}}
| {{tc}} | level browser with preview || {{yes}} one level at a time || {{yes}} block graphic miniatures of all loaded levels || {{yes}} block graphic miniatures of all loaded levels || {{yes}} block graphic miniatures of all levels in a collection (customizable miniature size) || {{no}} || {{no}}
|-
| {{tc}} | resize skin to fit window || {{yes}} always || {{yes}}skin dependent || {{yes}} always || {{yes}} {{tip|flaw: Windows has 2 font settings, small (default) and large, and this only works for small fonts|text=flaw}} || {{yes}} || {{no}}
|-
| {{tc}} | resize window to fit map || {{un}} {{tip|map always fits in window}} || {{no}} || {{un}} {{tip|map always fits in window}} || {{yes}} {{tip|flaw: Windows has 2 font settings, small (default) and large, and this only works for small fonts|text=flaw}} || {{yes}} optional || {{yes}} always
|-
| {{tc}} | [[Feature_list_:_Map_Viewing#Level_scrolling|levels larger than window: scrolling]] || {{un}} || {{no}} || {{un}} || {{yes}} via scrollbars. {{tip| Windows has 2 font settings, small (default) and large, and this only works for small fonts|text=flaw}} || {{yes}} {{tip|via scrollbars with an option to autofollow (move scrollbars automatically)}} || {{un}}
|-
| {{tc}} | one-click browse levels || {{yes}} previous, next {{tip|in all level files in current level directory, with wrap-around}} || {{yes}} previous, next {{tip|in currently loaded levels, without wrap-around}} || {{yes}} previous, next {{tip|in current collection, with wrap-around}} || {{yes}} previous, next {{tip|in all loaded level files, with wrap-around}} || {{yes}} {{tip| implementation: keyboard shortcuts for: previous, next, first, last (in current collection, without wrap-around)|text=partial}} || {{yes}} next, without wrap-around
|-
| {{tc}} | one-click browse files || {{no}} || {{no}} || {{no}} || {{yes}} drop-down list with all level collections || {{yes}} drop-down list with visited level collections || {{no}}
|-
| {{tc}} | search for unsolved level || {{yes}} previous, next {{tip|in all level files in current level directory, with wrap-around}} || {{yes}} previous, next, random {{tip|in currently loaded levels, without wrap-around}} || {{yes}} previous, next {{tip|in current collection, with wrap-around}} || {{yes}} {{tip|partial implementation: auto-advance after having solved a level finds an unsolved level if settings is "unsolved levels only"|text=partial}} || {{yes}} previous, next {{tip|in current collection, without wrap-around}} || {{no}}
|-
| {{tc}} | rotate and mirror level-map || {{yes}} persistent, with reset option {{tip|savegames and solutions are automatically synchronized with current transformation}} || {{yes}} session (partial implementation: use editor) {{tip|savegames and solutions are specific to each transformation}} || {{yes}} session, with reset option {{tip|savegames and solutions are automatically synchronized with current transformation}} || {{yes}} <big style="color: red;">?</big>{{tip|Will somebody with a full version check if it is session, with reset option or persistent, with reset option additionally check if savegames and solutions are automatically synchronized with current transformation or savegames and solutions are specific to each transformation|width=300px|text=Help}} || {{yes}} session, with reset option {{tip|savegames and solutions are automatically synchronized with current transformation}} || {{no}}
|-
| {{tc}} | multiple windows, one per level || {{no}} || {{no}} || {{no}} || {{yes}}via tabs. multiple levels can be opened in separate tabs. || {{no}} || {{yes}}
|-
| {{tc}} | multiple views of a level || {{yes}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | full screen || {{no}} || {{no}} || {{no}} || {{no}} || {{yes}} via : keyboard: F11 || {{no}}
|- {{programs}}
|}
[[#top|Top]]

<noinclude>

<h2>Information</h2>
=== Level scrolling ===

levels larger than window: scrolling 
levels larger than window: scrollbars 

Briefly, the first line is there to give a program the chance to tell that it has a scroll feature, and the second line is there to tell if the program does it the right way - with scrollbars.

Since the first graphical user interfaces emerged, scrollbars have been used for depicting the situation where a document doesn't fit in the window, so the user can rightfully expect to find that logic (or something equally user-friendly) in a Sokoban program as well.

Therefore, it's embarrasing for programs that requires scrolling if they don't have scrollbars or something equivalent. The line "levels larger than window: scrollbars" must be listed so readers can see this major design flaw, and so new programmers are reminded that they definitely should do better.

On the other hand, Sokofan deserves credits for at least having a scroll feature, despite the fact that it's not done the right way with scrollbars. The user doesn't get any visible clue that the board is bigger than the window, and the user must read the instructions to find the keyboard and mouse/key combinations that controls the scrolling.

So the line "levels larger than window: scrolling" is there to give Sokofan a chance to tell that it indeed has a scroll feature, even though it's not as user-friendly as the user rightfully can expect from a good Sokoban clone.

-bd

=== Multiple views of a level ===
A user often works on several alternative paths at the same time. It would be a great help if each of them was fully visible. For instance, multiple views are beneficial during the process of optimizing existing solutions.

=== SokRFI - Sokoban Requests for Implementation ===



{| class="soko-table feature-list"
|-
! colspan="50" | Map Viewing : SokRFI - Sokoban Requests for Implementation
|-
| width="120" {{tc}} | Feature || {{tc}} | Description
|-
|{{tc}}| show/hide redundant walls ||It fills jagged wall edges, fills unused "tubes", removes redundant walls, unused boxes, and unused goals. Implemented in [http://sokoban.ws/usokoban/usokoban.htm USokoban] as 'Normalize level'.
|}

[[#top|Top]]
</noinclude>

Feature list : Level Management

2026-02-09T08:22:56Z

Matthias Meger: /* Level Management */ removed last changed time

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Level Management ==




{| class="soko-table feature-list"
! colspan="6" | Level Management !! colspan="50" | <div align="right">Level Management</div>
|- {{programs}}
| {{tc}} | copy/paste level(s) (normal) || {{yes}} || {{yes}}{{tip|partial implementation of import: one level at a time; works for raw boards without meta data only}} || {{yes}}{{tip|levels can also be pasted by using drag&drop of a level file}} || <big style="color: red;">?</big>{{tip|Will somebody with a full version check if it works here the demo version has it on the menu in the editor and it does not mention any restrictions, but it does not work|text=Help}} || {{yes}} {{tip|flaw: pasted levels are not saved|text=flaw}} || {{no}}
|-
| {{tc}} | copy/paste levels (run-length-encoded) || {{yes}} || {{no}} || {{yes}} || {{no}} || {{yes}} {{tip|flaw: pasted levels are not saved |text=flaw}} || {{no}}
|-
| {{tc}} | copy map (current state) || {{yes}}via [ CTRL + click "tools"] and editor || {{yes}} || {{yes}} || {{no}} || {{yes}} || {{no}}
|-
| {{tc}} | copy level(s) with solution(s) || {{yes}}(multiple) || {{no}} || {{yes}}(single) || {{no}} || {{yes}}(single) || {{no}}
|-
| {{tc}} | paste level(s) with solution(s) || {{yes}}(multiple) || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | edit level information (e.g., title, author) || {{yes}} via "open" window || {{yes}} via menu: level->about; properties: title, author, comment || {{no}} || {{yes}} via menu: file->edit mode + file->attributes; properties:title, description, copyright, email, website || {{no}} || {{no}}
|-
| {{tc}} | edit levelset information (e.g., title, copyright) || {{no}} || {{yes}} via menu: levelset->about; properties: title, author, copyright, comment || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | load multiple files || {{no}} || {{yes}} || {{no}} || {{un}} {{tip|with all loaded levelsets in a list it is just as easy to browse the whole list}} || {{un}} {{tip|with all loaded levelsets in a list it is just as easy to browse the whole list}} || {{yes}}
|-
| {{tc}} | merge level files || {{yes}} (merge is a feature in the "open" window: menu -> file conversion...) || {{yes}}(via: open and select multiple files.) || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | recent levels history || {{yes}} 25 items {{tip|holding a unified recent file history for all loaded file-types, e.g., levels and background images}} || {{no}} || {{un}} {{tip|with all loaded levelsets in a list it is just as easy to browse the whole list}} || {{un}} {{tip|with all loaded levelsets in a list it is just as easy to browse the whole list}} || {{un}} {{tip|with all loaded levelsets in a list it is just as easy to browse the whole list}} || {{no}}
|-
| {{tc}} | saves levels with format || {{yes}} sok (.sok) || {{yes}} sok (.sok), xsokoban (.txt, .xsb), games 4 brains (.lp0), xml text file (.sls) || {{yes}} sok (.sok) || {{yes}} xml text file (.sls) || {{no}} || {{yes}} savegame text file (.sokosave)
|-
! colspan="6" | Level Management : Import and Export for Internet !! colspan="50" | <div align="right">Level Management : Import and Export for Internet</div>
|- {{programs}}
| {{tc}} | import levels with hyphens "-" or underscores "_" || {{yes}} via clipboard and load level || {{yes}} via clipboard and load level || {{yes}} via clipboard and load level || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | export levels with hyphens "-" or underscores "_" || {{yes}}via clipboard || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | stripping leading ">" characters || {{yes}} (all leading ">" characters are stripped) || {{no}} || {{yes}} (stripping leading ">" characters: boards, not moves) || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | accepts alternative characters for boards || {{yes}}characters: p,P,b,B,o || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|}
[[#top|Top]]

<noinclude>

== Related pages ==
* [[Level_format]]

== SokRFI - Sokoban Requests for Implementation ==


{| class="soko-table feature-list"
|-
! colspan="50" | Level Management : SokRFI - Sokoban Requests for Implementation
|-
| width="120" {{tc}} | Feature || {{tc}} | Description
|-
|{{tc}}| split levelset || SokoSave offers a utility for this feature. (External program [http://www.high-speed-software.com/sokosave/sokosavedesktop/sokosplit/ SokoSplit] can be downloaded)
|-
|{{tc}}| export levels to internet ||
 Export levels to internet 

This feature can be used to publish level(s) in a web-site. 

The export can have different variants: 
<ul>
<li>Generating the strings with code HTML. 
With links to download levels or thumbnails of each level.</li>
<li>Generating the strings with code [http://web.singnet.com.sg/~fclim/sbml/index.html SBML] (SokoBan Markup Language). 
Exporting with this language, levels can be customized by the user for the graphic representation of the maps, as well as provide a meta-information semantics of each level.
</li>
</ul>

<hr>Alternative development 
See [[SokRFI - Export Levels to Internet]].

<hr>Utility Sokoban++ offers a utility for this feature. (External program [http://www.joriswit.nl/sokoban/junk/ Sokoban Website Generator] can be downloaded) 

|}
[[#top|Top]]
</noinclude>

Feature list : Miscellaneous

2026-02-09T08:22:41Z

Matthias Meger: /* Miscellaneous */ removed last changed time

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Miscellaneous ==




{| class="soko-table feature-list"
! colspan="6" | Miscellaneous !! colspan="50" | <div align="right">Miscellaneous</div>
|- {{programs}}
| {{tc}} | builtin help and program information || {{yes}} rich text document (rtf) || {{yes}} html pages (html) || {{yes}} Java help || {{yes}} html pages (htm) || {{yes}} ascii text document || {{yes}} html page (html)
|-
| {{tc}} | context sensitive help || {{no}} || {{yes}} || {{yes}} {{tip|Pressing the help key (F1) opens the help}} || {{no}} {{tip|however, the web-page says otherwise|text=note}} || {{no}} || {{no}}
|-
| {{tc}} | customizable language || {{no}} || {{yes}} || {{yes}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | languages || English || English, Afrikaans, Danish (embarrassing), Dutch, German, Greek, Finnish, French, Italian, Polish, Portugese, Russian, Spanish (Spain, Argentina), Turkish, Slovenian, Swedish || English, German, Chinese (Simplified), Spanish, Dutch || English || English, Bulgarian, Chinese (Simplified, Traditional), German, Spanish || English
|-
| {{tc}} | builtin solutions || {{yes}} {{tip|all levels ship with builtin solutions}} || {{yes}} {{tip|not all levels ship with builtin solutions}} || {{yes}} {{tip|not all levels ship with builtin solutions}} || {{yes}} {{tip|not all levels ship with builtin solutions}} || {{no}} || {{no}}
|-
| {{tc}} | file type associations (optional) || {{no}} || {{yes}} .sls, .pak, .rdf, .lp0, .xsb, .sok, .sxl, .slc || {{no}} || {{no}} || {{no}} || {{yes}} .sokomaze, .xsb, .sokohex, .hsb, .sokotri, .tsb, .sokosave Windows, Mac OS X
|-
| {{tc}} | accessibility for portable version || {{no}} || {{no}} || {{no}} || {{no}} || {{yes}}{{tip|compatible installation: yes system modification: no generated data: saves the files created in the removable device. additional: edition for mobile phone, java MIDP 2.0 only.|width=200px}} || {{no}}
|- {{programs}}
|}
[[#top|Top]]

<noinclude>

==Info==
===Portable software===
''From Wikipedia, the free encyclopedia'' 

To be considered '''truly portable''', a software program must: 
<ul>
<li>Not require any form of formal installation to be carried out on any computer before it can be used, with the release package only needing to be decompressed directly to removable media before use (if it has to be installed first, and requires it's files to be manually copied to removable media, it's clearly not designed to be portable!). For example, software which is supplied as an InstallShield package could not be considered portable, though a ZIP archives containing an executable would be.</li>
<li>Settings are stored with, and can be carried around with, the software (i.e. they are written to the USB drive). If the registry is used to store settings; the application's configuration isn't portable, and must be set up on every PC it is used on</li>
<li>Leaves a zero (or near-zero) "footprint" on any PC it's run on after being used. i.e. All temporary files/registry settings should be removed once the program has exited, and files created by the user can be saved directly to the same removable media as the application is stored on.</li>
</ul>
Generally, smaller utility/toolkit software is inherently fairly portable; though larger applications are sometimes changed in order to allow a portable versions to be released (e.g. FirefoxPortable)

</noinclude>

Feature list : Game Play

2026-02-09T08:22:05Z

Matthias Meger: /* Game Play */ removed last changed time

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Game Play ==




{| class="soko-table"
! colspan="6" | Game Play !! colspan="50" | <div align="right">Game Play</div>
|- {{programs}}
| {{tc}} | autosave best solutions || {{yes}} tiebreaking: moves, pushes, secondary metrics || {{yes}} tiebreaking: moves, pushes || {{no}} || {{yes}} tiebreaking: moves, pushes || {{yes}} tiebreaking: moves, pushes, secondary metrics || {{no}}
|-
| {{tc}} | autosave solutions options || always autosaves better solutions; inferior solutions are discarded || autosave solutions options: never/always/if better/ask; existing solutions are kept || {{no}} || autosave solutions options: none/best 5/best 10/all || always autosaves better solutions; inferior solutions are discarded || optionally saves game when solved; only one solution per saved game
|-
| {{tc}} | push or move optimized pathfinding || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{yes}}
|-
| {{tc}} | move animation modes || smooth, cell by cell, instant || cell by cell, instant || cell by cell || smooth || cell by cell, instant {{tip|(instant with [[Feature_info#Choice points|choice points]] is listed but is too fast to be useful)|menu=yes}} || cell by cell, instant
|-
| {{tc}} | mouse move control: drag and drop || {{yes}} with reachable squares || {{yes}} without reachable squares || {{yes}} with reachable squares || {{yes}} with reachable squares || {{yes}} with reachable squares || {{no}}
|-
| {{tc}} | [[#Mouse_Move_Control:_Select_and_drop|mouse move control: select and drop]] || {{yes}} with reachable squares || {{yes}} with reachable squares || {{yes}} with reachable squares || {{yes}} with reachable squares || {{yes}} with reachable squares || {{yes}} without reachable squares
|-
| {{tc}} | [[#Mouse_Move_Control:_Drag_and_track|mouse move control: drag and track]] || {{no}} experimental click-less tracking available || {{no}} || {{no}} || {{no}} || {{no}} || {{yes}}
|-
| {{tc}} | reverse mode play starting at end position (pull instead of push) || {{yes}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | show secondary metrics (box-pushes, box-changes and pushing-sessions) || {{yes}} display: mouse over || {{yes}} display: optional, configurable || {{no}} || {{no}} || {{yes}} || {{yes}}
|-
| {{tc}} | [[#Lowerbound_of_solution_length_regarding_pushes|show a lowerbound of the solution length]] || {{no}} || {{no}} || {{yes}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | timing || {{yes}} optional; optional idle time threshold || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | move player through boxes ||{{no}}|| {{no}} || {{yes}} || {{no}} || {{yes}} target: reachable squares through boxes. figure: small black square. via: options -> go through boxes. || {{no}}
|-
! colspan="6" | Game Play : Legal moves !! colspan="50" | <div align="right">Game Play : Legal moves</div>
|- {{programs}}
| {{tc}} | show player's reachable squares|| {{yes}} figure: transparent small skin graphics || {{no}} || {{yes}} figure: transparent small skin graphics || {{yes}} || {{yes}} figure: small round blobs || {{no}}
|-
| {{tc}} | show box's reachable squares || {{yes}} figure: transparent small skin graphics || {{yes}} figure: skin graphics, independent of box || {{yes}} figure: transparent small skin graphics || {{yes}} || {{yes}} figure: small round blobs || {{no}}
|-
| {{tc}} | show pushable boxes || {{yes}} dynamically by clicking a wall. figure: configurable border || {{no}} || {{no}} || {{no}} || {{yes}} permanent with CTRL+F9. dynamically by clicking a wall. figure: skin graphics, independent of box || {{no}}
|-
| {{tc}} | show [[Deadlocks#Dead square deadlocks|dead squares]] || {{yes}}figure: configurable shaded square || {{no}} || {{yes}}figure: darker shaded square || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | [[#Simple deadlock detection|simple deadlock detection]] || {{yes}} dead squares, freezing boxes || {{no}} || {{yes}} dead squares, freezing boxes || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | [[#Advanced deadlock detection|advanced deadlock detection]] || {{yes}} {{tip|bipartite: n boxes for m goals; 1 goal for n boxes; corrals: precalculated at level load time + 100 ms search after a push}} || {{no}} || {{yes}} || {{no}} || {{no}} || {{no}}
|-
! colspan="6" | Game Play : History !! colspan="50" | <div align="right">Game Play : History</div>
|- {{programs}}
| {{tc}} | undo/redo || unlimited || unlimited || unlimited || unlimited || unlimited || unlimited
|-
| {{tc}} | undo all || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{yes}} press [esc]|| {{yes}}
|-
| {{tc}} | redo all || {{yes}} || {{no}} || {{yes}} || {{no}} ||{{no}} || {{yes}}
|-
| {{tc}} | replay || {{yes}} forwards and backwards || {{yes}} forwards || {{yes}} forwards || {{yes}} forwards and backwards || {{yes}} forwards (solutions only) || {{yes| via trackbar dragged to any position replays to that position}}
|-
| {{tc}} | replay ergonomics || unified start/stop button; click anywhere to stop; keyboard shortcuts available; speed and direction can be changed during replay || separate start/stop buttons; click stop-button to stop; keyboard shortcuts available || unified start/stop button; click anywhere to stop; speed can be changed during replay || || with start/stop: CTRL+F2 to begin. SPACE to replay to next box-change. without start/stop: F2 || trackbar represents replay history; drag trackbar to control replay; click anywhere, click [stop] button, or press [esc] to stop
|-
| {{tc}} | mousewheel undo/redo/replay support || {{yes}} combined moves || {{yes}} single step or optional combined moves || {{yes}} combined moves || {{no}} || {{yes}} combined moves || {{no}}
|-
| {{tc}} | browse move history || {{yes}} trackbar (choice-points, with preview) || {{yes}} trackbar (all moves, with preview) || {{yes}} trackbar (choice-points, with preview) || {{no}} || {{no}} || {{yes}} trackbar (all moves, no preview)
|-
| {{tc}} | quicksave slots || {{yes}} unlimited (interface: graphical, window, thumbnail preview) || {{yes}} unlimited (interface: graphical, pop-up, list) || {{no}} || {{yes}} 3 (interface: graphical) || {{no}} || {{no}}
|-
| {{tc}} | one-click load quicksaves || {{yes}} keyboard: press [Enter] to load currently selected snapshot; mouse: double-click a snapshot on the list || {{no}} || {{no}} || {{yes}} || {{no}} || {{no}}
|-
| {{tc}} | remember last session || {{yes}} file, level, history with redo, position {{tip|position is optional, default "off", additionally, up to 25 recent (file, level)}} || {{yes}} file, level || {{yes}} file, level || {{yes}} file, level, history without redo, position || {{yes}} file, level, history without redo, position || {{no}}
|- {{programs}}
|}

[[#top|Top]]

<noinclude>

== Info ==

=== Choice points ===

A choice point in the game is when the player changes from one box to another, or finishes a series of moves that pushed a box in a single direction.

Several programs have replay features related to choice points. Sokofan, for example, has replay buttons (called "smart do/undo") to move from one choice point to another. Another example is the game history browser in Sokoban YASC which works with choice points instead of individual moves.

=== Mouse Move Control: Select and drop ===
Lift and drop. Left click on a box to lift it, move to the wanted position and left click again to drop. Lift and drop is easier for long moves than the drag and drop.

=== Mouse Move Control: Drag and track ===
Point at the pusher with the mouse and move it in the direction you want. The pusher will track your movements.

=== Simple deadlock detection ===

Simple deadlock detection deals with deadlock types that require rather simple analysis of the board and the game state. Good examples are:

* [[Deadlocks#Dead square deadlocks|Dead squares]]

* [[Deadlocks#Freeze deadlocks|Freeze deadlocks]]

=== Advanced deadlock detection ===

Advanced deadlock detection deals with deadlock types that require quite sophisticated computations. Good examples are:

* [[Deadlocks#Bipartite deadlocks|Bipartite deadlocks]]

* [[Deadlocks#Corral deadlocks|Corral deadlocks]]

=== Lowerbound of solution length regarding pushes ===

For solving a level all boxes have to be pushed to goals. A program can calculate the distance of every box to the nearest goal. While doing this it is presumed only one box is on the board (hence the box does not need to be pushed around other boxes). The sum of all these box distances to their goals results in a lowerbound - no matter how the boxes are pushed to their goals the level can never be solved with fewer than the calculated number of pushes. Some programs can calculate a lowerbound for the solution length (in pushes): 
number of pushes so far + sum of all box distances to their nearest goals (presuming no other boxes are on the board). 
This lowerbound can be useful in levels like the "Kobus Theron"-series.

[[#top|Top]]
</noinclude>

Feature list : Level Editor

2026-02-09T08:21:52Z

Matthias Meger: /* Additional Tools : Level Editor */ removed last changed time

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Additional Tools : Level Editor ==




{| class="soko-table feature-list"
! colspan="6" | Additional Tools - Level Editor !!
|- {{programs|5= |6= }}
| {{tc}} | editor || built-in || built-in || built-in || built-in
|-
| {{tc}} | drawing objects || wall, box, goal, player || none, floor, goal, box-on-floor, box-on-goal, player-on-floor, player-on-goal, wall || wall, box, goal, player, floor || floor, goal, box, wall
|-
| {{tc}} | drawing tools || objects, eraser, rubber-band, fill || objects, pencil, drop, fill, line, rectangle, filled rectangle || objects || objects, move player, move box
|-
| {{tc}} | drawing logic || select object + click-and-drag the board to put objects on the board || select object + select drawing tool + click-and-drag the board to put objects on the board || select object + click-and-drag the board to put objects on the board || select object + click-and-drag the board to put objects on the board
|-
| {{tc}} | drawing logic inconveniences || the board jumps around on the screen when automatic scaling and positioning kick in || drawing with tools like lines and rectangles don't show the objects on the screen during the drawing process || the board jumps around on the screen when automatic scaling and positioning kick in || The "move" tool works for boxes and the player only, not for goals
|-
| {{tc}} | savegames and solutions for modified levels are retained after cosmetic changes (e.g., transformations and adding/removing extra floors/walls) || {{yes}} || {{no}} the savegames and solutions are still there in the files, but they are not applicable to the modified level || {{no}} || <big style="color: red;background:beige;">?</big> {{tip|will somebody with a full version check if it is "yes" or "no"|text=help}}
|-
| {{tc}} | undo || {{yes}} unlimited || {{yes}} unlimited || {{no}} || {{yes}} unlimited
|-
| {{tc}} | redo || {{yes}} unlimited || {{yes}} unlimited || {{no}} || {{no}}
|-
| {{tc}} | undo/redo logic || one complete transaction at a time || one complete transaction at a time || || one cell at a time
|-
| {{tc}} | undo/redo history is saved from one session to the next || {{yes}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | undo/redo multiple transactions: interface || pull-down menu: 1,2,4,8,... transactions || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | undo/redo multiple transactions: preview || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | "rubber-band" area selection || {{yes}}(features: move, copy, paste, delete, transform, fill) || {{no}} || {{no}} || {{no}}
|- {{programs|5= |6= }}
| {{tc}} | board transformations || {{yes}} rotate counter-clockwise and clockwise, flip vertically and horizontally. || {{yes}} rotate clockwise, flip vertically || {{yes}} rotate counter-clockwise and clockwise, flip vertically and horizontally || {{yes}} rotate counter-clockwise and clockwise, flip vertically and horizontally
|-
| {{tc}} | resize board || {{un}} {{tip|the board is automatically positioned so it's possible to draw on all 4 sides}} || {{yes}} (via toolbar button: resize level) || {{un}} {{tip|the board is automatically positioned so it's possible to draw on all 4 sides}} || {{un}} {{tip|"move board" does not clip the level to a predefined size like, e.g., Sokoban++ does}}
|-
| {{tc}} | move board || {{un}} || {{yes}} || {{un}} || {{yes}}
|-
| {{tc}} | one-click switching between play/edit mode || {{yes}} || {{no}} use menu: game->mode || {{no}} || {{yes}} {{tip|partial implementation: no visible button but a keyboard shortcut "Alt+P"|text=partial}}
|-
| {{tc}} | board validation on switching from edit mode to play mode || {{yes}} || {{no}} all boards are playable || {{yes}} || <big style="color:red;background:beige">?</big>{{tip|will somebody with a full version check if it happens automatically|text=help}}
|-
| {{tc}} | customizable skin || {{yes}} format: simple image-based skins without seamless walls || {{yes}} same skin in edit mode and in play mode || {{yes}} same skin in edit mode and in play mode || {{yes}} same skin in edit mode and in play mode
|-
| {{tc}} | customizable button images || {{yes}} || {{no}} || {{yes}} || {{un}} {{tip|the editor uses menus and has no buttons}}
|-
| {{tc}} | button images automatically synchronized with skin images || {{no}} || {{no}} || {{yes}} || {{un}}
|-
| {{tc}} | windows clipboard copy/paste || {{yes}} || {{yes}} {{tip|partial implementation: imports / exports complete levels instead of copying / pasting sections to the existing "document", i.e., the board|text=partial}} || {{no}} || <big style="color: red;background:beige;">?</big> {{tip|(will somebody with a full version check if it works here; the demo version has it on the menu in the editor and it does not mention any restrictions, but it does not work)|width=260px|text=help}}
|-
| {{tc}} | internal clipboard with multiple items || {{yes}} unlimited, persistent, with preview || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | edit board as text || {{no}} || {{no}} || {{no}} || {{no}}
|}
[[#top|Top]]

Feature list : Moves Management

2026-02-09T08:21:44Z

Matthias Meger: /* Moves Management */ removed last changed time

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Moves Management ==




{| class="soko-table feature-list"
! colspan="6" | Moves Management !! colspan="50" | <div align="right">Moves Management</div>
|- {{programs}}
| {{tc}} | copy/paste moves (normal) || {{yes}} || {{yes}} || {{yes}} || {{yes}} {{tip|partial implementation: solutions only, not savegames flaw: imported solutions are lost when the program exits flaw: imported moves are listed as solutions even if this is not the case|width=200px}} || {{yes}} || {{no}}
|-
| {{tc}} | copy/paste moves (run-length-encoded) || {{yes}} || {{yes}} partial: paste only || {{yes}} || {{no}} || {{yes}} || {{no}}
|-
| {{tc}} | copy moves after the current position || {{yes}}via keyboard: Ctrl+B || {{yes}}via menu: position -> copy || {{yes}} Ctrl+Shift+M || {{no}} || {{yes}}via keyboard: Ctrl+Alt+C || {{no}}
|-
| {{tc}} | paste moves as continuation of current position || {{yes}} || {{yes}} || {{yes}} || {{no}} || {{yes}} || {{no}}
|-
| {{tc}} | rotate and/or flip moves || {{no}}{{tip|board rotations and flips automatically synchronize existing savegames and solutions}} || {{no}} external program [http://www.joriswit.nl/sokoban/junk/solutionrotator.zip Solution Rotator] can be downloaded || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | edit move information (e.g, title, author, comment) || {{yes}}via snapshot window || {{yes}}via menu: position->save; properties: title || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | recreate maps from solutions || {{yes}} multiple solutions, with titles and info || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | load and save moves || sok (ascii text file, levels); clipboard: import/export || xht,txt (ascii text file, solutions), mov (sokofun movie); clipboard: import/export || sok (ascii text file, levels); clipboard: import/export || gam (xml text file, level); clipboard: import/export || txt (ascii text file, levels); clipboard: import/export || sokosave (savegame file)
|- {{programs}}
|}
[[#top|Top]]

<noinclude>

== Related pages ==
* [[Solution_format]] (German language)

== SokRFI - Sokoban Requests for Implementation ==


{| class="soko-table"
|-
! colspan="50" | Moves Management : SokRFI - Sokoban Requests for Implementation
|-
| width="120" {{tc}} | Feature || {{tc}} | Description
|-
|{{tc}}| animation snapshots capture: solutions || Sokoban++ offers a utility for this feature. (External program [http://www.joriswit.nl/sokoban/junk/ Sokoban Animator] can be downloaded)
|-
|{{tc}}| export solution as animation || Free formats: 
Text file:
:Scalable Vector Graphics ([http://www.w3.org/Graphics/SVG/ SVG]).
:Implementation with a [http://www.treebuilder.de/svg/sokoban/sokobano.svg template SVG].
Image file:
:Animated PNG ([http://wiki.mozilla.org/APNG_Specification APNG]) available with Firefox 3.
:[http://easysok.sourceforge.net EasySok] as alternative can save all the snapshots in a movie MNG.
|}
[[#top|Top]]
</noinclude>

Feature list : Customizing

2026-02-09T08:21:34Z

Matthias Meger: /* Customizing */ removed last changed time

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Customizing ==




{| class="soko-table"
! colspan="6" | Customizing !! colspan="50" | <div align="right">Customizing</div>
|- {{programs}}
| {{tc}} | settings interface || {{yes}} graphical user interface (tree-view) || {{yes}} graphical user interface (tabbed notebook view) || {{yes}} graphical user interface || {{yes}} graphical user interface (tabbed notebook view) || {{yes}} graphical user interface (window) || {{yes}} graphical user interface (window)
|-
| {{tc}} | configurable statusbar (e.g., level title, moves, pushes) || {{no}} || {{yes}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | configurable game state graphics (e.g., moves/pushes) || {{yes}} fonts, colours, buttons (static layout) || {{yes}} skin graphics (configurable layout) || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | customizable cursors || {{no}} || {{yes}} graphics, skin dependent || {{no}} || {{yes}} small/large built-in cursors || {{no}} || {{no}}
|-
| {{tc}} | customizable mouse actions || {{yes}}(only right-click) || {{no}} || {{no}} || || {{yes}}(buttons: left, middle, right) || {{no}}
|-
| {{tc}} | customizable sound events || {{yes}} independent || {{yes}} skin dependent || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | background music || {{no}}  || {{no}} || {{no}} || {{yes}} source: folder formats: midi, mp3. || {{no}} || {{no}}
|-
! colspan="6" | Customizing : Background Image!! colspan="50" | <div align="right">Customizing : Background Image</div>
|- {{programs}}
| {{tc}} | customizable backgrounds || {{yes}} independent, with preview || {{yes}} skin dependent || {{yes}} independent || {{yes}} skin dependent || {{yes}} independent, with preview || {{no}}
|-
| {{tc}} | background control || {{yes}} source: color, image; (image view: center, scale, stretch, tile) || {{yes}} source: color, image; (image view: center, stretch, tile) || {{no}} || {{yes}} source: image; (image view: tile) || {{yes}} source: image; (image view: center, stretch, tile) || {{no}}
|-
| {{tc}} | quick browse backgrounds || {{no}} "slow" browse via settings || {{no}} || {{yes}} browse with preview via settings || {{no}} || {{yes}} tool button with drop-down list || {{no}}
|}
[[#top|Top]]

<noinclude>

== SokRFI - Sokoban Requests for Implementation ==


{| class="soko-table feature-list"
|-
! colspan="50" | Customizing : SokRFI - Sokoban Requests for Implementation
|-
| width="120" {{tc}} | Feature || {{tc}} | Description
|-
|{{tc}}| background-image changer || This feature is for the users that look for to always have a different background, playing a level. It is applied to the following events in the program: 
• On program start-up • After solving a level. 
For the convenience of users and updates are groups all backgrounds in a single folder. One can also choose the mode in that the background will be changed: 
• Next image. • Previous image. • Random image.Implemented in Sokomind
|}
[[#top|Top]]
</noinclude>

Feature list : Multi-player Mode

2026-02-09T08:21:25Z

Matthias Meger: /* Multi-player Mode */ removed last changed time

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Multi-player Mode ==




{| class="soko-table feature-list"
! colspan="6" | Multi-player Mode !! colspan="50" | <div align="right">Multi-player Mode</div>
|- {{programs}}
| {{tc}} | [[Feature_list_:_Multi-player_Mode#Multi-player|multi-player]] || {{no}} || {{yes}}(options: create new player, change player) || {{no}} || {{yes}}(options: create new player, change player) || {{yes}}(options: create new player, change player) || {{no}}
|-
| {{tc}} | edit player information (e.g. name, email, country) || {{no}} || {{no}} || {{no}} || || {{no}} || {{yes}} {{tip|only when recording high score}}
|-
| {{tc}} | display personal high-scores || {{yes}} {{tip|cramped implementation and disabled by default. Enable it in "open" window via menu -> show solutions}} || {{yes}} via menu: level -> choose || {{no}} || {{yes}} via menu: view -> scores and solutions || {{yes}} drop-down list || {{yes}} via menu: help -> scores
|-
| {{tc}} | compare high-scores of all the players || {{ni|/a|Not applicable to single-player programs.}} || {{yes}} general and personal scores || {{ni|/a|Not applicable to single-player programs.}} || {{yes}}ranking with all the players || {{no}} || {{ni|/a|Not applicable to single-player programs.}}
|-
| {{tc}} | save and restore the player profiles (e.g. high-scores, settings) || {{ni|/a|Not applicable to single-player programs.}} || {{yes}} player position file (*.sav) || {{ni|/a|Not applicable to single-player programs.}} || ||{{yes}} player info file (*.SokoInfo) || {{ni|/a|Not applicable to single-player programs.}}
|-
| {{tc}} | remember each player's session (e.g. level, skin, quicksaves) {{tip|not to be confused with a single player program's ability to do the same. Feature implemented in Sokonline.|text=note}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|- {{programs}}
|}
[[#top|Top]]

<noinclude>

<h2>Info</h2>
=== Multi-player ===

This modality is useful for the competitions, each user can have his own configurations. As the personalization, with their scores, personal information, as the option of sending their solutions via e-mail.

These are options for the soko-programs that point, to give the option for competitive players that participate in the challenges of internet.

'''Related programs''' 
[http://sokoban.online.fr/mon_player.html Sokonline]

[[#top|Top]]
</noinclude>

Feature list : Additional Tools

2026-02-09T08:21:18Z

Matthias Meger: /* Additional Tools */ removed last changed time

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Additional Tools ==




{| class="soko-table"
! colspan="6" | Additional Tools !! colspan="50" | <div align="right">Additional Tools</div>
|- {{programs}}
| {{tc}} | level editor ([[Feature_list_:_Level_Editor|see details below]]) || {{yes}} || {{yes}} || {{yes}} || {{yes}} ||{{no}} || {{no}}
|-
| {{tc}} | solver ([[Feature_list_:_Solver|see details below]]) || {{yes}} common solver plugins (allowing continued game play) || {{yes}} common solver plugins (blocking game play) || {{yes}} built-in (blocking game play) || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | optimizer ([[Feature_list_:_Solver#Additional_Tools_:_Optimizer|see details below]]) || {{yes}} common optimizer plugins (allowing continued game play) || {{no}} || {{yes}} built-in (blocking game play) || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | locate and browse duplicates or look-alikes ([[Feature_list_:_Duplicate_Finder|see details below]]) || {{yes}} || {{no}} || {{no}} || {{no}} || {{no}} external program [http://geocities.com/ygp_bg/sokodup.zip Soko-Dup] can be downloaded || {{no}}
|-
| {{tc}} | skin graphics editor || {{no}} skin script editor available || {{no}} skin script editor available || {{no}} || {{yes}} || {{no}} || {{no}}
|-
| {{tc}} | level generator || {{yes}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | optimizer for unnecessary moves between pushes || {{yes}} automatically during game-play || {{yes}} manually via menu || {{yes}} automatically during game-play || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | level file converters || {{yes}} {{tip|SokoMind (including solutions), Sokoban for Windows by Björn Källmark (including solutions), Sokofan (including solutions)|width=250px|text=file types}} || {{yes}} {{tip|ASCII (*.txt, *.xsb, *.screen, *.skm, *.scb), Sokoban (*.sls), Visual Sokoban 1 and 2 (*.pak), WinSoko (*.rdf), Games 4 Brains (*.lp0), Mark McIntyres Soko (*.sok), XML Sokoban (*.xml), Sokoban XP (*.sxl), Games 4 Brains Sokoblue (*.dat), Icons (*.ico), Björn Källmark's xml format (*.slc)|width=270px|text=file types}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | image snapshot capture || {{no}} || {{yes}} miniature level bitmap with 1 pixel per square; via menu: level->copy level || {{no}} || {{no}} || {{no}} || {{no}}
|- {{programs}}
|}
[[#top|Top]]

Feature list : Skin Features

2026-02-09T08:21:10Z

Matthias Meger: /* Skin Features */ removed last changed time

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Skin Features ==




{| class="soko-table"
! colspan="6" | Skin Features !! colspan="50" | <div align="right">Skin Features</div>
|- {{programs}}
| {{tc}} | customizable skin || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{no}}
|-
| {{tc}} | skin formats || {{yes}} meta-script language {{tip|includes scripts for importing the following skin formats: common sokoban skin images (YSokoban), Sokoban++ skin scripts, Sokofan skin scripts, Visual Sokoban skin scripts, Sokoban for Windows skin scripts (Björn Källmark), Sokoban BDE images, SuperSoko skin images, SokoStation4 skin scripts JSoko skin scripts|width=210px}} || {{yes}} Sokoban++ skin scripts (ini) || {{yes}} two built-in skins || {{yes}} Sokoban for Windows skin scripts (skn) || {{yes}} common sokoban skin images (YSokoban) || {{no}}
|-
| {{tc}} | resizeable skins || {{yes}} || {{no}} || {{yes}} || {{yes}} || {{no}} || {{no}}
|-
| {{tc}} | pseudo-3D skins (sokoban++ style) || {{no}} || {{yes}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | legal moves box animation (ysokoban style) || {{yes}} || {{no}} || {{no}} || {{no}} || {{yes}} || {{no}}
|-
| {{tc}} | legal moves player animation (ysokoban style) || {{yes}} || {{no}} || {{no}} || {{no}} ||{{yes}} || {{no}}
|-
| {{tc}} | solution animation (ysokoban style) || {{yes}} || {{no}} || {{no}} || {{no}} || {{yes}} || {{no}}
|-
| {{tc}} | animation frame extrapolation (morphing) || {{yes}} 30 frames || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | directional player || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{no}} || {{no}}
|-
| {{tc}} | directional player can return to an "at ease" position || {{no}} || {{no}} || {{no}} || {{yes}} || {{no}} || {{no}}
|-
| {{tc}} | directional box|| {{no}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | directional box can return to an "at ease" position || {{no}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | support for seamless walls (as opposed to discrete walls) || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{no}}
|-
| {{tc}} | walls can be transparent || {{no}} || {{no}} skin dependent || {{yes}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | floors can be transparent || {{yes}} || {{no}} skin dependent || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | skin browser with preview || {{yes}} image-based skins; not scripted skins || {{no}} || {{yes}} || {{yes}} || {{no}} || {{no}}
|-
| {{tc}} | recent skins history || {{yes}} || {{yes}} || {{no}} || {{un}} {{tip|with all skins in a list it is just as easy to browse the whole list}} || {{no}} || {{no}}
|-
| {{tc}} | quick browse skins || {{yes}} menu: default, recent skins; keyboard shortcuts: next, default || {{yes}} menu: default, recent skins || {{yes}} menu: skin list || {{yes}} menu: skin list || {{yes}} use F4-F8 to select one of the loaded skins || {{no}}
|- {{programs}}
|}
[[#top|Top]]

Feature list : Duplicate Finder

2026-02-09T08:21:02Z

Matthias Meger: /* Additional Tools : Duplicate Finder */ removed last changed time

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Additional Tools : Duplicate Finder ==




{| class="soko-table"
! colspan="6" | Additional Tools : Duplicate Finder !!
|- {{programs|3= |4= |6= }}
| {{tc}} | duplicate finder || built-in ||{{ni}} {{tip|(Alternatively has the feature '''duplicate levels exchange solutions''')|text=note|menu=yes}} || || || external utility
|-
| {{tc}} | search type || {{yes}} equal and similar levels. type: rotated and mirrored, dead squares removal, normalized walls, normalized pusher position. || || || || {{yes}} equal and similar levels. type: rotated and mirrored, dead squares removal, normalized walls, normalized pusher position.
|-
| {{tc}} | relaxed match options || {{yes}}{{tip|* with/without boxes * with/without goals * with/without interior walls * with/without exterior walls}} || || || || {{yes}}{{tip|* targets only, with optional threshold count * without pusher and boxes * walls only * without internal walls * floors only}}
|-
| {{tc}} | search current level duplicates || {{yes}} || || || || {{no}}
|-
| {{tc}} | duplicate levels preview || {{yes}} || || || || {{no}}
|-
| {{tc}} | search history || {{tip|a persistent user maintained "scanned folders" list is available|text=note}} || || || || {{no}}
|-
| {{tc}} | export report duplicates ||{{yes}}|| || || ||{{yes}}
|-
| {{tc}} | duplicate levels exchange solutions || {{yes}} {{tip| normalized levels exchange solutions, i.e., an exact match is not required.}} || {{yes}} {{tip|identical levels automatically exchange their solutions}} || || || {{yes}}
|}
[[#top|Top]]

<noinclude>

==Info==
=== Related pages ===

* [[Pruning_duplicate_positions|Pruning duplicate positions]]

[[#top|Top]]
</noinclude>

Feature list : Solver

2026-02-09T08:20:54Z

Matthias Meger: /* Additional Tools : Solver */ removed last changed time

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Additional Tools : Solver ==




{| class="soko-table feature-list"
! colspan="5" | Additional Tools - Solver
|- {{programs|4=<div>[http://www.ic-net.or.jp/home/takaken/e/soko/index.html Takaken]</div>|5= |6= }}
| {{tc}} | solver || common solver plugins || common solver plugins || built-in || built-in
|-
| {{tc}} | solver running mode || background, allowing continued game play || foreground, blocking game play || foreground, blocking game play || foreground, blocking game play
|-
| {{tc}} | solution types (e.g., any, move-optimal, push-optimal) || solver strategies and options depend on the plugins, not the host program || solver strategies and options depend on the plugins, not the host program || push-optimal, push-optimal with best moves, move-optimal with best pushes || move-optimal, push-optimal
|-
| {{tc}} | task queue || {{yes}} || {{no}} || {{no}} || {{no}}
|}
[[#top|Top]]

<noinclude>

==Info==
===Related Pages===
[[Solver|Solver]]

[[#top|Top]]
</noinclude>

Feature list : Optimizer

2026-02-09T08:20:44Z

Matthias Meger: /* Additional Tools : Optimizer */ removed last changed time

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Additional Tools : Optimizer ==




{| class="soko-table feature-list"
! colspan="6" | Additional Tools - Optimizer !!
|- {{programs|2= |4= |5= |6= }}
| {{tc}} | optimizer || common optimizer plugins || || built-in
|-
| {{tc}} | optimizer running mode || background, allowing continued game play || || foreground, allowing continued game play
|-
| {{tc}} | optimization options (e.g., move-optimal, push-optimal) || optimization settings and options depend on the plugins, not the host program || || pushes/moves, moves/pushes, box changes, box lines
|-
| {{tc}} | task queue || {{yes}} || || {{no}}
|}
[[#top|Top]]

<noinclude>

==Info==
===Related pages===
[[Optimizer|Optimizer_Development]]

[[#top|Top]]
</noinclude>

How to play Sokoban

2026-02-09T07:55:59Z

Matthias Meger: replaced <code> by <pre>

This article explains how to play Sokoban. There are also simple strategies explained.

First let's have a look at the rules of the game:

The object of Sokoban is to take some objects (usually boxes) to designated locations by pushing them.

To do this the user moves a man who we call Sokoban. Sokoban can move up, down, left and right. He can't pass through walls or boxes. He can push only one box at a time (never pull). At any time a square can only be occupied by one of a wall, box or man.

A level contains these elements:
<pre>
Walls: #
Boxes: $
Goals: .
Free squares: ' '
The Sokoban / the player: @
</pre>

Boxes and the Sokoban can also be located on a goal.

<pre>
Boxes on goals: *
The Sokoban on a goal: +
</pre>

In the following the Sokoban is called "the player" to indicate that this is the object the user can move.

Movements:
Nearly all Sokoban games can be played using the arrow keys. Nowadays many programs also support playing with the mouse.
All moves of the Sokoban need only to be done for pushing a box.
<pre>
Level 1
#########
#@ $ .#
#########
</pre>
Using the arrow keys one has to press the "right arrow" 5 times.
Using the mouse you have to mark the box for pushing (by clicking on it) and then clicking at the position the box is to be pushed to.

<pre>
Level 2
########
# ###
#@$ ###
#### ###
## ###
## ##
# ##. #
# #
##### #
########
</pre>

Here the difference between playing with keyboard and playing with mouse is demonstrated. Using the mouse is as simple as in Level 1. Using the arrow keys needs a lot of key presses for pushing the box to the goal.
Hence, it's always recommended to use the mouse for playing. The advantages compared to keyboard playing are:
# With two clicks a box can be pushed to every possible square
# Most programs automatically calculates the best moves for the player. Hence the user doesn't have to think about how to move the player by keys.
# Some programs even show the squares a box can be pushed to. In this way it's easy to see if a box can be pushed to the selected position.
# The user can concentrate on pushes only instead of moves and pushes

Levels containing only one box are very simple to solve using the mouse: One just has to mark the box for pushing and then to choose the goal square as target.

Usually Sokoban levels are a lot more complicated.

Let's increase the difficulty step by step:
<pre>
Level 3
########
# #
# $ .#
#@ $ .#
# $ .#
# #
########
</pre>
Here the level contains 3 boxes. Nevertheless the level can easily be solved. Although every box can be pushed to each goal it doesn't matter which box is pushed to which goal. The boxes can just be pushed one after the other to any goal.

<pre>
Level 4
########
# #. #
# $# #
# # @##
# # $##
# .##
########
</pre>
This level is more complicated. The box under the player is close to a goal. Nevertheless it can't be pushed to the goal - this would result in a [[Deadlocks|deadlock]]. This level shows some problems one has to solve before it's possible to finish the level:
# Not every box can be pushed to every goal
# Boxes can't just be pushed to the nearest goal in every case
# Box pushes can create a [[Deadlocks|deadlock]]

<pre>
Level 5
#########
## # #
#.$. $ #
# # ## #
# @$.$. #
#########
</pre>

To solve this level the boxes have to be pushed to their goals in a specific order. Moreover one box has to be pushed away from its goal before it can be pushed to it.

<pre>
Level 6
#########
# # .#
#@$ $ #
# $ ##..#
# #####
#########
</pre>

This level is another example of the need to push a box away from its goal before the level can be solved. Additionally one box has to be "parked" until some other boxes have reached their goals. A situation where a box must be pushed but can't be pushed immediately to its goal occurs very often in Sokoban levels. Some of them are "parking" situations.
"Parking" means:
# a box must be pushed away from its goal
# after the box is pushed to its parking position another box has to be pushed
# parking the box at a specific position is required to solve the level

== Reverse play ==

Some Sokoban programs allow to play a puzzle backward.

Starting with all boxes on goal squares, the player pulls the boxes to return to the initial puzzle state.

Solutions found this way solve the standard puzzle when both the order and the direction of the moves are reversed.

This approach can help players better understand the puzzle structure and develop effective solving strategies.

Solver Statistics

2026-02-08T22:06:22Z

Matthias Meger: /* Disclaimer */ fixed URL

A Sokoban solver program is a program that ''tries to'' solve Sokoban levels. There are several solver programs available. (See [[Links#Sokoban Solvers |Sokoban solvers]].)

Solver programs may have different objectives:
# Find any solution
# Find push optimal solutions
# Find push optimal solutions with best moves
# Find move optimal solutions
# Find move optimal solutions with best pushes

Given the computational complexity of these tasks, a solver program is usually designed for just finding any solution. If a solution is to be optimized, an optimizer program can be used. (See [[Links#Sokoban Solvers |Optimizers]].)

The statistics presented here provide a picture of what the best freely available Sokoban solvers can do. 
For copyrights, credits and redistribution of these statistics, please read the disclaimer.

== General benchmarking information ==

For practical reasons, almost all tests have been performed with a 10 minutes time limit. The tests are, however, not a 10 minutes contest but a showcase for what the solvers can do, so other time limits are entirely feasible.

The hardware used for the tests is a standard PC with a modern operating system (64bit).

Tests are performed with default solver settings.

{| class="soko-table feature-list"
!Solver || Version || Author || Architecture || CPU usage || Source code available || More info

|-
|[https://festival-solver.site/ Festival] || 3.1 || Yaron Shoham || 64bit || 8 threads || [https://festival-solver.site/ Festival 3.1] || [https://festival-solver.site/ Website with papers about the solver]

|-
|[http://sokolution.infinityfreeapp.com/ Sokolution] || 7.32 || Florent Diedler || 64bit || all threads || no || [[Sokoban solver "scribbles" by Florent Diedler about the Sokolution solver | Sokoban solver "scribbles" by Florent Diedler]]

|-
|[https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken] || 7.4 || Ken'ichiro Takahashi (takaken) || 64bit || 2 threads || no || [https://computerpuzzle.net/puzzle/sokoban/ver731/index.html Description of the used algorithms]

|-
|[https://festival-solver.site/curry/ Curry] || 0.3 || Yaron Shoham || 64bit || 1 thread || [https://festival-solver.site/curry/ Curry 0.3] || [https://festival-solver.site/curry/ Website with paper about the solver]

|-
|[https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch] || 7.0 beta 1 || 葛永 (Ge Yong) || 64bit || 1 thread || no || [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch Website of BoxSearch]

|-
|[https://sourceforge.net/projects/sokobanyasc/files/sokobanyasc/ YASS] || 2.153 || Brian Damgaard || 32bit + 64bit || 1 thread || [https://sourceforge.net/projects/sokobanyasc/files/sokobanyasc/ YASS 2.153] || [[Sokoban solver "scribbles" by Brian Damgaard about the YASS solver | Sokoban solver "scribbles" by Brian Damgaard]]

|-
|[https://jsokoapplet.sourceforge.io/ JSoko] || 2.25 || Matthias Meger || 64bit || 1 thread || [https://sourceforge.net/projects/jsokoapplet/files/JSoko/Version%202.24/ JSoko 2.25] || [[Solver | Solver information]]
|-
|[https://webdocs.cs.ualberta.ca/~games/Sokoban/program.html Rolling Stone] || 1.0 || Andreas Junghanns || 32bit || 1 thread || [https://webdocs.cs.ualberta.ca/~games/Sokoban/Src/ RS] || [https://scholar.google.com/scholar?hl=de&as_sdt=0%2C5&q=rolling+stone+sokoban&btnG= Rolling Stone papers]

|}

Contact: SokobanoWiki@gmail.com

== XSokoban Test Suite ==

The XSokoban level set is the de facto standard test suite in the academic literature on Sokoban solver programming.

{| class="soko-table"
|-
! colspan="11" | Sokoban Solver Statistics - XSokoban Test Suite - Solved Levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" | Collection
| width="160" | Author
| width=" 70" | Levels
| width= "90" | [https://www.researchgate.net/publication/2305703_Pushing_the_Limits_New_Developments_in_Single-Agent_Search Rolling Stone]
| width= "80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width=" 80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]
| width=" 80" | [[JSoko Solver | JSoko]]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution ]
| width=" 80" | [https://festival-solver.site/curry/ Curry ]
| width=" 80" | [https://festival-solver.site/ Festival ]
| width=" 80" | [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch]




|- align="right"
| align="left" bgcolor="#f1efe5" | [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/ XSokoban]
| align="left" | Thinking Rabbit, ...
| 90
| [https://webdocs.cs.ualberta.ca/~games/Sokoban/program.html 59*]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Takaken%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/YASS%20-%20XSokoban.html 89]
| [[SolverStatistics-jsoko-ThinkingRabbit-XSokoban | 67 ]]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Sokolution%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Curry%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Festival%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/BoxSearch%20-%20XSokoban.html '''89''']

|}

*) 59 solved puzzles according to paper [https://sokoban.dk/wp-content/uploads/2016/02/Single-Agent.pdf Sokoban Enhancing general single-agent search methods using domain knowledge]

{| class="soko-table"
|-


! colspan="7" | Sokoban Solver Statistics - XSokoban Test Suite - Push-optimal Solutions
|- bgcolor="#f1efe5" align="center"
| width="115" align="left" | Collection
| width="160" | Author
| width=" 70" | Levels
| width=" 80" | [https://www.researchgate.net/publication/2305703_Pushing_the_Limits_New_Developments_in_Single-Agent_Search Rolling Stone]
| width=" 80" | [http://www.ijcai.org/Abstract/16/100 Pereira et al.]
| width=" 80" | [http://sourceforge.net/projects/jsokoapplet/ JSoko]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution ]


|- align="right"
| align="left" bgcolor="#f1efe5" | XSokoban
| align="left" | Thinking Rabbit, ...
| 90
| [https://webdocs.cs.ualberta.ca/~games/Sokoban/program.html 6 ]
| [[SolverStatistics-Pereira-ThinkingRabbit-XSokoban-Push-Optimal | 28 ]]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/JSoko%20-%20XSokoban.html 25]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/Sokolution%20-%20XSokoban.html '''73''']

|}

The statistic shows that Sokolution is by far the best solver when searching for push optimal solutions.

== Large Test Suite ==

The large test suite comprises level packs selected for being a challenge for the solvers, but not too difficult. The statistics shows the results for the leading Sokoban solver programs.

This test suite is not subject to change, as it is intended to be a "Large Standard Test Suite" for Sokoban solver programs.

{| class="soko-table"
|-
! colspan="7" | Sokoban Solver Statistics - Large Test Suite - Solved levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" |
| width=" 70" | Levels
| width= "80" | [https://festival-solver.site/ Festival ]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution]
| width=" 80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width=" 80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]
| width=" 80" | [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch]

|- bgcolor="#f1efe5" align="right"
| align="left" | Total levels
| 3272 
| '''3208''' 
| 3207 
| 2953 
| 2899 
| 2749 

|}

'''[https://sokoban-solver-statistics.sourceforge.io/statistics/LargeTestSuite/ Click here to see the detailed results for the Large Test Suite].'''

Download the entire test suite [https://sourceforge.net/projects/sokoban-solver-statistics/files/Large%20Test%20Suite.zip/download here] or the individual level sets from [http://sokobano.de/de/levels.php www.sokobano.de].

== Open Test Suite ==

The statistics shows the results for the leading Sokoban solvers for various level collections. Please note that the grand totals are simple summations. The number of solved unique levels may differ slightly due to duplicate levels in the level packs.

This test suite may be changed by adding new level collections from time to time.

{| class="soko-table"
|-
! colspan="7" | Sokoban Solver Statistics - Open Test Suite - Solved levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" |
| width=" 70" | Levels
| width= "80" | [https://festival-solver.site/ Festival]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution]
| width=" 80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width=" 80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]
| width=" 80" | [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch]

|- bgcolor="#f1efe5" align="right"
| align="left" | Total levels
| 10043 
| '''9596''' 
| 9516 
| 8721 
| 8339 
| 8111 

|}

'''[https://sokoban-solver-statistics.sourceforge.io/statistics/OpenTestSuite/ Click here to see the detailed results for the Open Test Suite].'''

[https://sokoban-solver-statistics.sourceforge.io/statistics/Sokolution/ Comparison for the Open Test Suite for all Sokolution versions].

== Push-optimal Test Suite ==

The "Push-optimal Test Suite" comprises level packs selected for being a challenge for the solvers, but not too difficult. The statistics shows the results for the leading Sokoban solver programs.

For this test suite the solvers must solve the puzzles push optimal.

{| class="soko-table"
|-
! colspan="6" | Sokoban Solver Statistics - Large Test Suite - Solved levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" |
| width=" 70" | Levels
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution]

|- bgcolor="#f1efe5" align="right"
| align="left" | Total levels
| 1588 
| [https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/ '''1529'''] 
|}

'''[https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/ Click here to see the detailed results for the Push-Optimal Test Suite].'''

== GroupEffort Test Suite ==

The only reason for benchmarking the GroupEffort test suite is to demonstrate the limited veracity of the statement made in section "6 Conclusion" of the thesis, where the author writes that the GroupEffort solver "outperforms existing solvers".

The benchmarks show that this was only true for the cherry-picked small test set at the time the thesis was published, never for the presumably more representative large test set.

{| class="soko-table"
|-
! colspan="8" | Sokoban Solver Statistics - GroupEffort Test Suite - Solved Levels




|- bgcolor="#f1efe5" align="center" 
| width = "115" align="left" | Collection
| width = "80" | Levels
| width = "80" | [https://baldur.iti.kit.edu/theses/SokobanPortfolio.pdf GroupEffort]
| width = "80" | [https://festival-solver.site/ Festival]
| width = "80" | [http://sokolution.infinityfreeapp.com/ Sokolution]
| width = "80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width = "80" | [https://sourceforge.net/projects/jsokoapplet/ JSoko]
| width = "80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]




|- align="right"
| align="left" bgcolor="#f1efe5" | [[SolverStatistics-GroupEffort-Small-Set | Small Set]]
| 200
| 196 (a)(c)
| [[SolverStatistics-Festival-GroupEffort-Small-Set | '''200''' (b) ]]
| [[SolverStatistics-Sokolution-GroupEffort-Small-Set | '''200''' (a) ]]
| [[SolverStatistics-Takaken-GroupEffort-Small-Set | 192 (b) ]]
| [[SolverStatistics-JSoko-GroupEffort-Small-Set | 180 (b) ]]
| [[SolverStatistics-YASS-GroupEffort-Small-Set | 191 (b) ]]




|- align="right"
| align="left" bgcolor="#f1efe5"| [[SolverStatistics-GroupEffort-Large-Set | Large Set]]
| 2851
| 1566 (a)(c)
| [[SolverStatistics-Festival-GroupEffort-Large-Set | '''2766''' (b) ]]
| [[SolverStatistics-Sokolution-GroupEffort-Large-Set | 2471 (a) ]]
| [[SolverStatistics-Takaken-GroupEffort-Large-Set | 2462 (b) ]]
| [[SolverStatistics-JSoko-GroupEffort-Large-Set | 2165 (b) ]]
| [[SolverStatistics-YASS-GroupEffort-Large-Set | 2260 (b) ]]




|- align="right" bgcolor="#f1efe5" align="right"
| align="left"| Total
| 3051 
| 1762 
| '''2966''' 
| 2671 
| 2654 
| 2345 
| 2471 
|}

(a): Time limit: 5 minutes     (b): Time limit: 10 minutes     (c): Best GroupEffort solver configuration

== Disclaimer ==

Sokoban
=======
 
Sokoban (R) Registered Trademark of Falcon Co., Ltd., Japan
Sokoban Copyright (C) 1982-2004 by Hiroyuki Imabayashi, Japan
Sokoban Copyright (C) 1989, 1990, 2001-2004 by Falcon Co., Ltd., Japan
 
License
=======
 
Redistribution and use of the Sokoban Solver statistics are permitted
provided that the following conditions are met:
 
* Redistributions may not be sold, nor may they be used in a commercial product or activity.
* Redistributions must reproduce the entire content of this disclaimer in the documentation
and/or other materials provided with the distribution.
 
Credits (in no particular order)
================================
 
CosmoNotes, CosmoPoly, LOMA, MicroCosmos, MiniCosmos,
NaboCosmos and PicoCosmos level sets
Copyright (C) by Aymeric du Peloux.
E-mail: aymeric.du-peloux@gadz.org
Web site: unknown
 
dh1, dh2, bagatelle, cantrip, and maelstrom level sets
Copyright (C) by David Holland
E-mail: unknown
Web site: unknown
 
Microban, Mas Microban, Sasquatch, Mas Sasquatch, Sasquatch III,
Sasquatch IV, Sasquatch V, Sasquatch VI and Sasquatch VII level sets.
Copyright (C) by David W. Skinner
E-mail: sasquatch@bentonrea.com
Web site: unknown
 
Grigr2001, Grigr2002 and GrigrSpecial level sets
Copyright (C) by Evgeny Grigoriev (aka GRIGoRusha)
E-mail: grigr@yandex.ru
Web site: http://grigr.narod.ru/
 
SokEvo and SokHard level sets
Copyright (C) 2002-2006 by Lee J Haywood
E-mail: fruise@gmail.com
Web Site: https://ljhaywood.uk/games/sokoban/
 
Sven level set
Copyright (C) 2007 by Sven Egevad
E-mail: sven.egevad@telia.com
Web Site: unknown
 
Sokoban Perfect and Sokoban Revenge level sets
Copyright (C) 1989, 1991 by Thinking Rabbit
Web Site: https://sokoban.jp/
 
Y.M. Auto and Y.M. Handmade level sets
Copyright (C) Yoshio Murase
E-mail: yoshio@asahi.email.ne.jp
Web Site: http://www.ne.jp/asahi/ai/yoshio/sokoban/index.html
 
JSoko
Copyright (C) by Matthias Meger
E-mail: JSoko@mail.de
Web site: https://jsokoapplet.sourceforge.io/
 
Sokoban Automatic Solver (aka Takaken solver)
Copyright (C) 2002 - 200X Ken'ichiro Takahashi (aka takaken)
E-mail: takaken@ic-net.or.jp
Web site: https://computerpuzzle.net/english/sokoban/ver740/index.html
 
YASS - Yet Another Sokoban Solver and Optimizer - For Small Levels
Copyright (C) 2007 by Brian Damgaard
Web site: https://sourceforge.net/projects/sokobanyasc/
 
Sokoban YASC
Copyright (C) 2001-2020 by Brian Damgaard
Web Site: https://sourceforge.net/projects/sokobanyasc/
 
YSokoban
Copyright (C) 2007 by George Petrov
E-mail: YGP@WriteMe.com
Web Site: http://ygp.orgfree.com/sokoban.html
 
XSokoban
Copyright (C) by Andrew Myers
E-mail: andru@cs.cornell.edu
Web Site: http://www.cs.cornell.edu/andru/xsokoban.html
 
Sokofan
Copyright (C) 2005-2007 by Eric Leung
E-mail: eleung2@hotpop.com
Web Site: unknown
 
Sokolution
Copyright (C) 2016-2019 by Florent DIEDLER
E-mail: fdiedler2000@gmail.com
Web site: http://sokolution.infinityfreeapp.com/
 
Festival
Copyright (C) 2020 by Yaron Shoham
Web site: https://festival-solver.site/
 
Trademarks
==========
 
Company names, brand names and product names are trademarks
or registered trademarks of their respective holders.
 
Contact
=======
 
E-mail: sokobanowiki@gmail.com

Links

2026-01-23T18:05:59Z

Matthias Meger: Updated links

This page contains links to several web-sites with Sokoban related material, e.g., programs, levels, and publications.

== Sokoban Programs ==
[[Feature list]] comparing Sokoban programs.

{| class="soko-table"
|-
! Name || Author || Operating System
|-
| [[First Sokoban program]] || Hiroyuki Imabayashi || PC-8801
|-
| [http://sourceforge.net/projects/sokobanyasc/ Sokoban YASC ] || Brian Damgaard || Windows
|-
| [http://www.joriswit.nl/sokoban/ Sokoban++] || Joris Wit || Windows
|-
| [http://www.sokosave.org/ SokoSave Mobile] || Eric Sunshine || Windows Mobile
|-
| [http://www.sokosave.org/ SokoSave Desktop] || Eric Sunshine || Windows, MacOS/X
|-
| [https://jsokoapplet.sourceforge.io/ JSoko] || Matthias Meger || Platform independent (Java)
|-
| [http://www.sourcecode.se/sokoban/ Sokoban for Windows] || Björn Källmark || Windows
|-
| [http://ygp.orgfree.com/sokoban.html YSokoban] || George Petrov || Windows
|-
| [http://www.fuzitoo.com/ Fuzitoo] || Jean Van Laethem || Windows
|-
| [https://puzzle-dungeon.github.io/ Puzzle Dungeon] || Mikhael Goikhman || GNU/Linux, Windows
|}

== Sokoban Solvers ==
[[Solver Statistics | Statistics]] comparing Sokoban solvers.

{| class="soko-table"
|-
! Name || Author || Operating System
|-
| [https://computerpuzzle.net/english/sokoban/ver740/index.html Sokoban Automatic solver] || Ken'ichiro Takahashi (takaken) || Windows
|-
| [http://www.cs.ualberta.ca/~games/Sokoban/program.html Rolling Stone] || Andreas Junghanns || Linux sourcecode
|-
| [https://sourceforge.net/projects/sokobanyasc/files/sokobanyasc/ YASS] || Brian Damgaard || Windows / Platform independent source code (Pascal)
|-
| [https://jsokoapplet.sourceforge.io/ JSoko] || Matthias Meger || Platform independent (Java)
|-
| [https://sokolution.infinityfreeapp.com/ Sokolution] || Florent Diedler || Windows
|-
| [https://festival-solver.site/ Festival] || Yaron Shoham || Windows
|-
| [https://festival-solver.site/curry/ Curry] || Yaron Shoham || Windows
|-
| [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch] || Ge Yong || Windows
|}

== Worldwide Sokoban High-Scores ==
{| class="soko-table"
! colspan="2" | worldwide best known highscores
|-
| [http://sokobano.de/scores/ Sokoban PROJECT] || Sokobano.de
|}

{| class="soko-table feature-list"
! colspan="2" |last XSokoban highscore list from december 2005
|-
|[http://web.archive.org/web/20051201163838/www5.cs.cornell.edu/cgi-bin/andru/xsokoban/best-scores-moves by moves] || [http://web.archive.org/web/20051201164016/www5.cs.cornell.edu/cgi-bin/andru/xsokoban/best-scores-pushes by pushes]
|}

== Level Generators ==
{| class="soko-table"
|-
! Name || Author || Operating System
|-
| [https://sourceforge.net/projects/sokobanyasc/files/sokobanyasc/ YASGen] || Brian Damgaard || Windows / Platform independent source code (Pascal)
|-
| [[User:Sokobania | sokogen]] || Jacques Duthen || UNIX / lisp
|}

== Fan Groups ==
[https://www.facebook.com/groups/539527933307469/ Facebook Sokoban Group]

[https://groups.io/g/sokoban Groups.io Sokoban Group]

== Optimizers ==
{| class="soko-table"
|-
! Name || Author || Operating System
|-
| [https://sourceforge.net/projects/sokobanyasc/files/sokobanyasc/ YASO] || Brian Damgaard || Windows / Platform independent source code (Pascal)
|-
| [http://sourceforge.net/projects/jsokoapplet/ JSoko] || Matthias Meger || Platform independent (Java)
|-
| [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch] || Ge Yong || Windows
|}

== Levels for Downloading ==
* [http://www.sourcecode.se/sokoban/levels.php Sourcecode.se]
* [http://sokobano.de/scores/ Sokoban PROJECT]
* [http://grigr.narod.ru/ Evgeny Grigoriev Maps]
* [http://kantorek.webzdarma.cz/sokobana.htm František Pokorný Maps]
* [https://ljhaywood.uk/games/sokoban/ Lee J Haywood Maps]

== Information about the original Sokoban game puzzles ==
* [https://wayneca.neocities.org/Sokoban/ Tribute to original Sokoban game puzzles]

== Literature ==
* [http://www.cs.ualberta.ca/~games/Sokoban/papers.html Sokoban Publications]

== Additional Sokoban links ==

* [http://www.onlinespiele-sammlung.de/sokoban/list-of-sokoban-games.php?records_to_show=-1 "Sokoban online" collection (German)]
* [http://sourceforge.net/projects/yasminuroban/ Yasminuroban (DHTML Sokoban)]

=== Online Sokoban Games ===
;'''JavaScript'''
* [http://sokoban.e-contento.com/sokoban.php Sokoban en JavaScript] by Juan Antonio Jiménez
* [http://www.game-sokoban.com Game Sokoban]
* [https://ljhaywood.uk/games/crossoban/ Crossoban] by Lee J Haywood
* [https://sokoban-solver.com/ Sokoban Solver] Explore tens of thousands of Sokoban puzzles with solutions ready for replay
* [https://www.linusakesson.net/games/autosokoban/ Autosokoban] Website which generates an unlimited number of puzzles with increasing difficulty to play online
* [http://www.letslogic.com/ Lets Logic - The Online Sokoban Community]
* [https://sokoban-solver-statistics.sourceforge.io Sokoban Javascript] by Matthias Meger

=== Online Sokoban Variant Games ===
;'''JavaScript'''
* [http://www.chrisfortey.com/#sokobanColours Sokoban Colours]

Solver Statistics

2025-08-14T15:18:29Z

Matthias Meger: /* Open Test Suite */ added BoxSearch to Open Test Suite and removed a duplicate collection from all results

A Sokoban solver program is a program that ''tries to'' solve Sokoban levels. There are several solver programs available. (See [[Links#Sokoban Solvers |Sokoban solvers]].)

Solver programs may have different objectives:
# Find any solution
# Find push optimal solutions
# Find push optimal solutions with best moves
# Find move optimal solutions
# Find move optimal solutions with best pushes

Given the computational complexity of these tasks, a solver program is usually designed for just finding any solution. If a solution is to be optimized, an optimizer program can be used. (See [[Links#Sokoban Solvers |Optimizers]].)

The statistics presented here provide a picture of what the best freely available Sokoban solvers can do. 
For copyrights, credits and redistribution of these statistics, please read the disclaimer.

== General benchmarking information ==

For practical reasons, almost all tests have been performed with a 10 minutes time limit. The tests are, however, not a 10 minutes contest but a showcase for what the solvers can do, so other time limits are entirely feasible.

The hardware used for the tests is a standard PC with a modern operating system (64bit).

Tests are performed with default solver settings.

{| class="soko-table feature-list"
!Solver || Version || Author || Architecture || CPU usage || Source code available || More info

|-
|[https://festival-solver.site/ Festival] || 3.1 || Yaron Shoham || 64bit || 8 threads || [https://festival-solver.site/ Festival 3.1] || [https://festival-solver.site/ Website with papers about the solver]

|-
|[http://sokolution.infinityfreeapp.com/ Sokolution] || 7.32 || Florent Diedler || 64bit || all threads || no || [[Sokoban solver "scribbles" by Florent Diedler about the Sokolution solver | Sokoban solver "scribbles" by Florent Diedler]]

|-
|[https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken] || 7.4 || Ken'ichiro Takahashi (takaken) || 64bit || 2 threads || no || [https://computerpuzzle.net/puzzle/sokoban/ver731/index.html Description of the used algorithms]

|-
|[https://festival-solver.site/curry/ Curry] || 0.3 || Yaron Shoham || 64bit || 1 thread || [https://festival-solver.site/curry/ Curry 0.3] || [https://festival-solver.site/curry/ Website with paper about the solver]

|-
|[https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch] || 7.0 beta 1 || 葛永 (Ge Yong) || 64bit || 1 thread || no || [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch Website of BoxSearch]

|-
|[https://sourceforge.net/projects/sokobanyasc/files/sokobanyasc/ YASS] || 2.153 || Brian Damgaard || 32bit + 64bit || 1 thread || [https://sourceforge.net/projects/sokobanyasc/files/sokobanyasc/ YASS 2.153] || [[Sokoban solver "scribbles" by Brian Damgaard about the YASS solver | Sokoban solver "scribbles" by Brian Damgaard]]

|-
|[https://jsokoapplet.sourceforge.io/ JSoko] || 2.25 || Matthias Meger || 64bit || 1 thread || [https://sourceforge.net/projects/jsokoapplet/files/JSoko/Version%202.24/ JSoko 2.25] || [[Solver | Solver information]]
|-
|[https://webdocs.cs.ualberta.ca/~games/Sokoban/program.html Rolling Stone] || 1.0 || Andreas Junghanns || 32bit || 1 thread || [https://webdocs.cs.ualberta.ca/~games/Sokoban/Src/ RS] || [https://scholar.google.com/scholar?hl=de&as_sdt=0%2C5&q=rolling+stone+sokoban&btnG= Rolling Stone papers]

|}

Contact: SokobanoWiki@gmail.com

== XSokoban Test Suite ==

The XSokoban level set is the de facto standard test suite in the academic literature on Sokoban solver programming.

{| class="soko-table"
|-
! colspan="11" | Sokoban Solver Statistics - XSokoban Test Suite - Solved Levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" | Collection
| width="160" | Author
| width=" 70" | Levels
| width= "90" | [https://www.researchgate.net/publication/2305703_Pushing_the_Limits_New_Developments_in_Single-Agent_Search Rolling Stone]
| width= "80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width=" 80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]
| width=" 80" | [[JSoko Solver | JSoko]]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution ]
| width=" 80" | [https://festival-solver.site/curry/ Curry ]
| width=" 80" | [https://festival-solver.site/ Festival ]
| width=" 80" | [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch]




|- align="right"
| align="left" bgcolor="#f1efe5" | [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/ XSokoban]
| align="left" | Thinking Rabbit, ...
| 90
| [https://webdocs.cs.ualberta.ca/~games/Sokoban/program.html 59*]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Takaken%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/YASS%20-%20XSokoban.html 89]
| [[SolverStatistics-jsoko-ThinkingRabbit-XSokoban | 67 ]]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Sokolution%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Curry%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Festival%20-%20XSokoban.html '''90''']
| [https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/BoxSearch%20-%20XSokoban.html '''89''']

|}

*) 59 solved puzzles according to paper [https://sokoban.dk/wp-content/uploads/2016/02/Single-Agent.pdf Sokoban Enhancing general single-agent search methods using domain knowledge]

{| class="soko-table"
|-


! colspan="7" | Sokoban Solver Statistics - XSokoban Test Suite - Push-optimal Solutions
|- bgcolor="#f1efe5" align="center"
| width="115" align="left" | Collection
| width="160" | Author
| width=" 70" | Levels
| width=" 80" | [https://www.researchgate.net/publication/2305703_Pushing_the_Limits_New_Developments_in_Single-Agent_Search Rolling Stone]
| width=" 80" | [http://www.ijcai.org/Abstract/16/100 Pereira et al.]
| width=" 80" | [http://sourceforge.net/projects/jsokoapplet/ JSoko]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution ]


|- align="right"
| align="left" bgcolor="#f1efe5" | XSokoban
| align="left" | Thinking Rabbit, ...
| 90
| [https://webdocs.cs.ualberta.ca/~games/Sokoban/program.html 6 ]
| [[SolverStatistics-Pereira-ThinkingRabbit-XSokoban-Push-Optimal | 28 ]]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/JSoko%20-%20XSokoban.html 25]
| [https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/Sokolution%20-%20XSokoban.html '''73''']

|}

The statistic shows that Sokolution is by far the best solver when searching for push optimal solutions.

== Large Test Suite ==

The large test suite comprises level packs selected for being a challenge for the solvers, but not too difficult. The statistics shows the results for the leading Sokoban solver programs.

This test suite is not subject to change, as it is intended to be a "Large Standard Test Suite" for Sokoban solver programs.

{| class="soko-table"
|-
! colspan="7" | Sokoban Solver Statistics - Large Test Suite - Solved levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" |
| width=" 70" | Levels
| width= "80" | [https://festival-solver.site/ Festival ]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution]
| width=" 80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width=" 80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]
| width=" 80" | [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch]

|- bgcolor="#f1efe5" align="right"
| align="left" | Total levels
| 3272 
| '''3208''' 
| 3207 
| 2953 
| 2899 
| 2749 

|}

'''[https://sokoban-solver-statistics.sourceforge.io/statistics/LargeTestSuite/ Click here to see the detailed results for the Large Test Suite].'''

Download the entire test suite [https://sourceforge.net/projects/sokoban-solver-statistics/files/Large%20Test%20Suite.zip/download here] or the individual level sets from [http://sokobano.de/de/levels.php www.sokobano.de].

== Open Test Suite ==

The statistics shows the results for the leading Sokoban solvers for various level collections. Please note that the grand totals are simple summations. The number of solved unique levels may differ slightly due to duplicate levels in the level packs.

This test suite may be changed by adding new level collections from time to time.

{| class="soko-table"
|-
! colspan="7" | Sokoban Solver Statistics - Open Test Suite - Solved levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" |
| width=" 70" | Levels
| width= "80" | [https://festival-solver.site/ Festival]
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution]
| width=" 80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width=" 80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]
| width=" 80" | [https://notabdc.github.io/puzzle007/EngPage/e_solver.htm#BoxSearch BoxSearch]

|- bgcolor="#f1efe5" align="right"
| align="left" | Total levels
| 10043 
| '''9596''' 
| 9516 
| 8721 
| 8339 
| 8111 

|}

'''[https://sokoban-solver-statistics.sourceforge.io/statistics/OpenTestSuite/ Click here to see the detailed results for the Open Test Suite].'''

[https://sokoban-solver-statistics.sourceforge.io/statistics/Sokolution/ Comparison for the Open Test Suite for all Sokolution versions].

== Push-optimal Test Suite ==

The "Push-optimal Test Suite" comprises level packs selected for being a challenge for the solvers, but not too difficult. The statistics shows the results for the leading Sokoban solver programs.

For this test suite the solvers must solve the puzzles push optimal.

{| class="soko-table"
|-
! colspan="6" | Sokoban Solver Statistics - Large Test Suite - Solved levels


|- bgcolor="#f1efe5" align="center"
| width="115" align="left" |
| width=" 70" | Levels
| width=" 80" | [http://sokolution.infinityfreeapp.com/ Sokolution]

|- bgcolor="#f1efe5" align="right"
| align="left" | Total levels
| 1588 
| [https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/ '''1529'''] 
|}

'''[https://sokoban-solver-statistics.sourceforge.io/statistics/Push-OptimalTestSuite/ Click here to see the detailed results for the Push-Optimal Test Suite].'''

== GroupEffort Test Suite ==

The only reason for benchmarking the GroupEffort test suite is to demonstrate the limited veracity of the statement made in section "6 Conclusion" of the thesis, where the author writes that the GroupEffort solver "outperforms existing solvers".

The benchmarks show that this was only true for the cherry-picked small test set at the time the thesis was published, never for the presumably more representative large test set.

{| class="soko-table"
|-
! colspan="8" | Sokoban Solver Statistics - GroupEffort Test Suite - Solved Levels




|- bgcolor="#f1efe5" align="center" 
| width = "115" align="left" | Collection
| width = "80" | Levels
| width = "80" | [https://baldur.iti.kit.edu/theses/SokobanPortfolio.pdf GroupEffort]
| width = "80" | [https://festival-solver.site/ Festival]
| width = "80" | [http://sokolution.infinityfreeapp.com/ Sokolution]
| width = "80" | [https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]
| width = "80" | [https://sourceforge.net/projects/jsokoapplet/ JSoko]
| width = "80" | [https://sourceforge.net/projects/sokobanyasc/ YASS]




|- align="right"
| align="left" bgcolor="#f1efe5" | [[SolverStatistics-GroupEffort-Small-Set | Small Set]]
| 200
| 196 (a)(c)
| [[SolverStatistics-Festival-GroupEffort-Small-Set | '''200''' (b) ]]
| [[SolverStatistics-Sokolution-GroupEffort-Small-Set | '''200''' (a) ]]
| [[SolverStatistics-Takaken-GroupEffort-Small-Set | 192 (b) ]]
| [[SolverStatistics-JSoko-GroupEffort-Small-Set | 180 (b) ]]
| [[SolverStatistics-YASS-GroupEffort-Small-Set | 191 (b) ]]




|- align="right"
| align="left" bgcolor="#f1efe5"| [[SolverStatistics-GroupEffort-Large-Set | Large Set]]
| 2851
| 1566 (a)(c)
| [[SolverStatistics-Festival-GroupEffort-Large-Set | '''2766''' (b) ]]
| [[SolverStatistics-Sokolution-GroupEffort-Large-Set | 2471 (a) ]]
| [[SolverStatistics-Takaken-GroupEffort-Large-Set | 2462 (b) ]]
| [[SolverStatistics-JSoko-GroupEffort-Large-Set | 2165 (b) ]]
| [[SolverStatistics-YASS-GroupEffort-Large-Set | 2260 (b) ]]




|- align="right" bgcolor="#f1efe5" align="right"
| align="left"| Total
| 3051 
| 1762 
| '''2966''' 
| 2671 
| 2654 
| 2345 
| 2471 
|}

(a): Time limit: 5 minutes     (b): Time limit: 10 minutes     (c): Best GroupEffort solver configuration

== Disclaimer ==

Sokoban
=======
 
Sokoban (R) Registered Trademark of Falcon Co., Ltd., Japan
Sokoban Copyright (C) 1982-2004 by Hiroyuki Imabayashi, Japan
Sokoban Copyright (C) 1989, 1990, 2001-2004 by Falcon Co., Ltd., Japan
 
License
=======
 
Redistribution and use of the Sokoban Solver statistics are permitted
provided that the following conditions are met:
 
* Redistributions may not be sold, nor may they be used in a commercial product or activity.
* Redistributions must reproduce the entire content of this disclaimer in the documentation
and/or other materials provided with the distribution.
 
Credits (in no particular order)
================================
 
CosmoNotes, CosmoPoly, LOMA, MicroCosmos, MiniCosmos,
NaboCosmos and PicoCosmos level sets
Copyright (C) by Aymeric du Peloux.
E-mail: aymeric.du-peloux@gadz.org
Web site: unknown
 
dh1, dh2, bagatelle, cantrip, and maelstrom level sets
Copyright (C) by David Holland
E-mail: unknown
Web site: unknown
 
Microban, Mas Microban, Sasquatch, Mas Sasquatch, Sasquatch III,
Sasquatch IV, Sasquatch V, Sasquatch VI and Sasquatch VII level sets.
Copyright (C) by David W. Skinner
E-mail: sasquatch@bentonrea.com
Web site: unknown
 
Grigr2001, Grigr2002 and GrigrSpecial level sets
Copyright (C) by Evgeny Grigoriev (aka GRIGoRusha)
E-mail: grigr@yandex.ru
Web site: http://grigr.narod.ru/
 
SokEvo and SokHard level sets
Copyright (C) 2002-2006 by Lee J Haywood
E-mail: fruise@gmail.com
Web Site: http://leehaywood.org/games/sokoban/
 
Sven level set
Copyright (C) 2007 by Sven Egevad
E-mail: sven.egevad@telia.com
Web Site: unknown
 
Sokoban Perfect and Sokoban Revenge level sets
Copyright (C) 1989, 1991 by Thinking Rabbit
Web Site: https://sokoban.jp/
 
Y.M. Auto and Y.M. Handmade level sets
Copyright (C) Yoshio Murase
E-mail: yoshio@asahi.email.ne.jp
Web Site: http://www.ne.jp/asahi/ai/yoshio/sokoban/index.html
 
JSoko
Copyright (C) by Matthias Meger
E-mail: JSoko@mail.de
Web site: https://jsokoapplet.sourceforge.io/
 
Sokoban Automatic Solver (aka Takaken solver)
Copyright (C) 2002 - 200X Ken'ichiro Takahashi (aka takaken)
E-mail: takaken@ic-net.or.jp
Web site: https://computerpuzzle.net/english/sokoban/ver740/index.html
 
YASS - Yet Another Sokoban Solver and Optimizer - For Small Levels
Copyright (C) 2007 by Brian Damgaard
Web site: https://sourceforge.net/projects/sokobanyasc/
 
Sokoban YASC
Copyright (C) 2001-2020 by Brian Damgaard
Web Site: https://sourceforge.net/projects/sokobanyasc/
 
YSokoban
Copyright (C) 2007 by George Petrov
E-mail: YGP@WriteMe.com
Web Site: http://ygp.orgfree.com/sokoban.html
 
XSokoban
Copyright (C) by Andrew Myers
E-mail: andru@cs.cornell.edu
Web Site: http://www.cs.cornell.edu/andru/xsokoban.html
 
Sokofan
Copyright (C) 2005-2007 by Eric Leung
E-mail: eleung2@hotpop.com
Web Site: unknown
 
Sokolution
Copyright (C) 2016-2019 by Florent DIEDLER
E-mail: fdiedler2000@gmail.com
Web site: http://sokolution.infinityfreeapp.com/
 
Festival
Copyright (C) 2020 by Yaron Shoham
Web site: https://festival-solver.site/
 
Trademarks
==========
 
Company names, brand names and product names are trademarks
or registered trademarks of their respective holders.
 
Contact
=======
 
E-mail: sokobanowiki@gmail.com

How to play Sokoban

2025-04-24T09:52:26Z

Matthias Meger: /* Reverse play */ added reverse mode

This article explains how to play Sokoban. There are also simple strategies explained.

First let's have a look at the rules of the game:

The object of Sokoban is to take some objects (usually boxes) to designated locations by pushing them.

To do this the user moves a man who we call Sokoban. Sokoban can move up, down, left and right. He can't pass through walls or boxes. He can push only one box at a time (never pull). At any time a square can only be occupied by one of a wall, box or man.

A level contains these elements:
<code>
Walls: #
Boxes: $
Goals: .
Free squares: ' '
The Sokoban / the player: @
</code>

Boxes and the Sokoban can also be located on a goal.
<code>
Boxes on goals: *
The Sokoban on a goal: +
</code>

In the following the Sokoban is called "the player" to indicate that this is the object the user can move.

Movements:
Nearly all Sokoban games can be played using the arrow keys. Nowadays many programs also support playing with the mouse.
All moves of the Sokoban need only to be done for pushing a box.
<code>
Level 1
#########
#@ $ .#
#########
</code>
Using the arrow keys one has to press the "right arrow" 5 times.
Using the mouse you have to mark the box for pushing (by clicking on it) and then clicking at the position the box is to be pushed to.

<code>
Level 2
########
# ###
#@$ ###
#### ###
## ###
## ##
# ##. #
# #
##### #
########
</code>

Here the difference between playing with keyboard and playing with mouse is demonstrated. Using the mouse is as simple as in Level 1. Using the arrow keys needs a lot of key presses for pushing the box to the goal.
Hence, it's always recommended to use the mouse for playing. The advantages compared to keyboard playing are:
# With two clicks a box can be pushed to every possible square
# Most programs automatically calculates the best moves for the player. Hence the user doesn't have to think about how to move the player by keys.
# Some programs even show the squares a box can be pushed to. In this way it's easy to see if a box can be pushed to the selected position.
# The user can concentrate on pushes only instead of moves and pushes

Levels containing only one box are very simple to solve using the mouse: One just has to mark the box for pushing and then to choose the goal square as target.

Usually Sokoban levels are a lot more complicated.

Let's increase the difficulty step by step:
<code>
Level 3
########
# #
# $ .#
#@ $ .#
# $ .#
# #
########
</code>
Here the level contains 3 boxes. Nevertheless the level can easily be solved. Although every box can be pushed to each goal it doesn't matter which box is pushed to which goal. The boxes can just be pushed one after the other to any goal.

<code>
Level 4
########
# #. #
# $# #
# # @##
# # $##
# .##
########
</code>
This level is more complicated. The box under the player is close to a goal. Nevertheless it can't be pushed to the goal - this would result in a [[Deadlocks|deadlock]]. This level shows some problems one has to solve before it's possible to finish the level:
# Not every box can be pushed to every goal
# Boxes can't just be pushed to the nearest goal in every case
# Box pushes can create a [[Deadlocks|deadlock]]

<code>
Level 5
#########
## # #
#.$. $ #
# # ## #
# @$.$. #
#########
</code>

To solve this level the boxes have to be pushed to their goals in a specific order. Moreover one box has to be pushed away from its goal before it can be pushed to it.

<code>
Level 6
#########
# # .#
#@$ $ #
# $ ##..#
# #####
#########
</code>

This level is another example of the need to push a box away from its goal before the level can be solved. Additionally one box has to be "parked" until some other boxes have reached their goals. A situation where a box must be pushed but can't be pushed immediately to its goal occurs very often in Sokoban levels. Some of them are "parking" situations.
"Parking" means:
# a box must be pushed away from its goal
# after the box is pushed to its parking position another box has to be pushed
# parking the box at a specific position is required to solve the level

== Reverse play ==

Some Sokoban programs allow to play a puzzle backward.

Starting with all boxes on goal squares, the player pulls the boxes to return to the initial puzzle state.

Solutions found this way solve the standard puzzle when both the order and the direction of the moves are reversed.

This approach can help players better understand the puzzle structure and develop effective solving strategies.

Scientific research

2024-11-12T15:28:51Z

Matthias Meger: clarification that the challenge is due to TWO main factors: Large search tree AND the difficulty of finding a suitable heuristic for all puzzles.

==Scientific research==

Sokoban has been studied using the theory of computational complexity.

The computational problem of solving Sokoban puzzles was first shown to be [https://en.wikipedia.org/wiki/NP-hardness NP-hard]. Further work proved it is also [https://en.wikipedia.org/wiki/PSPACE-complete PSPACE-complete].

Sokoban puzzles are challenging for computers to solve because they require complex decision-making.

The two main factors that explain this difficulty:

* Exponentially growing search space: In Sokoban, there are usually multiple boxes, each with numerous possible moves. This causes the number of possible states to grow exponentially, making it challenging to find a solution within a reasonable time.

* Heuristic challenges: Given the vast search space, good heuristics are necessary for efficient problem-solving. However, it's challenging to develop a general heuristic that works well in all situations.

The Sokoban game provides a challenging testbed for developing and evaluating planning techniques.

The first documented automated solver was [[Rolling Stone solver | Rolling Stone]], developed at the University of Alberta.

Its core principles laid the groundwork for many newer solvers.
It employed a conventional search algorithm enhanced with domain-specific knowledge.

[https://festival-solver.site/ Festival], utilizing its FESS algorithm, was the first automatic solver to complete all 90 puzzles in the widely used XSokoban test suite ([https://sokoban-solver-statistics.sourceforge.io/statistics/OpenTestSuite/Festival%20-%20XSokoban.html Festival results]).

However, even the best automated solvers cannot solve many of the more challenging puzzles that humans can solve with time and effort.

Feature list : Duplicate Finder

2024-07-17T19:50:21Z

Matthias Meger: /* Additional Tools : Duplicate Finder */ removed old programs

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Additional Tools : Duplicate Finder ==
{{LastREVISIONTIME}}




{| class="soko-table"
! colspan="6" | Additional Tools : Duplicate Finder !!
|- {{programs|3= |4= |6= }}
| {{tc}} | duplicate finder || built-in ||{{ni}} {{tip|(Alternatively has the feature '''duplicate levels exchange solutions''')|text=note|menu=yes}} || || || external utility
|-
| {{tc}} | search type || {{yes}} equal and similar levels. type: rotated and mirrored, dead squares removal, normalized walls, normalized pusher position. || || || || {{yes}} equal and similar levels. type: rotated and mirrored, dead squares removal, normalized walls, normalized pusher position.
|-
| {{tc}} | relaxed match options || {{yes}}{{tip|* with/without boxes * with/without goals * with/without interior walls * with/without exterior walls}} || || || || {{yes}}{{tip|* targets only, with optional threshold count * without pusher and boxes * walls only * without internal walls * floors only}}
|-
| {{tc}} | search current level duplicates || {{yes}} || || || || {{no}}
|-
| {{tc}} | duplicate levels preview || {{yes}} || || || || {{no}}
|-
| {{tc}} | search history || {{tip|a persistent user maintained "scanned folders" list is available|text=note}} || || || || {{no}}
|-
| {{tc}} | export report duplicates ||{{yes}}|| || || ||{{yes}}
|-
| {{tc}} | duplicate levels exchange solutions || {{yes}} {{tip| normalized levels exchange solutions, i.e., an exact match is not required.}} || {{yes}} {{tip|identical levels automatically exchange their solutions}} || || || {{yes}}
|}
[[#top|Top]]

<noinclude>

==Info==
=== Related pages ===

* [[Pruning_duplicate_positions|Pruning duplicate positions]]

[[#top|Top]]
</noinclude>

Feature list : Optimizer

2024-07-17T19:37:36Z

Matthias Meger: /* Additional Tools : Optimizer */ correct format as good as I can

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Additional Tools : Optimizer ==
{{LastREVISIONTIME}}




{| class="soko-table feature-list"
! colspan="6" | Additional Tools - Optimizer !!
|- {{programs|2= |4= |5= |6= }}
| {{tc}} | optimizer || common optimizer plugins || || built-in
|-
| {{tc}} | optimizer running mode || background, allowing continued game play || || foreground, allowing continued game play
|-
| {{tc}} | optimization options (e.g., move-optimal, push-optimal) || optimization settings and options depend on the plugins, not the host program || || pushes/moves, moves/pushes, box changes, box lines
|-
| {{tc}} | task queue || {{yes}} || || {{no}}
|}
[[#top|Top]]

<noinclude>

==Info==
===Related pages===
[[Optimizer|Optimizer_Development]]

[[#top|Top]]
</noinclude>

Feature list : Solver

2024-07-17T19:33:49Z

Matthias Meger:

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Additional Tools : Solver ==
{{LastREVISIONTIME}}




{| class="soko-table feature-list"
! colspan="5" | Additional Tools - Solver
|- {{programs|4=<div>[http://www.ic-net.or.jp/home/takaken/e/soko/index.html Takaken]</div>|5= |6= }}
| {{tc}} | solver || common solver plugins || common solver plugins || built-in || built-in
|-
| {{tc}} | solver running mode || background, allowing continued game play || foreground, blocking game play || foreground, blocking game play || foreground, blocking game play
|-
| {{tc}} | solution types (e.g., any, move-optimal, push-optimal) || solver strategies and options depend on the plugins, not the host program || solver strategies and options depend on the plugins, not the host program || push-optimal, push-optimal with best moves, move-optimal with best pushes || move-optimal, push-optimal
|-
| {{tc}} | task queue || {{yes}} || {{no}} || {{no}} || {{no}}
|}
[[#top|Top]]

<noinclude>

==Info==
===Related Pages===
[[Solver|Solver]]

[[#top|Top]]
</noinclude>

Feature list : Level Editor

2024-07-17T19:23:53Z

Matthias Meger: /* Additional Tools : Level Editor */ correct format

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Additional Tools : Level Editor ==
{{LastREVISIONTIME}}




{| class="soko-table feature-list"
! colspan="6" | Additional Tools - Level Editor !!
|- {{programs|5= |6= }}
| {{tc}} | editor || built-in || built-in || built-in || built-in
|-
| {{tc}} | drawing objects || wall, box, goal, player || none, floor, goal, box-on-floor, box-on-goal, player-on-floor, player-on-goal, wall || wall, box, goal, player, floor || floor, goal, box, wall
|-
| {{tc}} | drawing tools || objects, eraser, rubber-band, fill || objects, pencil, drop, fill, line, rectangle, filled rectangle || objects || objects, move player, move box
|-
| {{tc}} | drawing logic || select object + click-and-drag the board to put objects on the board || select object + select drawing tool + click-and-drag the board to put objects on the board || select object + click-and-drag the board to put objects on the board || select object + click-and-drag the board to put objects on the board
|-
| {{tc}} | drawing logic inconveniences || the board jumps around on the screen when automatic scaling and positioning kick in || drawing with tools like lines and rectangles don't show the objects on the screen during the drawing process || the board jumps around on the screen when automatic scaling and positioning kick in || The "move" tool works for boxes and the player only, not for goals
|-
| {{tc}} | savegames and solutions for modified levels are retained after cosmetic changes (e.g., transformations and adding/removing extra floors/walls) || {{yes}} || {{no}} the savegames and solutions are still there in the files, but they are not applicable to the modified level || {{no}} || <big style="color: red;background:beige;">?</big> {{tip|will somebody with a full version check if it is "yes" or "no"|text=help}}
|-
| {{tc}} | undo || {{yes}} unlimited || {{yes}} unlimited || {{no}} || {{yes}} unlimited
|-
| {{tc}} | redo || {{yes}} unlimited || {{yes}} unlimited || {{no}} || {{no}}
|-
| {{tc}} | undo/redo logic || one complete transaction at a time || one complete transaction at a time || || one cell at a time
|-
| {{tc}} | undo/redo history is saved from one session to the next || {{yes}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | undo/redo multiple transactions: interface || pull-down menu: 1,2,4,8,... transactions || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | undo/redo multiple transactions: preview || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | "rubber-band" area selection || {{yes}}(features: move, copy, paste, delete, transform, fill) || {{no}} || {{no}} || {{no}}
|- {{programs|5= |6= }}
| {{tc}} | board transformations || {{yes}} rotate counter-clockwise and clockwise, flip vertically and horizontally. || {{yes}} rotate clockwise, flip vertically || {{yes}} rotate counter-clockwise and clockwise, flip vertically and horizontally || {{yes}} rotate counter-clockwise and clockwise, flip vertically and horizontally
|-
| {{tc}} | resize board || {{un}} {{tip|the board is automatically positioned so it's possible to draw on all 4 sides}} || {{yes}} (via toolbar button: resize level) || {{un}} {{tip|the board is automatically positioned so it's possible to draw on all 4 sides}} || {{un}} {{tip|"move board" does not clip the level to a predefined size like, e.g., Sokoban++ does}}
|-
| {{tc}} | move board || {{un}} || {{yes}} || {{un}} || {{yes}}
|-
| {{tc}} | one-click switching between play/edit mode || {{yes}} || {{no}} use menu: game->mode || {{no}} || {{yes}} {{tip|partial implementation: no visible button but a keyboard shortcut "Alt+P"|text=partial}}
|-
| {{tc}} | board validation on switching from edit mode to play mode || {{yes}} || {{no}} all boards are playable || {{yes}} || <big style="color:red;background:beige">?</big>{{tip|will somebody with a full version check if it happens automatically|text=help}}
|-
| {{tc}} | customizable skin || {{yes}} format: simple image-based skins without seamless walls || {{yes}} same skin in edit mode and in play mode || {{yes}} same skin in edit mode and in play mode || {{yes}} same skin in edit mode and in play mode
|-
| {{tc}} | customizable button images || {{yes}} || {{no}} || {{yes}} || {{un}} {{tip|the editor uses menus and has no buttons}}
|-
| {{tc}} | button images automatically synchronized with skin images || {{no}} || {{no}} || {{yes}} || {{un}}
|-
| {{tc}} | windows clipboard copy/paste || {{yes}} || {{yes}} {{tip|partial implementation: imports / exports complete levels instead of copying / pasting sections to the existing "document", i.e., the board|text=partial}} || {{no}} || <big style="color: red;background:beige;">?</big> {{tip|(will somebody with a full version check if it works here; the demo version has it on the menu in the editor and it does not mention any restrictions, but it does not work)|width=260px|text=help}}
|-
| {{tc}} | internal clipboard with multiple items || {{yes}} unlimited, persistent, with preview || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | edit board as text || {{no}} || {{no}} || {{no}} || {{no}}
|}
[[#top|Top]]

Template:Programs

2024-07-17T19:23:12Z

Matthias Meger:

class="soko-table-title feature-title"
| <div style="width:120px;"> </div> || {{{1|<div>[http://sourceforge.net/projects/sokobanyasc/ Sokoban YASC]</div>}}} || {{{2|<div>[http://www.joriswit.nl/sokoban/ Sokoban++]</div>}}} || {{{3|<div>[http://www.sokoban-online.de JSoko]</div>}}} || {{{4|<div>[http://www.sourcecode.se/sokoban/ Sokoban for Windows]</div>}}} || {{{5|<div>[http://ygp.orgfree.com/sokoban.html YSokoban]</div>}}} || {{{6|<div>[http://www.sokosave.org/ SokoSave Desktop]</div>}}}
|-

Feature list : Additional Tools

2024-07-17T18:58:43Z

Matthias Meger: /* Additional Tools */ removed column

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Additional Tools ==
{{LastREVISIONTIME}}




{| class="soko-table"
! colspan="6" | Additional Tools !! colspan="50" | <div align="right">Additional Tools</div>
|- {{programs}}
| {{tc}} | level editor ([[Feature_list_:_Level_Editor|see details below]]) || {{yes}} || {{yes}} || {{yes}} || {{yes}} ||{{no}} || {{no}}
|-
| {{tc}} | solver ([[Feature_list_:_Solver|see details below]]) || {{yes}} common solver plugins (allowing continued game play) || {{yes}} common solver plugins (blocking game play) || {{yes}} built-in (blocking game play) || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | optimizer ([[Feature_list_:_Solver#Additional_Tools_:_Optimizer|see details below]]) || {{yes}} common optimizer plugins (allowing continued game play) || {{no}} || {{yes}} built-in (blocking game play) || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | locate and browse duplicates or look-alikes ([[Feature_list_:_Duplicate_Finder|see details below]]) || {{yes}} || {{no}} || {{no}} || {{no}} || {{no}} external program [http://geocities.com/ygp_bg/sokodup.zip Soko-Dup] can be downloaded || {{no}}
|-
| {{tc}} | skin graphics editor || {{no}} skin script editor available || {{no}} skin script editor available || {{no}} || {{yes}} || {{no}} || {{no}}
|-
| {{tc}} | level generator || {{yes}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | optimizer for unnecessary moves between pushes || {{yes}} automatically during game-play || {{yes}} manually via menu || {{yes}} automatically during game-play || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | level file converters || {{yes}} {{tip|SokoMind (including solutions), Sokoban for Windows by Björn Källmark (including solutions), Sokofan (including solutions)|width=250px|text=file types}} || {{yes}} {{tip|ASCII (*.txt, *.xsb, *.screen, *.skm, *.scb), Sokoban (*.sls), Visual Sokoban 1 and 2 (*.pak), WinSoko (*.rdf), Games 4 Brains (*.lp0), Mark McIntyres Soko (*.sok), XML Sokoban (*.xml), Sokoban XP (*.sxl), Games 4 Brains Sokoblue (*.dat), Icons (*.ico), Björn Källmark's xml format (*.slc)|width=270px|text=file types}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | image snapshot capture || {{no}} || {{yes}} miniature level bitmap with 1 pixel per square; via menu: level->copy level || {{no}} || {{no}} || {{no}} || {{no}}
|- {{programs}}
|}
[[#top|Top]]

Feature list : Miscellaneous

2024-07-17T18:57:50Z

Matthias Meger: /* Miscellaneous */ removed column

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Miscellaneous ==
{{LastREVISIONTIME}}




{| class="soko-table feature-list"
! colspan="6" | Miscellaneous !! colspan="50" | <div align="right">Miscellaneous</div>
|- {{programs}}
| {{tc}} | builtin help and program information || {{yes}} rich text document (rtf) || {{yes}} html pages (html) || {{yes}} Java help || {{yes}} html pages (htm) || {{yes}} ascii text document || {{yes}} html page (html)
|-
| {{tc}} | context sensitive help || {{no}} || {{yes}} || {{yes}} {{tip|Pressing the help key (F1) opens the help}} || {{no}} {{tip|however, the web-page says otherwise|text=note}} || {{no}} || {{no}}
|-
| {{tc}} | customizable language || {{no}} || {{yes}} || {{yes}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | languages || English || English, Afrikaans, Danish (embarrassing), Dutch, German, Greek, Finnish, French, Italian, Polish, Portugese, Russian, Spanish (Spain, Argentina), Turkish, Slovenian, Swedish || English, German, Chinese (Simplified), Spanish, Dutch || English || English, Bulgarian, Chinese (Simplified, Traditional), German, Spanish || English
|-
| {{tc}} | builtin solutions || {{yes}} {{tip|all levels ship with builtin solutions}} || {{yes}} {{tip|not all levels ship with builtin solutions}} || {{yes}} {{tip|not all levels ship with builtin solutions}} || {{yes}} {{tip|not all levels ship with builtin solutions}} || {{no}} || {{no}}
|-
| {{tc}} | file type associations (optional) || {{no}} || {{yes}} .sls, .pak, .rdf, .lp0, .xsb, .sok, .sxl, .slc || {{no}} || {{no}} || {{no}} || {{yes}} .sokomaze, .xsb, .sokohex, .hsb, .sokotri, .tsb, .sokosave Windows, Mac OS X
|-
| {{tc}} | accessibility for portable version || {{no}} || {{no}} || {{no}} || {{no}} || {{yes}}{{tip|compatible installation: yes system modification: no generated data: saves the files created in the removable device. additional: edition for mobile phone, java MIDP 2.0 only.|width=200px}} || {{no}}
|- {{programs}}
|}
[[#top|Top]]

<noinclude>

==Info==
===Portable software===
''From Wikipedia, the free encyclopedia'' 

To be considered '''truly portable''', a software program must: 
<ul>
<li>Not require any form of formal installation to be carried out on any computer before it can be used, with the release package only needing to be decompressed directly to removable media before use (if it has to be installed first, and requires it's files to be manually copied to removable media, it's clearly not designed to be portable!). For example, software which is supplied as an InstallShield package could not be considered portable, though a ZIP archives containing an executable would be.</li>
<li>Settings are stored with, and can be carried around with, the software (i.e. they are written to the USB drive). If the registry is used to store settings; the application's configuration isn't portable, and must be set up on every PC it is used on</li>
<li>Leaves a zero (or near-zero) "footprint" on any PC it's run on after being used. i.e. All temporary files/registry settings should be removed once the program has exited, and files created by the user can be saved directly to the same removable media as the application is stored on.</li>
</ul>
Generally, smaller utility/toolkit software is inherently fairly portable; though larger applications are sometimes changed in order to allow a portable versions to be released (e.g. FirefoxPortable)

</noinclude>

Feature list : Multi-player Mode

2024-07-17T18:57:18Z

Matthias Meger: /* Multi-player Mode */ emoved column

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Multi-player Mode ==
{{LastREVISIONTIME}}




{| class="soko-table feature-list"
! colspan="6" | Multi-player Mode !! colspan="50" | <div align="right">Multi-player Mode</div>
|- {{programs}}
| {{tc}} | [[Feature_list_:_Multi-player_Mode#Multi-player|multi-player]] || {{no}} || {{yes}}(options: create new player, change player) || {{no}} || {{yes}}(options: create new player, change player) || {{yes}}(options: create new player, change player) || {{no}}
|-
| {{tc}} | edit player information (e.g. name, email, country) || {{no}} || {{no}} || {{no}} || || {{no}} || {{yes}} {{tip|only when recording high score}}
|-
| {{tc}} | display personal high-scores || {{yes}} {{tip|cramped implementation and disabled by default. Enable it in "open" window via menu -> show solutions}} || {{yes}} via menu: level -> choose || {{no}} || {{yes}} via menu: view -> scores and solutions || {{yes}} drop-down list || {{yes}} via menu: help -> scores
|-
| {{tc}} | compare high-scores of all the players || {{ni|/a|Not applicable to single-player programs.}} || {{yes}} general and personal scores || {{ni|/a|Not applicable to single-player programs.}} || {{yes}}ranking with all the players || {{no}} || {{ni|/a|Not applicable to single-player programs.}}
|-
| {{tc}} | save and restore the player profiles (e.g. high-scores, settings) || {{ni|/a|Not applicable to single-player programs.}} || {{yes}} player position file (*.sav) || {{ni|/a|Not applicable to single-player programs.}} || ||{{yes}} player info file (*.SokoInfo) || {{ni|/a|Not applicable to single-player programs.}}
|-
| {{tc}} | remember each player's session (e.g. level, skin, quicksaves) {{tip|not to be confused with a single player program's ability to do the same. Feature implemented in Sokonline.|text=note}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|- {{programs}}
|}
[[#top|Top]]

<noinclude>

<h2>Info</h2>
=== Multi-player ===

This modality is useful for the competitions, each user can have his own configurations. As the personalization, with their scores, personal information, as the option of sending their solutions via e-mail.

These are options for the soko-programs that point, to give the option for competitive players that participate in the challenges of internet.

'''Related programs''' 
[http://sokoban.online.fr/mon_player.html Sokonline]

[[#top|Top]]
</noinclude>

Feature list : Web-based Support

2024-07-17T18:56:24Z

Matthias Meger: /* Web-based Support */ removed column

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Web-based Support ==



{| class="soko-table feature-list"
! colspan="6" | Web-based Support !! colspan="50" | <div align="right">Web-based Support</div>
|- {{programs}}
| {{tc}} | website || [http://sourceforge.net/projects/sokobanyasc/ official website] || [http://www.joriswit.nl/sokoban/ official website]|| [http://www.sokoban-online.de official website] || [http://www.sourcecode.se/sokoban/ official website] || [http://ygp.orgfree.com/sokoban.html official website] || [http://www.sokosave.org/ official website]
|-
| {{tc}} | forum || {{ni}} || {{ni}} || {{ni}} || [http://www.sourcecode.se/sokoban/forum official forum] || {{ni}} || [http://www.high-speed-software.com/sokosave/forum/ official forum]
|-
| {{tc}} | additional level packs || {{un}} {{tip|practically all text-based levels for download are supported}} || {{un}} {{tip|practically all text-based levels for download are supported}} || {{un}} {{tip|practically all text-based levels for download are supported}} || {{yes}}(.slc files) || {{un}} {{tip|practically all text-based levels for download are supported)}} || {{un}} {{tip|practically all text-based single-level files for download are supported)}}
|-
| {{tc}} | additional solutions || {{no}} || {{yes}} || {{no}} || || {{yes}}[http://ysokoban.atspace.com/ ysokoban solutions] || {{no}}
|-
| {{tc}} | additional skin packs || {{un}} {{tip|all major skin formats for download are supported}} || {{yes}} || {{no}} || {{no}} {{tip|all available skins ship with the program}} || {{yes}} || {{no}}
|-
| {{tc}} | additional add-ons || {{yes}} utilities || {{yes}}language packs, solver-plugins, utilities || {{no}} || || {{yes}} utilities || {{yes}} utilities
|-
| {{tc}} | automatic update || {{no}} || {{no}} || {{yes}} automatic check for updates || {{yes}} || {{no}} || {{no}}
|-
| {{tc}} | option to jump to the official website || {{yes}} || {{yes}} || {{no}} || {{yes}} || {{no}} || {{yes}}
|}
[[#top|Top]]

Feature list : Moves Management

2024-07-17T18:55:45Z

Matthias Meger: /* Moves Management */ removed column

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Moves Management ==
{{LastREVISIONTIME}}




{| class="soko-table feature-list"
! colspan="6" | Moves Management !! colspan="50" | <div align="right">Moves Management</div>
|- {{programs}}
| {{tc}} | copy/paste moves (normal) || {{yes}} || {{yes}} || {{yes}} || {{yes}} {{tip|partial implementation: solutions only, not savegames flaw: imported solutions are lost when the program exits flaw: imported moves are listed as solutions even if this is not the case|width=200px}} || {{yes}} || {{no}}
|-
| {{tc}} | copy/paste moves (run-length-encoded) || {{yes}} || {{yes}} partial: paste only || {{yes}} || {{no}} || {{yes}} || {{no}}
|-
| {{tc}} | copy moves after the current position || {{yes}}via keyboard: Ctrl+B || {{yes}}via menu: position -> copy || {{yes}} Ctrl+Shift+M || {{no}} || {{yes}}via keyboard: Ctrl+Alt+C || {{no}}
|-
| {{tc}} | paste moves as continuation of current position || {{yes}} || {{yes}} || {{yes}} || {{no}} || {{yes}} || {{no}}
|-
| {{tc}} | rotate and/or flip moves || {{no}}{{tip|board rotations and flips automatically synchronize existing savegames and solutions}} || {{no}} external program [http://www.joriswit.nl/sokoban/junk/solutionrotator.zip Solution Rotator] can be downloaded || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | edit move information (e.g, title, author, comment) || {{yes}}via snapshot window || {{yes}}via menu: position->save; properties: title || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | recreate maps from solutions || {{yes}} multiple solutions, with titles and info || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | load and save moves || sok (ascii text file, levels); clipboard: import/export || xht,txt (ascii text file, solutions), mov (sokofun movie); clipboard: import/export || sok (ascii text file, levels); clipboard: import/export || gam (xml text file, level); clipboard: import/export || txt (ascii text file, levels); clipboard: import/export || sokosave (savegame file)
|- {{programs}}
|}
[[#top|Top]]

<noinclude>

== Related pages ==
* [[Solution_format]] (German language)

== SokRFI - Sokoban Requests for Implementation ==


{| class="soko-table"
|-
! colspan="50" | Moves Management : SokRFI - Sokoban Requests for Implementation
|-
| width="120" {{tc}} | Feature || {{tc}} | Description
|-
|{{tc}}| animation snapshots capture: solutions || Sokoban++ offers a utility for this feature. (External program [http://www.joriswit.nl/sokoban/junk/ Sokoban Animator] can be downloaded)
|-
|{{tc}}| export solution as animation || Free formats: 
Text file:
:Scalable Vector Graphics ([http://www.w3.org/Graphics/SVG/ SVG]).
:Implementation with a [http://www.treebuilder.de/svg/sokoban/sokobano.svg template SVG].
Image file:
:Animated PNG ([http://wiki.mozilla.org/APNG_Specification APNG]) available with Firefox 3.
:[http://easysok.sourceforge.net EasySok] as alternative can save all the snapshots in a movie MNG.
|}
[[#top|Top]]
</noinclude>

Feature list : Level Management

2024-07-17T18:55:07Z

Matthias Meger: /* Level Management */ removed column

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Level Management ==
{{LastREVISIONTIME}}




{| class="soko-table feature-list"
! colspan="6" | Level Management !! colspan="50" | <div align="right">Level Management</div>
|- {{programs}}
| {{tc}} | copy/paste level(s) (normal) || {{yes}} || {{yes}}{{tip|partial implementation of import: one level at a time; works for raw boards without meta data only}} || {{yes}}{{tip|levels can also be pasted by using drag&drop of a level file}} || <big style="color: red;">?</big>{{tip|Will somebody with a full version check if it works here the demo version has it on the menu in the editor and it does not mention any restrictions, but it does not work|text=Help}} || {{yes}} {{tip|flaw: pasted levels are not saved|text=flaw}} || {{no}}
|-
| {{tc}} | copy/paste levels (run-length-encoded) || {{yes}} || {{no}} || {{yes}} || {{no}} || {{yes}} {{tip|flaw: pasted levels are not saved |text=flaw}} || {{no}}
|-
| {{tc}} | copy map (current state) || {{yes}}via [ CTRL + click "tools"] and editor || {{yes}} || {{yes}} || {{no}} || {{yes}} || {{no}}
|-
| {{tc}} | copy level(s) with solution(s) || {{yes}}(multiple) || {{no}} || {{yes}}(single) || {{no}} || {{yes}}(single) || {{no}}
|-
| {{tc}} | paste level(s) with solution(s) || {{yes}}(multiple) || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | edit level information (e.g., title, author) || {{yes}} via "open" window || {{yes}} via menu: level->about; properties: title, author, comment || {{no}} || {{yes}} via menu: file->edit mode + file->attributes; properties:title, description, copyright, email, website || {{no}} || {{no}}
|-
| {{tc}} | edit levelset information (e.g., title, copyright) || {{no}} || {{yes}} via menu: levelset->about; properties: title, author, copyright, comment || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | load multiple files || {{no}} || {{yes}} || {{no}} || {{un}} {{tip|with all loaded levelsets in a list it is just as easy to browse the whole list}} || {{un}} {{tip|with all loaded levelsets in a list it is just as easy to browse the whole list}} || {{yes}}
|-
| {{tc}} | merge level files || {{yes}} (merge is a feature in the "open" window: menu -> file conversion...) || {{yes}}(via: open and select multiple files.) || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | recent levels history || {{yes}} 25 items {{tip|holding a unified recent file history for all loaded file-types, e.g., levels and background images}} || {{no}} || {{un}} {{tip|with all loaded levelsets in a list it is just as easy to browse the whole list}} || {{un}} {{tip|with all loaded levelsets in a list it is just as easy to browse the whole list}} || {{un}} {{tip|with all loaded levelsets in a list it is just as easy to browse the whole list}} || {{no}}
|-
| {{tc}} | saves levels with format || {{yes}} sok (.sok) || {{yes}} sok (.sok), xsokoban (.txt, .xsb), games 4 brains (.lp0), xml text file (.sls) || {{yes}} sok (.sok) || {{yes}} xml text file (.sls) || {{no}} || {{yes}} savegame text file (.sokosave)
|-
! colspan="6" | Level Management : Import and Export for Internet !! colspan="50" | <div align="right">Level Management : Import and Export for Internet</div>
|- {{programs}}
| {{tc}} | import levels with hyphens "-" or underscores "_" || {{yes}} via clipboard and load level || {{yes}} via clipboard and load level || {{yes}} via clipboard and load level || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | export levels with hyphens "-" or underscores "_" || {{yes}}via clipboard || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | stripping leading ">" characters || {{yes}} (all leading ">" characters are stripped) || {{no}} || {{yes}} (stripping leading ">" characters: boards, not moves) || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | accepts alternative characters for boards || {{yes}}characters: p,P,b,B,o || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|}
[[#top|Top]]

<noinclude>

== Related pages ==
* [[Level_format]]

== SokRFI - Sokoban Requests for Implementation ==


{| class="soko-table feature-list"
|-
! colspan="50" | Level Management : SokRFI - Sokoban Requests for Implementation
|-
| width="120" {{tc}} | Feature || {{tc}} | Description
|-
|{{tc}}| split levelset || SokoSave offers a utility for this feature. (External program [http://www.high-speed-software.com/sokosave/sokosavedesktop/sokosplit/ SokoSplit] can be downloaded)
|-
|{{tc}}| export levels to internet ||
 Export levels to internet 

This feature can be used to publish level(s) in a web-site. 

The export can have different variants: 
<ul>
<li>Generating the strings with code HTML. 
With links to download levels or thumbnails of each level.</li>
<li>Generating the strings with code [http://web.singnet.com.sg/~fclim/sbml/index.html SBML] (SokoBan Markup Language). 
Exporting with this language, levels can be customized by the user for the graphic representation of the maps, as well as provide a meta-information semantics of each level.
</li>
</ul>

<hr>Alternative development 
See [[SokRFI - Export Levels to Internet]].

<hr>Utility Sokoban++ offers a utility for this feature. (External program [http://www.joriswit.nl/sokoban/junk/ Sokoban Website Generator] can be downloaded) 

|}
[[#top|Top]]
</noinclude>

Feature list : Map Viewing

2024-07-17T18:52:24Z

Matthias Meger: /* Map Viewing */ removed column

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Map Viewing ==
{{LastREVISIONTIME}}




{| class="soko-table"
! colspan="6" | Map Viewing !! colspan="50" | <div align="right">Map Viewing</div>
|- {{programs}}
| {{tc}} | level browser with preview || {{yes}} one level at a time || {{yes}} block graphic miniatures of all loaded levels || {{yes}} block graphic miniatures of all loaded levels || {{yes}} block graphic miniatures of all levels in a collection (customizable miniature size) || {{no}} || {{no}}
|-
| {{tc}} | resize skin to fit window || {{yes}} always || {{yes}}skin dependent || {{yes}} always || {{yes}} {{tip|flaw: Windows has 2 font settings, small (default) and large, and this only works for small fonts|text=flaw}} || {{yes}} || {{no}}
|-
| {{tc}} | resize window to fit map || {{un}} {{tip|map always fits in window}} || {{no}} || {{un}} {{tip|map always fits in window}} || {{yes}} {{tip|flaw: Windows has 2 font settings, small (default) and large, and this only works for small fonts|text=flaw}} || {{yes}} optional || {{yes}} always
|-
| {{tc}} | [[Feature_list_:_Map_Viewing#Level_scrolling|levels larger than window: scrolling]] || {{un}} || {{no}} || {{un}} || {{yes}} via scrollbars. {{tip| Windows has 2 font settings, small (default) and large, and this only works for small fonts|text=flaw}} || {{yes}} {{tip|via scrollbars with an option to autofollow (move scrollbars automatically)}} || {{un}}
|-
| {{tc}} | one-click browse levels || {{yes}} previous, next {{tip|in all level files in current level directory, with wrap-around}} || {{yes}} previous, next {{tip|in currently loaded levels, without wrap-around}} || {{yes}} previous, next {{tip|in current collection, with wrap-around}} || {{yes}} previous, next {{tip|in all loaded level files, with wrap-around}} || {{yes}} {{tip| implementation: keyboard shortcuts for: previous, next, first, last (in current collection, without wrap-around)|text=partial}} || {{yes}} next, without wrap-around
|-
| {{tc}} | one-click browse files || {{no}} || {{no}} || {{no}} || {{yes}} drop-down list with all level collections || {{yes}} drop-down list with visited level collections || {{no}}
|-
| {{tc}} | search for unsolved level || {{yes}} previous, next {{tip|in all level files in current level directory, with wrap-around}} || {{yes}} previous, next, random {{tip|in currently loaded levels, without wrap-around}} || {{yes}} previous, next {{tip|in current collection, with wrap-around}} || {{yes}} {{tip|partial implementation: auto-advance after having solved a level finds an unsolved level if settings is "unsolved levels only"|text=partial}} || {{yes}} previous, next {{tip|in current collection, without wrap-around}} || {{no}}
|-
| {{tc}} | rotate and mirror level-map || {{yes}} persistent, with reset option {{tip|savegames and solutions are automatically synchronized with current transformation}} || {{yes}} session (partial implementation: use editor) {{tip|savegames and solutions are specific to each transformation}} || {{yes}} session, with reset option {{tip|savegames and solutions are automatically synchronized with current transformation}} || {{yes}} <big style="color: red;">?</big>{{tip|Will somebody with a full version check if it is session, with reset option or persistent, with reset option additionally check if savegames and solutions are automatically synchronized with current transformation or savegames and solutions are specific to each transformation|width=300px|text=Help}} || {{yes}} session, with reset option {{tip|savegames and solutions are automatically synchronized with current transformation}} || {{no}}
|-
| {{tc}} | multiple windows, one per level || {{no}} || {{no}} || {{no}} || {{yes}}via tabs. multiple levels can be opened in separate tabs. || {{no}} || {{yes}}
|-
| {{tc}} | multiple views of a level || {{yes}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | full screen || {{no}} || {{no}} || {{no}} || {{no}} || {{yes}} via : keyboard: F11 || {{no}}
|- {{programs}}
|}
[[#top|Top]]

<noinclude>

<h2>Information</h2>
=== Level scrolling ===

levels larger than window: scrolling 
levels larger than window: scrollbars 

Briefly, the first line is there to give a program the chance to tell that it has a scroll feature, and the second line is there to tell if the program does it the right way - with scrollbars.

Since the first graphical user interfaces emerged, scrollbars have been used for depicting the situation where a document doesn't fit in the window, so the user can rightfully expect to find that logic (or something equally user-friendly) in a Sokoban program as well.

Therefore, it's embarrasing for programs that requires scrolling if they don't have scrollbars or something equivalent. The line "levels larger than window: scrollbars" must be listed so readers can see this major design flaw, and so new programmers are reminded that they definitely should do better.

On the other hand, Sokofan deserves credits for at least having a scroll feature, despite the fact that it's not done the right way with scrollbars. The user doesn't get any visible clue that the board is bigger than the window, and the user must read the instructions to find the keyboard and mouse/key combinations that controls the scrolling.

So the line "levels larger than window: scrolling" is there to give Sokofan a chance to tell that it indeed has a scroll feature, even though it's not as user-friendly as the user rightfully can expect from a good Sokoban clone.

-bd

=== Multiple views of a level ===
A user often works on several alternative paths at the same time. It would be a great help if each of them was fully visible. For instance, multiple views are beneficial during the process of optimizing existing solutions.

=== SokRFI - Sokoban Requests for Implementation ===



{| class="soko-table feature-list"
|-
! colspan="50" | Map Viewing : SokRFI - Sokoban Requests for Implementation
|-
| width="120" {{tc}} | Feature || {{tc}} | Description
|-
|{{tc}}| show/hide redundant walls ||It fills jagged wall edges, fills unused "tubes", removes redundant walls, unused boxes, and unused goals. Implemented in [http://sokoban.ws/usokoban/usokoban.htm USokoban] as 'Normalize level'.
|}

[[#top|Top]]
</noinclude>

Feature list : Skin Features

2024-07-17T18:51:10Z

Matthias Meger: /* Skin Features */ removed column

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Skin Features ==
{{LastREVISIONTIME}}




{| class="soko-table"
! colspan="6" | Skin Features !! colspan="50" | <div align="right">Skin Features</div>
|- {{programs}}
| {{tc}} | customizable skin || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{no}}
|-
| {{tc}} | skin formats || {{yes}} meta-script language {{tip|includes scripts for importing the following skin formats: common sokoban skin images (YSokoban), Sokoban++ skin scripts, Sokofan skin scripts, Visual Sokoban skin scripts, Sokoban for Windows skin scripts (Björn Källmark), Sokoban BDE images, SuperSoko skin images, SokoStation4 skin scripts JSoko skin scripts|width=210px}} || {{yes}} Sokoban++ skin scripts (ini) || {{yes}} two built-in skins || {{yes}} Sokoban for Windows skin scripts (skn) || {{yes}} common sokoban skin images (YSokoban) || {{no}}
|-
| {{tc}} | resizeable skins || {{yes}} || {{no}} || {{yes}} || {{yes}} || {{no}} || {{no}}
|-
| {{tc}} | pseudo-3D skins (sokoban++ style) || {{no}} || {{yes}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | legal moves box animation (ysokoban style) || {{yes}} || {{no}} || {{no}} || {{no}} || {{yes}} || {{no}}
|-
| {{tc}} | legal moves player animation (ysokoban style) || {{yes}} || {{no}} || {{no}} || {{no}} ||{{yes}} || {{no}}
|-
| {{tc}} | solution animation (ysokoban style) || {{yes}} || {{no}} || {{no}} || {{no}} || {{yes}} || {{no}}
|-
| {{tc}} | animation frame extrapolation (morphing) || {{yes}} 30 frames || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | directional player || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{no}} || {{no}}
|-
| {{tc}} | directional player can return to an "at ease" position || {{no}} || {{no}} || {{no}} || {{yes}} || {{no}} || {{no}}
|-
| {{tc}} | directional box|| {{no}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | directional box can return to an "at ease" position || {{no}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | support for seamless walls (as opposed to discrete walls) || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{no}}
|-
| {{tc}} | walls can be transparent || {{no}} || {{no}} skin dependent || {{yes}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | floors can be transparent || {{yes}} || {{no}} skin dependent || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | skin browser with preview || {{yes}} image-based skins; not scripted skins || {{no}} || {{yes}} || {{yes}} || {{no}} || {{no}}
|-
| {{tc}} | recent skins history || {{yes}} || {{yes}} || {{no}} || {{un}} {{tip|with all skins in a list it is just as easy to browse the whole list}} || {{no}} || {{no}}
|-
| {{tc}} | quick browse skins || {{yes}} menu: default, recent skins; keyboard shortcuts: next, default || {{yes}} menu: default, recent skins || {{yes}} menu: skin list || {{yes}} menu: skin list || {{yes}} use F4-F8 to select one of the loaded skins || {{no}}
|- {{programs}}
|}
[[#top|Top]]

Feature list : Customizing

2024-07-17T18:43:17Z

Matthias Meger: /* Customizing */ removed extra column

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Customizing ==
{{LastREVISIONTIME}}




{| class="soko-table"
! colspan="6" | Customizing !! colspan="50" | <div align="right">Customizing</div>
|- {{programs}}
| {{tc}} | settings interface || {{yes}} graphical user interface (tree-view) || {{yes}} graphical user interface (tabbed notebook view) || {{yes}} graphical user interface || {{yes}} graphical user interface (tabbed notebook view) || {{yes}} graphical user interface (window) || {{yes}} graphical user interface (window)
|-
| {{tc}} | configurable statusbar (e.g., level title, moves, pushes) || {{no}} || {{yes}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | configurable game state graphics (e.g., moves/pushes) || {{yes}} fonts, colours, buttons (static layout) || {{yes}} skin graphics (configurable layout) || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | customizable cursors || {{no}} || {{yes}} graphics, skin dependent || {{no}} || {{yes}} small/large built-in cursors || {{no}} || {{no}}
|-
| {{tc}} | customizable mouse actions || {{yes}}(only right-click) || {{no}} || {{no}} || || {{yes}}(buttons: left, middle, right) || {{no}}
|-
| {{tc}} | customizable sound events || {{yes}} independent || {{yes}} skin dependent || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | background music || {{no}}  || {{no}} || {{no}} || {{yes}} source: folder formats: midi, mp3. || {{no}} || {{no}}
|-
! colspan="6" | Customizing : Background Image!! colspan="50" | <div align="right">Customizing : Background Image</div>
|- {{programs}}
| {{tc}} | customizable backgrounds || {{yes}} independent, with preview || {{yes}} skin dependent || {{yes}} independent || {{yes}} skin dependent || {{yes}} independent, with preview || {{no}}
|-
| {{tc}} | background control || {{yes}} source: color, image; (image view: center, scale, stretch, tile) || {{yes}} source: color, image; (image view: center, stretch, tile) || {{no}} || {{yes}} source: image; (image view: tile) || {{yes}} source: image; (image view: center, stretch, tile) || {{no}}
|-
| {{tc}} | quick browse backgrounds || {{no}} "slow" browse via settings || {{no}} || {{yes}} browse with preview via settings || {{no}} || {{yes}} tool button with drop-down list || {{no}}
|}
[[#top|Top]]

<noinclude>

== SokRFI - Sokoban Requests for Implementation ==


{| class="soko-table feature-list"
|-
! colspan="50" | Customizing : SokRFI - Sokoban Requests for Implementation
|-
| width="120" {{tc}} | Feature || {{tc}} | Description
|-
|{{tc}}| background-image changer || This feature is for the users that look for to always have a different background, playing a level. It is applied to the following events in the program: 
• On program start-up • After solving a level. 
For the convenience of users and updates are groups all backgrounds in a single folder. One can also choose the mode in that the background will be changed: 
• Next image. • Previous image. • Random image.Implemented in Sokomind
|}
[[#top|Top]]
</noinclude>

Feature list : Game Play

2024-07-17T18:37:12Z

Matthias Meger: /* Game Play */ removed column

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Game Play ==
{{LastREVISIONTIME}}




{| class="soko-table"
! colspan="6" | Game Play !! colspan="50" | <div align="right">Game Play</div>
|- {{programs}}
| {{tc}} | autosave best solutions || {{yes}} tiebreaking: moves, pushes, secondary metrics || {{yes}} tiebreaking: moves, pushes || {{no}} || {{yes}} tiebreaking: moves, pushes || {{yes}} tiebreaking: moves, pushes, secondary metrics || {{no}}
|-
| {{tc}} | autosave solutions options || always autosaves better solutions; inferior solutions are discarded || autosave solutions options: never/always/if better/ask; existing solutions are kept || {{no}} || autosave solutions options: none/best 5/best 10/all || always autosaves better solutions; inferior solutions are discarded || optionally saves game when solved; only one solution per saved game
|-
| {{tc}} | push or move optimized pathfinding || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{yes}}
|-
| {{tc}} | move animation modes || smooth, cell by cell, instant || cell by cell, instant || cell by cell || smooth || cell by cell, instant {{tip|(instant with [[Feature_info#Choice points|choice points]] is listed but is too fast to be useful)|menu=yes}} || cell by cell, instant
|-
| {{tc}} | mouse move control: drag and drop || {{yes}} with reachable squares || {{yes}} without reachable squares || {{yes}} with reachable squares || {{yes}} with reachable squares || {{yes}} with reachable squares || {{no}}
|-
| {{tc}} | [[#Mouse_Move_Control:_Select_and_drop|mouse move control: select and drop]] || {{yes}} with reachable squares || {{yes}} with reachable squares || {{yes}} with reachable squares || {{yes}} with reachable squares || {{yes}} with reachable squares || {{yes}} without reachable squares
|-
| {{tc}} | [[#Mouse_Move_Control:_Drag_and_track|mouse move control: drag and track]] || {{no}} experimental click-less tracking available || {{no}} || {{no}} || {{no}} || {{no}} || {{yes}}
|-
| {{tc}} | reverse mode play starting at end position (pull instead of push) || {{yes}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | show secondary metrics (box-pushes, box-changes and pushing-sessions) || {{yes}} display: mouse over || {{yes}} display: optional, configurable || {{no}} || {{no}} || {{yes}} || {{yes}}
|-
| {{tc}} | [[#Lowerbound_of_solution_length_regarding_pushes|show a lowerbound of the solution length]] || {{no}} || {{no}} || {{yes}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | timing || {{yes}} optional; optional idle time threshold || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | move player through boxes ||{{no}}|| {{no}} || {{yes}} || {{no}} || {{yes}} target: reachable squares through boxes. figure: small black square. via: options -> go through boxes. || {{no}}
|-
! colspan="6" | Game Play : Legal moves !! colspan="50" | <div align="right">Game Play : Legal moves</div>
|- {{programs}}
| {{tc}} | show player's reachable squares|| {{yes}} figure: transparent small skin graphics || {{no}} || {{yes}} figure: transparent small skin graphics || {{yes}} || {{yes}} figure: small round blobs || {{no}}
|-
| {{tc}} | show box's reachable squares || {{yes}} figure: transparent small skin graphics || {{yes}} figure: skin graphics, independent of box || {{yes}} figure: transparent small skin graphics || {{yes}} || {{yes}} figure: small round blobs || {{no}}
|-
| {{tc}} | show pushable boxes || {{yes}} dynamically by clicking a wall. figure: configurable border || {{no}} || {{no}} || {{no}} || {{yes}} permanent with CTRL+F9. dynamically by clicking a wall. figure: skin graphics, independent of box || {{no}}
|-
| {{tc}} | show [[Deadlocks#Dead square deadlocks|dead squares]] || {{yes}}figure: configurable shaded square || {{no}} || {{yes}}figure: darker shaded square || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | [[#Simple deadlock detection|simple deadlock detection]] || {{yes}} dead squares, freezing boxes || {{no}} || {{yes}} dead squares, freezing boxes || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | [[#Advanced deadlock detection|advanced deadlock detection]] || {{yes}} {{tip|bipartite: n boxes for m goals; 1 goal for n boxes; corrals: precalculated at level load time + 100 ms search after a push}} || {{no}} || {{yes}} || {{no}} || {{no}} || {{no}}
|-
! colspan="6" | Game Play : History !! colspan="50" | <div align="right">Game Play : History</div>
|- {{programs}}
| {{tc}} | undo/redo || unlimited || unlimited || unlimited || unlimited || unlimited || unlimited
|-
| {{tc}} | undo all || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{yes}} press [esc]|| {{yes}}
|-
| {{tc}} | redo all || {{yes}} || {{no}} || {{yes}} || {{no}} ||{{no}} || {{yes}}
|-
| {{tc}} | replay || {{yes}} forwards and backwards || {{yes}} forwards || {{yes}} forwards || {{yes}} forwards and backwards || {{yes}} forwards (solutions only) || {{yes| via trackbar dragged to any position replays to that position}}
|-
| {{tc}} | replay ergonomics || unified start/stop button; click anywhere to stop; keyboard shortcuts available; speed and direction can be changed during replay || separate start/stop buttons; click stop-button to stop; keyboard shortcuts available || unified start/stop button; click anywhere to stop; speed can be changed during replay || || with start/stop: CTRL+F2 to begin. SPACE to replay to next box-change. without start/stop: F2 || trackbar represents replay history; drag trackbar to control replay; click anywhere, click [stop] button, or press [esc] to stop
|-
| {{tc}} | mousewheel undo/redo/replay support || {{yes}} combined moves || {{yes}} single step or optional combined moves || {{yes}} combined moves || {{no}} || {{yes}} combined moves || {{no}}
|-
| {{tc}} | browse move history || {{yes}} trackbar (choice-points, with preview) || {{yes}} trackbar (all moves, with preview) || {{yes}} trackbar (choice-points, with preview) || {{no}} || {{no}} || {{yes}} trackbar (all moves, no preview)
|-
| {{tc}} | quicksave slots || {{yes}} unlimited (interface: graphical, window, thumbnail preview) || {{yes}} unlimited (interface: graphical, pop-up, list) || {{no}} || {{yes}} 3 (interface: graphical) || {{no}} || {{no}}
|-
| {{tc}} | one-click load quicksaves || {{yes}} keyboard: press [Enter] to load currently selected snapshot; mouse: double-click a snapshot on the list || {{no}} || {{no}} || {{yes}} || {{no}} || {{no}}
|-
| {{tc}} | remember last session || {{yes}} file, level, history with redo, position {{tip|position is optional, default "off", additionally, up to 25 recent (file, level)}} || {{yes}} file, level || {{yes}} file, level || {{yes}} file, level, history without redo, position || {{yes}} file, level, history without redo, position || {{no}}
|- {{programs}}
|}

[[#top|Top]]

<noinclude>

== Info ==

=== Choice points ===

A choice point in the game is when the player changes from one box to another, or finishes a series of moves that pushed a box in a single direction.

Several programs have replay features related to choice points. Sokofan, for example, has replay buttons (called "smart do/undo") to move from one choice point to another. Another example is the game history browser in Sokoban YASC which works with choice points instead of individual moves.

=== Mouse Move Control: Select and drop ===
Lift and drop. Left click on a box to lift it, move to the wanted position and left click again to drop. Lift and drop is easier for long moves than the drag and drop.

=== Mouse Move Control: Drag and track ===
Point at the pusher with the mouse and move it in the direction you want. The pusher will track your movements.

=== Simple deadlock detection ===

Simple deadlock detection deals with deadlock types that require rather simple analysis of the board and the game state. Good examples are:

* [[Deadlocks#Dead square deadlocks|Dead squares]]

* [[Deadlocks#Freeze deadlocks|Freeze deadlocks]]

=== Advanced deadlock detection ===

Advanced deadlock detection deals with deadlock types that require quite sophisticated computations. Good examples are:

* [[Deadlocks#Bipartite deadlocks|Bipartite deadlocks]]

* [[Deadlocks#Corral deadlocks|Corral deadlocks]]

=== Lowerbound of solution length regarding pushes ===

For solving a level all boxes have to be pushed to goals. A program can calculate the distance of every box to the nearest goal. While doing this it is presumed only one box is on the board (hence the box does not need to be pushed around other boxes). The sum of all these box distances to their goals results in a lowerbound - no matter how the boxes are pushed to their goals the level can never be solved with fewer than the calculated number of pushes. Some programs can calculate a lowerbound for the solution length (in pushes): 
number of pushes so far + sum of all box distances to their nearest goals (presuming no other boxes are on the board). 
This lowerbound can be useful in levels like the "Kobus Theron"-series.

[[#top|Top]]
</noinclude>

Feature list : General Information

2024-07-17T18:07:41Z

Matthias Meger: /* Game Types */

<noinclude>__NOTOC__{{:Feature_list}}</noinclude>


== Platforms ==



{| class="soko-table"
! colspan="6" | Platforms !! colspan="50" | <div align="right">Platforms</div>
|- {{programs}}
| {{tc}} | Java (platform independent) || {{no}} || {{no}} || {{yes}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | Linux || {{no}} || {{no}} || {{yes}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | Mac OS X || {{no}} || {{yes}} {{tip|Sokoban++ for macOS lacks many of the features listed here, this feature list reflects the Windows version|text=partial}} || {{yes}} || {{no}} || {{no}} || {{yes}}
|-
| {{tc}} | Windows || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{yes}}
|-
| {{tc}} | Windows Mobile || {{no}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
! colspan="6" | Program Information !! colspan="50" | <div align="right">Program Information</div>
|-
| {{tc}} | license || free software || freeware || free software || shareware || freeware || freeware
|}
[[#top|Top]]

== Limits ==



{| class="soko-table"
! colspan="6" | Limits !! colspan="50" | <div align="right">Limits</div>
|- {{programs}}
| {{tc}} | maximal map size || 50x50 || 70x70 || 200x200 || unlimited || unlimited || unlimited
|-
| {{tc}} | maximal moves || 100000 || unlimited || unlimited || unlimited || unlimited || unlimited
|-
| {{tc}} | [[Feature_list_:_General_Information#Maximal boxes limited by map size|maximal boxes]] || 1200 || unlimited || unlimited || unlimited || unlimited || unlimited
|}
[[#top|Top]]

== Game Types ==



{| class="soko-table"
! colspan="6" | Game Types !! colspan="50" | <div align="right">Game Types</div>
|- {{programs}}
| {{tc}} | sokoban || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{yes}} || {{yes}}
|-
| {{tc}} | sokoban + (numbered sokoban) || {{no}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | trioban || {{no}} || {{no}} || {{no}} || {{no}} || {{no}} || {{yes}}
|-
| {{tc}} | hexoban || {{no}} || {{no}} || {{no}} || {{no}} || {{no}} {{tip|separate download available}} || {{yes}}
|-
| {{tc}} | octoban || {{no}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|-
| {{tc}} | multiban || {{no}} || {{no}} || {{no}} || {{no}} || {{no}} || {{no}}
|}
[[#top|Top]]

<noinclude>

==Info==
=== Maximal boxes limited by map size ===

There is no limit to the number of boxes. The limit is that imposed by the size of the map.

(The table uses the term "unlimited" here. In this context, it means the same, and it avoids burdening the reader with unnecessary details like "limited by map size".)

[[#top|Top]]
</noinclude>

Level format

2024-06-14T10:46:55Z

Matthias Meger: moved Level format to Puzzle format

#REDIRECT [[Puzzle format]]

User:Matthias Meger

2024-06-12T14:06:22Z

Matthias Meger:

Matthias Meger
Hamburg, Germany
E-Mail: JSoko@mail.de

Main Page

2024-04-23T18:24:51Z

Matthias Meger: /* Welcome to the Sokoban Wiki */ added scientific research page

=='''Welcome to the Sokoban Wiki'''==

[[Image:SokobanExample.gif|frame|right|A ''Sokoban'' puzzle being solved]]

'''Sokoban''' is a puzzle video game in which the player pushes boxes around in a warehouse, trying to get them to storage locations.

The game was designed in 1981 by Hiroyuki Imabayashi, and first published in December 1982.
The original game of SOKOBAN was written by Hiroyuki Imabayashi.

Today Sokoban is one of the most popular thought and logic games.

The name comes from Japan and means "warehouse keeper".

As simple as that name is, so is the idea of this game:

A Sokoban puzzle represents a store room, where boxes appear to be randomly placed.
You help the warehouse keeper to push the boxes around the maze of the room so that, at the end, all boxes are on marked fields.

The only restrictions are that the warehouse keeper can only push a box, never pull, and that just one box may be pushed at a time.

Each puzzle has a different structure, which requires a different solution - often with a different strategy as well.
The magic of the game is that boxes, which are out of the way on one move, might be in the way on the next move.

The simplicity of the rules, in combination with the many puzzles ranging from easy to extremely difficult, have made Sokoban become a real classic.

This Wiki is dedicated to this exciting game.

<div class="box margin-3">
<div class="title" align="center">Contents</div>

:'''Information'''
:* [[The rules of the game]]
:* [[How to play Sokoban]]
:* [[Moves vs. Pushes]]
:* [[Deadlocks]]
:* [[Scientific research]]
:* [[level format | The level format]]
:* [[general Sokoban information | General Sokoban information]]

:'''Programs'''
:* [[First_Sokoban_program | The first Sokoban program]]
:* [[Links | Sokoban Programs and links]]
:* [[feature_list | Sokoban program feature comparisons]]

:'''Solvers statistics'''
:* [[Solver Statistics | Sokoban solver statistics]]

:'''Development'''
:* [[Solver | Solver development]]
:* [[Optimizer | Optimizer development]]

</div>

== SokobanWiki Buttons ==

Add a SokobanWiki [[Buttons|Button]] to your web site.

This Sokoban Wiki was printed on 100% recycled electrons!

File:SokobanExample.gif

2024-04-23T18:18:59Z

Matthias Meger:

File:FirstSokoban.png

2024-04-17T11:49:44Z

Matthias Meger: uploaded a new version of "File:FirstSokoban.png": Screenshot: First Sokoban program

Image of the first Sokoban game

Solver

2024-04-13T12:56:58Z

Matthias Meger: /* Deadlocks */ Changed the text a bit so it's clearer that deadlocks are a good thing and can help the solver find a solution quicker

== Terms and Definitions ==

;Level
:Another term for a Sokoban puzzle.
:A level contains a board and usually additional data like title, author name and solutions.
:Sometimes it’s also called “maze”.

;Board
:The board is a 2 dimensional area containing the objects of a Sokoban level (walls, boxes, goals, player and empty squares).

;Boxes
:The objects on the board which the player can push around.

;Goals
:The target positions for the boxes.
:A level is solved when all boxes have been pushed to a goal.

;Box Configuration
:The positions of all boxes on the board form a specific ''Box Configuration''.

;Board position
:The positions of all boxes and the player position constitute a ''Board Position''.

;State
:The positions of all boxes and the player position constitute a Board Position.
:
:The term State is used when additional data are stored together with a Board Position.
:
:For instance, a solver may store: pushes needed to reach the board position or the information of which box has been pushed last.
:
:The search tree consists of states being generated during the search.
:
:States can be stored in a transposition table so duplicate game positions can be detected, for instance.
:Other terms for a state are: game position, game state and game position.

;Player reachable area
:The player reachable area consists of all squares on the board currently reachable for the player.

;Corral
:The boxes and walls on the board can split the board into several areas.
:
:An area of the board which the player cannot reach, surrounded by a barrier made of one or more boxes, and any number of walls is called “corral”.

== Data Structures ==

=== Positions on the board ===
The board is a two-dimensional area containing the objects of a Sokoban level.

Hence, a natural data structure for storing the board is a two-dimensional array.

However, many solvers use a one-dimensional data structure for this task, numbering the board positions from 0 to n-1, where 'n' is the number of board squares.

Accessing the elements of a one-dimensional vector is easier and faster for a computer program than accessing the elements of a two-dimensional array, simply because the address calculation is less complicated.

Using a one-dimensional vector has also the advantage for the programmer, that a square number can be stored in just one variable.

The board data structure can also include additional data, for instance flags for:
* Is a box frozen?
* Is the position a dead position?

=== Storing a state ===
In Sokoban a state consists (among possible additional data associated with it) of the positions of the boxes and the position of the player.

Every other element of the board cannot change its position and therefore needn’t to be stored per state.

Therefore a state can be stored by using:
* One integer array for storing all box positions.
* One integer for storing the player position.

For a better memory alignment the player position and box positions can also be stored in one integer array together.

The data structure usually consists of additional data fields like for storing information about the state like pushes needed to reach it or which box has been pushed last.

Example data structure for Java:
<pre>
public class State {
int[] boxPositions;
int playerPosition;
}
</pre>

=== Transposition Tables ===
Solvers for the Sokoban game use a graph search as the search algorithm.

The search creates a directed graph of states.

In nearly every Sokoban puzzle many states can be reached through different paths in the search graph.<br /
In these cases the graph is cyclic and the search reaches specific states multiple times during the search.<br /
The search effort can therefore be considerably reduced by eliminating duplicate states from the search.<br /
A common technique is to use a large hash table, called the transposition table, which stores all already explored states.<br /

The transposition can also be used to store additional data per state – for instance the depth the state has been reached in during an IDA*-search.

==== Tradeoff between space and time ====
The transposition table may need to hold several million states.<br /
Hence, an efficient data structure has to be chosen for storing the states.

There are different approaches to address the high memory usage problem.

===== Limit the transposition table size =====
One solution for the high memory usage of the transposition is limiting the size of the transposition table.

This makes the search algorithm a kind of hybrid between tree search and graph search. <br /
The advantage is the ability to search for solutions for larger levels due to the lower memory usage, while an obvious disadvantage is that it may lead to duplicated search effort.

===== Incremental storage of states =====
Instead of storing all box positions and the (normalized) player position for every state it’s also possible to store the data relative to another state.

This divides the states in two types:
* States that store all box positions and the player position.
* States that store a link to another state and the difference to that linked state.

Example: 
State 1:
box positions: 10, 13, 21, 33, 45, 47, 48, 49
player position: 17</pre>

Now another state consisting of these data has to be stored:
<pre>
State 2:
box positions: 11, 13, 21, 33, 45, 47, 48, 49
player position: 10</pre>

State 2 can be stored relative to state 1 this way:
<pre>
State 2:
link to: state 1
boxNo: 0
newBoxPosition: 11
Player position: 10 </pre>

=== Hash Function ===
Since the transposition table is usually implemented as hash table a hash function is needed for storing the states.

The hash function takes the position of every box and the normalized player position into account.

One efficient way to implement this is using Zobrist values (see: Albert L Zobrist. A new hashing method with application for game playing. ICCA journal, 13(2):69–73, 1970.)

== Normalizing the player position ==
Solvers not interested in finding solutions optimized for moves can consider two states equivalent if the boxes are at the same positions and the player positions are in the same player access area.

This can be implemented by storing only normalized player positions, e.g. the top-left reachable position instead of the actual position of the player.

This significantly reduces the number of states in the search tree.

== Calculation of player reachable positions ==
The reachable player positions must be calculated very often during the solver search.
Hence, an efficient algorithm is required.

=== Algorithm ===
In order to generate successor states from a specific state during the search the solver must know which side of which boxes the player can reach.

Instead of calculating a path for the player to every side of every box separately it’s quicker to calculate all player reachable positions at once.

This can be done by performing a simple Breadth First Search.

The BFS marks all reachable positions. This can be done by using a boolean array where each bit represents a specific position on the board. 
For a better performance time stamps can be used to mark the reachable positions of the player instead of boolean flags.

== Brute force ==
The first step we do is to code a routine that generates all possible pushes for a given level situation.
In our level for the first push there are four possible pushes: up, down, left and right. All of these pushes are done and the resulting states are stored in a queue.

With only one push the box can be pushed to the following positions:

[[Image:SolverLevel2.png]]

After this is done we take every of these saved states as new start state and generate all possible successor states. For example, this is one state than occurs after the first push has been made:

[[Image:SolverLevel3.png]]

We take this state and generate all successor states of it (that just means we push the box to every possible direction again). Again we save every generate state in the queue.

Described as algorithm this looks like this:

This is done again and again:
# Add the initial state (the level begin) to the queue

# Take the first state of the queue
# Generating all successor states of the state we got of the queue
# Add all states we've just generated in the queue
# continue by step 1

Finally we reach the state where the box is located on the goal.

== Pruning duplicate positions ==
The described algorithm can be improved a lot. One thing that can be improved is the following:
At any time the algorithm pushes the box on square to the right. Then it adds this state to the queue. At some time it takes this state from the queue again and generates all successor states - including the state resulting by pushing the box one square to the left.
This results in a loop: Pushing a box to the right, then back to the left, again to the right, ...
we generate duplicate positions which slows down the search a lot. So what we have to do is avoiding duplicates states.
To avoid duplicate positions we have to detect them. Therefore we have to store every state reached during the solving process.
After a new state has been generated we have to check if it has already been generated before and if so we just discard it.
This reduces the number of states to search until a solution is found a lot and therefore improves the performance of the solver.

New solver process logic:
# Take the first state of the queue
# Generating all successor states of the state we got of the queue
# Delete all successor states that have already been generated before
# Add all left states to the queue
# continue by step 1

== Deadlocks ==

Due to the constraints given by the rules of Sokoban some states in the game are deadlocked.

That means it isn’t possible to push every box to goal, anymore.

In general, deadlocks can be arbitrarily complex and potentially include all the boxes.

Hence, detecting all deadlocks is only feasible for very small levels.

However, a lot of deadlocks can be identified also in bigger levels.

Detecting deadlocks can prune huge parts of the search tree and therefore is an important part of every solver.

A balance has to be found between the time spent on deadlock detection and the time spent on the actual search.

While the detection process itself has some computational cost, the benefits of pruning large parts of the search tree usually outweigh the drawbacks.

See the [[Deadlocks]] section for an overview of some common deadlocks that may occur.

[[How to detect deadlocks]]

== Pushes Lowerbound Calculation ==

The ability to admissibly estimate the number of box pushes needed to solve a specific state is useful for the heuristic function used in a guided search - like for example the A*-search.

The more accurate the calculated lower bound is the better it can guide the search. 
However, calculating a good lower bound is a CPU intensive calculation.

A good lower bound calculation is especially important for solvers that search push optimal solutions.

The lower bound can also be used as information whether a level has been solved, since a lower bound of 0 means all boxes are on goals.

=== Performance vs. Accuracy ===
Calculating an accurate pushes lower bound is a quite expensive task. 
Hence, depending on the needed accuracy different algorithms are used.

==== Free Goals Count ====
A trivial lower bound can be calculated by counting the number of goals not occupied by a box.

This calculation is very fast but the results are quite inaccurate. 
However, this calculation can be used to identify specific level types.

Example:
If the initial state of a level has 20 boxes but only one goal not occupied by a box then this level belongs to a specific level type where most of the boxes are on goals right from the beginning. 
For such levels a lower bound calculation can often not guide the search as well as in other level types.

==== Simple Lower Bound ====
A simple lower bound calculation calculates the sum of the distances of each box to its nearest goal.

The distance from a box to its nearest goal can be calculated with various degrees of sophistication. 
The simplest method is to calculate the so-called [http://en.wikipedia.org/wiki/Taxicab_geometry Manhattan distance].

A more accurate method is to use the minimum push distance from a box to its nearest goal. 
The program can precalculate the minimum push distance to the nearest goal for all squares on the board during initialization. 
That way, it's a simple and efficient table lookup to find the distance to the nearest goal for each box during the search.

Both of these methods have the notable property that they are so-called [http://en.wikipedia.org/wiki/Admissible_heuristic admissible heuristics], i.e., they never overestimate the true shortest solution. This means the lower bound estimate can be used for solving a level with a push-optimality guarantee.

Calculating a simple lower bound is fast and accurate enough for very small levels. It does, however, grossly underestimate the true lower bound in most cases. The simple lower bound ignores that all boxes must go to different goals, and it also ignores how the boxes interact with (typically block) one another.

==== Minimum Matching Lower Bound ====
The Minimum Matching Lower Bound algorithm calculates a minimum-cost perfect matching on a bipartite graph. 
The “cost” is represented by the push distance of a specific box to a specific goal. 
Each box is assigned to a goal so that the total sum of distances is minimized.

The matching can be calculated using the Hungarian method or the Auction algorithm, for instance. 
The complexity of this calculation is about O(N3), where N is the number of boxes and therefore are quite expensive calculation.

The benefits of this expensive calculation are:
* It produces much more accurate results than the Simple Lower Bound calculation.
* It provides the parity of the any solution, i.e. if the value returned by the algorithm is even, then the number of pushes in a solution is also even.
This makes it possible to skip every other iteration in an iterative deepening search.
* It can detect deadlocks where not every box can reach an own goal anymore.

==== Greedy approach ====
Calculating a minimum-cost perfect matching on a bipartite graph as described above is an expensive computation.

A greedy approach can be used to approximate a minimal perfect matching: 
the push distances of all boxes to every goal are calculated and stored in a list sorted ascending by distance.

Example:
: box1 to goal 1: distance = 3
: box 2 to goal 1: distance = 4
: box1 to goal 2: distance = 10
: box 2 to goal 2: distance = 12

There is also a list of all already matched boxes and goals. 
We then iterate over this list of distances. 
If the box and the goal both aren’t matched, yet, we match them. 
In the example, we would match box 1 to goal 1. 

Then the second list entry is reached: 
“box 2 to goal 1: distance = 4“ 
Since goal1 is already matched with box 1 the box can’t be matched and we discard this entry.

However, it is possible that not every box is assigned a goal after the list has been completely iterated over – although a valid matching for all boxes may be possible. 
In that case all not yet matched boxes are simply assigned to its closest goal.

This approach isn’t as expensive to calculate as a minimum-cost perfect matching with the disadvantage of being less accurate.

=== Algorithm Optimization ===
The algorithm used to calculate the pushes lower bound can be optimized using specific optimization ideas:

* If the lower bound of a state is L1 and a push is made the new lower bound L2 has to be calculated. When the algorithm finds a matching that reduces this lower bound L1 by the cost of the push, it’s clear that the lower bound can’t be reduced further. Hence, the algorithm can stop immediately in these cases.

* During the search the algorithm only needs to update the previous found matching, because each push results in only one box changing its distances to the goals.

* Only perfect matchings are relevant. Hence, as soon as it is clear that a perfect matching isn’t possible the algorithm needn’t to search for the minimum matching anymore.

=== Calculating the Box Distances ===
For calculating the pushes lower bound the algorithm needs the distances for all boxes to all goals.

Calculating these distances can be done in different ways.

Since the wall positions and goal positions never change, the distances for a specific box depend on:
* the player position
* the positions of the other boxes

Calculating the real distances for all boxes regarding all other box positions is too difficult and time consuming. In fact this can be as difficult as the task to solve the whole level.

Hence, the common practice is to just consider the distance of a box to a goal under the assumption that no other box is on the board. 
This also has the advantage that the distances can be computed and cached before the solver starts since they never change while the solver is running.

==== Position of the Player ====
For a more accurate calculation of the distance of the box to the goals the player position can be taken into account. 

Example 1: 
[[Image:PositionOfThePlayer.png]]

The needed pushes to push the box to the goal having the player on the right of the box is 6 pushes. 
However, the needed pushes to push the box to the goal having the player on the left of the box is only 2 pushes. 

Hence, it's necessary to calculate the distance of the box to the goals for every possible player access area. 
In this example there are two possible player access areas: one having the player left from the box and one having the player right from the box.

The player position has also to be taken into account of for calculating the real distance of the box to the goals.

Example 2: 
[[Image:BoxDistanceExample.png]]

There is only one player access area in this example. 
However, the box distance to the goal is not 2 pushes but 8 pushes.

Both examples have something in common: 
There is a so called ''Gate Square''.
;Gate Square
: A ''Gate Square'' divides the board into at least two different player access areas.

If the goal distances of a box on a ''Gate Square'' has to be calculated the player position has to be taken into account (like in Example 1). 

''Gate Square''s in general have to be taken account of when calculating the box distances, like shown in Example 2.

This is example 2 with the ''Gate Squares'' highlighted: 
[[Image:LevelWithGateSquaresHighlighted.png]]

=== Linear Conflicts ===
The restriction of only considering one single box for calculating the box distances has the obvious disadvantage of not taking into account other boxes that may block the box or the player.

It's however possible to detect some of the box configurations that inevitably increase the calculated pushes lower bound.

Example: 
[[Image:PenaltSquares.png]]

In this example the calculated pushes lower bound is 8 pushes when using the ''Minimum Matching Lower Bound'' calculation.

However, the real number of needed pushes to push both boxes to a goal is 10 pushes. 
The reason for this is both boxes block each other in a way that both boxes can only be pushed vertically. Since all possible vertical pushes will push a box further away from a goal the needed pushes for solving the level increases. 
In such situations the calculated pushes lower bound can be increased by 2.

==== Pitfalls ====

Example 1: 
[[Image:PenaltyPitfall1.png]]

This example shows three boxes that all can only be pushed vertically. 
However, this doesn't mean that we can add a penalty higher that 2 to the calculated pushes lower bound.

Since pushing the middle box down (or up) makes it possible to push the other two boxes push optimal to the goals only a penalty value of 2 may be added to the calculated pushes lower bound.

Note: if there were a wall above or below the middle box it would be valid to add a penalty value of 4!

Example 2: 
[[Image:PenaltyPitfall2.png]]

This example is the same as Example 1 but with one goal at a different position. 
Since now a vertical push of the middle box is on the push optimal path to a goal it's not valid to add any penalty value to the pushes lower bound!

==== Complex linear conflicts ====
Sophisticated conflict detection algoritms may also detect linear conflicts involving more than two boxes and more complex linear conflics like in this example: 
[[Image:ComplexLinearConflict.png]]

==== Frozen Boxes ====
The distanes used for the lower bound calculation are usually precomputed before the solver search starts. 

They represent the number of box pushes required to push a box from any square on the board to any other square. 
These distances are optimistic distances in that they assume no interference with other boxes. 
The only restrictions are the walls on the board.

However, boxes on a goal which can't be pushed anymore (-> frozen box) can be treated as walls. They therefore potentially change the distances.

Example: 
[[Image:LowerBoundWithFrozenBox.png]]

In this example the pushes lower bound is 3 pushes. 
However, when the left box is pushed two squares to the right to its goal the right box can't be pushed up immediately anymore: 
[[Image:LowerBoundWithFrozenBox2.png]]

In such situations the box distances have to be recalculated while treating the box on the goal as a wall. 
By doing so the correct pushes lower bound can be calculated.

==== Pattern databases ====
Some solver programs use pattern databases where precalculated box configurations are stored together with a penalty value.

This way it's possible to detect even complex penalty situations and add high penalty values.

== No influence pushes ==

=== Tunnels ===
Having teached the solver to use the algorithms described above our little level is solved very quickly. Usually Sokoban levels are a lot more complicated. Therefore we have to search for further ideas how to reduce the number of states we have to generate during the solving process.

New example level:

[[Image:TunnelExample1.png]]

Here we have a (still very easy) level containing two boxes. The solver takes the given state as initial state. Then it generates all possible successor states. This means: Pushing box 1 to every possible direction AND pushing box 2 to every possible direction. The solver doesn't know which push is the best for solving the level - hence it has to generate all possible successor states. This soon leads to an enormous number of generated states (at least in larger Sokoban levels). It would be a great advantage if we knew that only pushes of one box are relevant in a specific state.

Let's assume the player has just pushed the box next to him one square to the right.
What to do next?

The solver will consider every possible next push: all possible pushes of the higher box and all possible pushes of the lower box. But: The higher box is in a tunnel - the just performed push has been a "no influence push".
The reason is:
The squares the lower box can ever be pushed to stayed the same. There aren't any additional squares the lower box can reach, nor are there any squares the lower box can't reach due to the push of the higher box.
The just pushed box has definitely to be pushed sooner or later. So there is no reason why not to push it further to the right immediately!

In general such a "no influence push" is always created when the situation AFTER the push looks like this (or any flipped / mirrored version of it):

[[Image:TunnelExample2.png]] or [[Image:TunnelExample3.png]]

Every time a push of a box results in such a situation the box can immediately be pushed one square further!
This rule can reduce the number of states to be generated in some levels a lot.

=== PI-Corrals ===

This section describes an admissible domain-dependent move pruning technique for the Sokoban game called PI-Corral pruning.

PI-Corral pruning has highly attractive properties for a Sokoban solver program:
* It prunes a significant number of states from the search
* It steers the search towards positions with a certain class of deadlocks, thereby helping to detect these deadlocks early on, increasing the pruning even further
* It preservers push-optimality guarantees provided by the solver

PI-Corral pruning leverages the same idea that is also used for pruning due to tunnels:
It identifies pushes that don’t influence certain parts of the board and then ignores all boxes that aren’t influenced by the performed push.

A simple example of a PI-Corral: 
[[Image:ICorralExample1.png]]

In this level the player just has pushed the box to the left.

Normally the solver now generates all possible pushes for all boxes including the box in the lower right corner. The push creates an area the player can't reach marked with a [[Image:BlueQuadrat.png]].

The boxes that are part of this area can only be pushed inside this corral (= on squares that are marked) with the next push. Hence, these pushes don’t have any impact on the rest of the level. The reachable player positions aren’t reduced and also the reachable positions of the box in the lower right part of the board aren’t reduced.

At least one of boxes at the border of the marked area must be pushed into that area sooner or later.
This is always necessary when a box at the border or inside the area isn't located at a goal square, or when a goal square inside the area isn't filled with a box.
In the current position, the player can make all the possible pushes which ever can be made into the marked area. Therefore, the solver just needs to generate the pushes for the boxes at the border of the marked area. The legal pushes for all other boxes on the board can be ignored.

This can reduce the pushes to be generated a lot - particularly when there are a lot of boxes in the level that aren't involved in the PI-Corral.

The key insight with PI-corrals is the fact that as the boxes on its barrier can only be pushed inwards, one of them will indeed have to be pushed there before any of the boxes in the corral can be pushed elsewhere.
So, if the corral has to be dealt with eventually, it is best to deal with it right away and all pushes of other boxes can be discarded. 

The reason that this works, and that it only applies to PI-corrals and not other corral types is due to box influence. 
In a PI-corral no other box can be influenced by the fact that a box is pushed into the corral, because any boxes outside the PI-corral are by definition either accessible or inaccessible regardless of whether the player can walk in the area of the corral, while boxes completely inside the corral (not on the boundary) are by definition inaccessible to the player and could not be pushed before the corral is dealt with. 
In other words: all the pushes of boxes not part of the PI-Corral are still possible after a box is pushed into the PI-Corral.

==== Terms and Definitions ====

;Corral
:The boxes and walls on the board can split the board into several areas.
:An area of the board which the player cannot reach, surrounded by a barrier made of one or more boxes, and any number of walls is called “corral”.
:The corral includes all the boxes on the barrier between the inside and the outside of the corral, and all interior boxes, if any.
:
:An example corral:
:[[Image:CorralExample.png]]
:Positions part of the corral are marked with [[Image:BlueQuadrat.png]].

;I-Corral
:A corral where all boxes on the barrier can only be pushed inwards (into the corral) by the first push.
:The "I" in "I-corral" is a reference to "inside" or "inward".
:
:An example corral:
:[[Image:I-CorralExample.png]]
:Positions part of the I-corral are marked with [[Image:BlueQuadrat.png]].
:Note how in this I-Corral example (in contrast to the Corral example) it's not possible to push any box to a position not part of the corral.

;PI-Corral
:An I-Corral where the player can perform all legal first pushes into the corral, 
:meaning the player can reach all the relevant boxes from all relevant directions.
:The "P" in "PI-Corral" is a reference to "player" or "pusher".
:A "PI-Corral" is the important sub-class of the I-Corrals where the player can reach all the boxes on the barrier of the corral and perform all their legal inwards pushes.
:An example PI-Corral:
:[[Image:PI-CorralExample.png]]
:The boxes on the barrier of the PI-Corral are highlighted in red.
: 
:Counter-example: an I-Corral which isn't a PI-Corral because of the outside blocking box:
:[[Image:PI-CorralCounterExample.png]]
:This example isn't a PI-Corral because the player cannot push the highlighed box inwards; 
:there is an outside box that blocks the access. 
:Note that if that outer box was a wall then the level is a PI-Corral:
:[[Image:PI-CorralExample2.png]]
:The rule is: the player must be able to perform all legal inwards pushes of the PI-Corral boxes on the barrier.
:This can be checked: remove all boxes which aren’t part of the PI-Corral, then compare the possible pushes.

==== PI-Corral Pruning ====

The PI-Corral property in itself is not enough to permit pruning states from the search. 
There is the additional constraint that sooner or later, at least one of the boxes on the barrier must be pushed into the corral in order to solve the puzzle. 
There are different reasons why such a push may be necessary, so this constraint can be implemented with various degrees of sophistication.

The constraint "Pruning is only permitted if at least one box in the PI-Corral is not on a goal square, or if at least one goal square in the PI-Corral does not contain a box" can be implemented by simple inspection of the board position.

A more sophisticated solver may form plans which permit pruning for more involved reasons, e.g., "The player must pass though the corral", or "A box from the outside must be parked inside the corral".

If there is a PI-Corral and one of the involved boxes has to be pushed in any way to solve the level then PI-Corral pruning can be applied.
That means in such a situation the solver only has to generate pushes for boxes part of the PI-Corral but not for boxes outside the PI-Corral.

The key-insight is this: pushing a box inwards, into the PI-Corral, never affects the player's access to boxes outside the PI-Corral. Therefore, when we choose which box to push next, we might as well push one of the PI-Corral-boxes because we have to do that sooner or later anyway.

In the next push, we still have full access to all boxes outside the corral so we can pick one of them, if we wish to. However, if there still is a PI-corral on the board, we continue only checking if PI-Corral pruning can be used and if yes, we again only consider the PI-Corral-boxes for generating new board positions.

So the bottom line is that for each position we meet during the solving process, we first check for PI-corral pruning, and if it can be applied, we never generate pushes for boxes outside the PI-corral.

A very simple example of a PI-Corral is a tunnel: 
[[Image:PI-CorralTunnel.png]]

In this simple PI-Corral all conditions are fulfilled:
# there is a corral
# all possible pushes of the boxes on the corral barrier are pushes into the corral
# at least one of the boxes in the corral has to be pushed to solve the level
# the player can perform already now all theoretically possible legal pushes (not generating a deadlock) into the corral

Hence PI-Corral pruning can be applied and only pushes of the marked box must be considered for the next push.

In this simple example the key idea behind PI-Corral pruning becomes clear: 
There may be some complicated push sequences needed to push the boxes outside the PI-Corral to goals. However, no matter how complex these push sequences may be: all of these pushes are still possible after the box has been pushed into the PI-Corral. 
The push of the box into the PI-Corral has no "influence" on the rest of the level.

==== Multi Room PI-Corral ====
It's rather seldom that a board position contains simple PI-Corrals like the one depicted above. 
Even when there is an I-Corral, the player seldom has access to all the boxes (from all the required directions). 
Often, the player's access to the I-Corral boxes is blocked by neighboring corrals like in this (small) example: 
[[Image:MultiRoomPICorralExample1.png]]

Neither does the top-left corral (red border) nor the neighboring corral (blue border) fulfill all PI-Corral constraints. 
In both cases there is a box which can't be pushed into the corral at the moment (the box having a red and a blue border).

However, both corrals can be combined to a multi room corral. 
The combined corral then fulfills all PI-Corral constraints: 
[[Image:MultiRoomPICorralExample2.png]]

In order to find these Multi Room PI-Corrals the algorithm combines corral after corral until a (multi room) PI-Corral has been found. 
This way the algorithm also ensures that there are as few boxes in the found PI-Corral as possible.

Example: 
[[Image:MultiRoomPICorralExample3.png]]

The marked area is a (combined) PI-Corral, since the boxes can only be pushed into the corral and all of the legal pushes are currently possible.

However, when the algorithm starts with the top-left I-Corral, this corral is classified being a PI-Corral without the need to combine it with another corral: 
[[Image:MultiRoomPICorralExample4.png]]

This means instead of two boxes there is only one single box to consider for the next push.

Note: 
After having pushed the PI-Corral box one square into the PI-Corral there are two PI-Corrals now: 
[[Image:twoPICorralsExample.png]]

In such a situation the solver can choose which PI-Corral to consider first. 

This is another example showing the importance of the algorithm only combining corrals if necessary: 
[[Image:SinglePICorralExample.png]]

This example also shows that a deadlock detection can help identifying PI-Corrals. 
The marked PI-Corral has two boxes. 
However, only one of the boxes can currently be pushed into the PI-Corral. 
Nevertheless it's a PI-Corral because pushing the lower left box of the PI-Corral into the PI-Corral creates a deadlock and therefore this isn't a legal/valid push.

==== Deadlock Situations ====
PI-Corral pruning can help detecting deadlocks earlier as a side-effect of successor-pruning.

If there is a (smallish) deadlock situation on the board consisting of a PI-Corral, then pruning leads to a position where the legal moves dry out, in effect finding a deadlock like in this (very small) example: 
[[Image:DeadlocksAndPICorrals.png]]

The solver only considers these boxes for the next push. Since no further legal push is possible (assumed that “freeze deadlocks" can be detected by the solver) a deadlock is detected.

==== Statistics ====
In his [[Sokoban solver "scribbles" by Brian Damgaard about the YASS solver|solver scribbles]] Brian Damgaard wrote:

There is always an overlap when different pruning techniques are used in a solver, but conservatively speaking, this new technique [PI-Corral pruning] is itself able to prune at least 20% of the search tree according to my experiments, and empirically the savings always outweighs the extra costs.

My program uses precalculated deadlocks to handle simple deadlocks like this one, but the corral-pruning is a valuable contribution to the program, and experiments shows that the corral-pruning almost can hold its candle to the precalculated deadlocks, if it is asked to do so:

Statistics - SokEvo/107 - Forwards search - no packingorder - AMD 2600+
Configuration A: A* search + transposition table
Configuration B: A* search + transposition table + corrals
Configuration C: A* search + transposition table + precalculated deadlocks
Configuration D: A* search + transposition table + precalculated deadlocks + corrals

"B" is the experiment with corrals only, without precalculated deadlocks, and its 21 seconds (on my amd 2600+ pc) is in the same league as the "C" experiment with precalculated deadlocks but no corral-pruning.
"D" with all currently implemented pruning techniques reduces the total solving time to 7 seconds, showing that the different pruning techniques work well together.

{| class="soko-table"
|-


! colspan="4" | Solver Statistics
|- bgcolor="#f1efe5" align="center"
| | Configuration
| | Generated states
| | Pushes
| | Time


|- align="right"
| align="left" bgcolor="#f1efe5" | A
| | 11974023
| 51938064
| 65 seconds


|- align="right"
| align="left" bgcolor="#f1efe5" | B
| | 4632203
| 11918161
| 21 seconds


|- align="right"
| align="left" bgcolor="#f1efe5" | C
| | 2030736
| 7011203
| 11 seconds


|- align="right"
| align="left" bgcolor="#f1efe5" | D
| | 1231376
| 3299797
| 7 seconds

|}

==== Temporary Auxiliary Pushes ====
Usually there are a lot of I-Corrals for which the player can’t perform all inwards pushes at the moment.

Example: 
[[Image:temporaryAuxiliaryPushes.png]]

One box is blocking the player from pushing one of the boxes into the I-Corral.

An obvious aim now is to push this blocking box away to create a PI-Corral. 
This destroys push optimally guarantees but results in more detected PI-Corrals and therefore in a smaller search tree for the solver.

One way to check whether the box can be pushed away is to check whether the box can be pushed away and then immediately back to where it is now. If this is possible, we can perform all pushes into the I-Corral and after that is done the blocking box is always back where it is now.

Currently this is not implemented in any solver.

A subclass of those “I-Corrals with access blocking boxes” could be used for pruning with some further investigations.

Example: 
[[Image:temporaryAuxiliaryPushes2.png]]

The marked box of the I-Corral can’t be reached by the player. 
However, through further calculations the program could prove that the I-Corral can never be opened by pushing this box. 
Pushing the box into the corral does never allow the player to push any other corral boxes. 
Hence, in these seldom situations even pruning on I-Corrals may be applied. 
This also preserves push optimality.

==== "Real world" PI-Corral Examples ====

The program [http://www.sokoban-online.de JSoko]. offers a debug mode for testing PI-Corral pruning. 
The shown example PI-Corrals are taken from JSoko version 1.81 having that debug setting activated.

To let JSoko highlight the found PI-Corrals:
# Start JSoko
# Type the letters “debug” when JSoko has the keyboard focus. This shows a new menu called “debug”
# In the debug menu select “Show I-Corral during solving"

Note: although the menu text is ''"Show '''I-Corral'''"'' JSoko will show '''PI-Corrals''' and only those for which PI-Corral pruning can be applied.

Note 2: PI-Corrals that include all boxes on the board aren’t shown by JSoko since there is no benefit in applying pruning when all boxes are part of the PI-Corral.

When the PI-Corral debug settings is activated JSoko will check for PI-Corrals and highlight them after every push that is made.

Thinking Rabbit - Original Level 1: 
[[Image:OriginalLevel1PICorral.png]]

Due to PI-Corral pruning the solver has only to consider the PI-Corral boxes for the next push, only one of which is currently reachable for the player. 
This example shows that a deadlock detection can help detecting PI-Corrals.

The lower left box of the PI-Corral isn't reachable by the player at the moment. 
However, both pushes of that box would result in a [[Deadlocks#Freeze deadlocks|freeze deadlock]]. 
Hence, no legal push is possible for this box.

Thinking Rabbit - Original Level 3: 
[[Image:OriginalLevel3PICorral.png]]

In the shown situation the solver has choose which PI-Corral to consider first.

Thinking Rabbit - Original Level 4: 
[[Image:OriginalLevel4PICorral.png]]

There is a huge multi room PI-Corral containing nearly all of the boxes. 
Nevertheless, PI-Corral pruning can also help pruning some states for the solver in such situations where only one box is outside the PI-Corral.

Thinking Rabbit - Original Level 6: 
[[Image:OriginalLevel6PICorral.png]]

This is an example where a sophisticated deadlock detection can help to detect more PI-Corrals.

Thinking Rabbit - Original Level 10: 
[[Image:OriginalLevel10PICorral.png]]

This example shows that JSoko detects some PI-Corrals where pruning is possible but not that useful. 
Since there is only possible push there is nothing to be pruned.

Thinking Rabbit - Original Level 15: 
[[Image:OriginalLevel15PICorral.png]]

The player is surrounded by a huge multi room PI-Corral. 
Every push of one of the PI-Corral boxes results in a further PI-Corral that can be used for pruning.

Figure 3 level of an article about PI-Corral pruning: 
[[Image:DDMPFigure3Level.png]]

There is an article about PI-Corrals written by Renato R. Leme, André G. Pereira, Marcus Ritt and Luciana S. Buriol where the authors claim that JSoko and YASS can't detect the correct PI-Corral in the shown level.

However, the screenshot shows that JSoko can correctly identify all the boxes and positions that are part of the PI-Corral (and so does YASS)! 
Note: an additional box has been added to this example level (the box on the goal below the player) because JSoko only highlights PI-Corrals that don't contain all boxes. However, this extra box doesn't affect the PI-Corral detection used in JSoko (and YASS).

== Parking ==
Many levels cannot be solved by just pushing one box at a time to the goal position.

Most levels are constructed in such a way that some of the boxes have to be specifically rearranged to make room for pushing other boxes.

In some cases boxes have to be actually pushed over a goal position to a “parking” position, from where they can then later be pushed to their final goal position.

Example: 
[[Image:parking example.png]]

== YASS Solver ==

[[Sokoban solver "scribbles" by Brian Damgaard about the YASS solver]]

== Sokolution Solver ==

[[Sokoban solver "scribbles" by Florent Diedler about the Sokolution solver]]

== Solver "Rolling Stone" ==

[[Rolling Stone solver]]

== Limited search ==

Ideas by David Holland on computer solving by limited search are linked below. They aren't fully wikified yet as author has RSI. Features new concepts such as free space, shuffling, relocation and generalized deadlock detection. Sketches of algorithms included. Other new concepts such as goal traps with algorithms may be implemented in existing solvers. Author hopes other programmers will discuss and implement what they find relevant. Limited search as opposed to exhaustive search uses macros, heuristics and domain-specific knowledge to effectively search deeper in the tree of positions by not looking at every position. A new category of "Planner" plug-in is suggested for limited search to be tried when the Solver plug-in fails, indicating too large a tree.
[[David Holland's computer Sokoban solving ideas]]

== See also ==

* A Spanish explanation of the [[MSAMA Sokoban Solver]].
* [[Heiner's solver]]
* [[Solving Sokoban Optimally with Domain-Dependent Move Pruning - Stolen Ideas, Lies, and Incompetence]]

Rolling Stone solver

2024-03-21T15:16:17Z

Matthias Meger: /* Main menu */ Description how to start the solver

The Rolling Stone Sokoban solver is a significant milestone in the field of automated Sokoban puzzle solving. Developed at the University of Alberta by Andreas Junghanns and Jonathan Schaeffer, it laid the groundwork for many modern solvers.

Here's a breakdown of Rolling Stone's key aspects:

= Algorithm =

Rolling Stone utilizes the Iterative Deepening A* (IDA*) algorithm as its core search strategy.

IDA* is an iterative deepening search algorithm that combines the efficiency of depth-first search with the optimality guarantees of A* search.

It starts by searching for a solution with a limited depth and gradually increases the depth limit until a solution is found or it's proven that no solution exists within that depth.

To improve search efficiency, Rolling Stone incorporates several enhancements described in various [https://scholar.google.com/scholar?hl=de&as_sdt=0%2C5&q=rolling+stone+sokoban&btnG= papers].

Rolling Stone's approach paved the way for further advancements in Sokoban solver design. Many modern solvers build upon its core principles.

It demonstrated the effectiveness of combining general search algorithms with domain-specific enhancements for efficiently solving Sokoban puzzles.

Further information can be found in the [https://scholar.google.com/scholar?hl=de&as_sdt=0%2C5&q=rolling+stone+sokoban&btnG= papers] or on the [https://webdocs.cs.ualberta.ca/~games/Sokoban/ website of Rolling Stone].

= How to compile Rolling Stone =

Carlos Montiers has published a source code that has been adapted so that it can also be compiled with modern operating systems and compilers. In this way, Rolling Stone can still be used today.

This is the link to his repository: [https://github.com/carlos-montiers/rolling-stone Carlos Montiers Rolling Stone]

= Screenshot Rolling Stone =

Rolling Stone can only be used from the console.

This is an example output of the solver when solving puzzle "XSokoban 1"

[[File:Rolling Stone XSokoban1.png]]

= Menu structure =

== Main menu ==

{| class="soko-table"
!Command || Function
|-
|S nam\num kind || Solve Maze
|-
|A || Set Abort Node Count
|-
|T sec [REAL\VIRT] || Set Abort time
|-
|C a b kind || Test a to b in screen
|-
|P nam\num kind || Print Maze
|-
|L a b kind || All 90 Lower Bounds
|-
|N num || Set PosNr with num
|-
|M num-num\XX-YY || move from num to num
|-
|X [lrud]* || move center for xdist
|-
|Z || Show Menu
|-
|O || Options Menu
|-
|Q || Quit Program
|-
|}

The command "'''S 1'''" loads the puzzle "./screens/screen.1" and tries to solve it.

The command "'''S 1 test'''" loads the puzzle "./screens/test.1" and tries to solve it.

The command "'''S test.sok'''" loads the puzzle "./test.sok" and tries to solve it.

== Show menu ==

{| class="soko-table"
!Command || Function
|-
|D || Hist of man-distances
|-
|S || Hist of stone-distances
|-
|X || Hist of X-distances
|-
|C || Print Conflicts prev search
|}

== Options menu ==

{| class="soko-table"
!Command || Function
|-
|E || Examine all settings
|-
|H [on/off] || HashTable on/off
|-
|D [on/off] || deadlock det. movegen on/off
|-
|Z [on/off] || deadlock2 det. movegen on/off
|-
|R [on/off] || areasearch on/off
|-
|S [on/off] || deadsearch on/off
|-
|N [on/off] || pensearch on/off
|-
|W [on/off] || scan search on/off
|-
|J number || node limit for pattern searches
|-
|K [on/off] || minimization on/off
|-
|Y [on/off] || limit patterns on/off
|-
|m [on/off] || lazy maximization on/off
|-
|X [on/off] || store tested on/off
|-
|P number || Switch Pattern DBs on/off (0-7)
|-
|M [on/off] || LB manpos on/off
|-
|C [on/off] || LB conflict on/off
|-
|d [on/off] || Dynamic distances on/off
|-
|T [on/off] || Tunnel Macro on/of
|-
|G [on/off] || Goal Macro on/off
|-
|U [on/off] || Cut Goal Macro on/off
|-
|A [on/off || eXtended Distance on/off
|-
|L k m d || Local Cut (k,m,d), -1 -1 turns off
|-
|B [on/off || Auto Set Local Cut Parameter
|-
|V [s] [h] || Overestimation scaling factor and h-scaling
|-
|F [on/off] || Assume dead on/off
|-
|O number || Set Move order index (0-off)
|}

== General command ==

{| class="soko-table"
!Command || Function
|-
|? || Help command. Displays availible menu options
|-
|< || Back (quit)
|}

File:Rolling Stone XSokoban1.png

2024-03-21T10:21:23Z

Matthias Meger:

File:Sokoban Puzzle solving.gif

2024-03-07T13:42:02Z

Matthias Meger: Example: Solving a Sokoban puzzle

Example: Solving a Sokoban puzzle

SolverStatistics-Festival-GroupEffort-Small-Set

2023-02-02T15:14:34Z

Matthias Meger: new Festival 3.1 results

SolverStatistics-Festival-GroupEffort-Large-Set

2023-02-02T15:11:21Z

Matthias Meger: new Festival 3.1 results

;Program: Festival 3.1
;RAM for solver: Default settings
;CPU: Intel(R) Core(TM) i7-10700F
;Solving method: Default settings
;Time limit: 600 seconds

Task Time Plugin Result Moves Pushes Level
1 00:00:03 Festival 3.1 OK 653 156 Grigr_Special1
2 00:00:01 Festival 3.1 OK 645 138 Grigr_Special10
3 00:00:01 Festival 3.1 OK 192 46 Grigr_Special11
4 00:00:02 Festival 3.1 OK 617 138 Grigr_Special12
5 00:00:01 Festival 3.1 OK 517 139 Grigr_Special13
6 00:00:01 Festival 3.1 OK 556 136 Grigr_Special14
7 00:00:03 Festival 3.1 OK 661 196 Grigr_Special15
8 00:00:04 Festival 3.1 OK 828 177 Grigr_Special16
9 00:00:01 Festival 3.1 OK 392 105 Grigr_Special17
10 00:00:00 Festival 3.1 OK 404 99 Grigr_Special18
11 00:00:01 Festival 3.1 OK 761 174 Grigr_Special19
12 00:00:03 Festival 3.1 OK 823 147 Grigr_Special2
13 00:00:01 Festival 3.1 OK 399 89 Grigr_Special20
14 00:00:01 Festival 3.1 OK 264 69 Grigr_Special21
15 00:00:00 Festival 3.1 OK 388 69 Grigr_Special22
16 00:00:01 Festival 3.1 OK 255 77 Grigr_Special23
17 00:00:08 Festival 3.1 OK 1081 249 Grigr_Special24
18 00:00:01 Festival 3.1 OK 452 115 Grigr_Special25
19 00:00:02 Festival 3.1 OK 1079 180 Grigr_Special26
20 00:00:00 Festival 3.1 OK 231 76 Grigr_Special27
21 00:00:01 Festival 3.1 OK 613 163 Grigr_Special28
22 00:00:01 Festival 3.1 OK 307 78 Grigr_Special29
23 00:00:00 Festival 3.1 OK 559 97 Grigr_Special3
24 00:00:01 Festival 3.1 OK 427 103 Grigr_Special30
25 00:00:01 Festival 3.1 OK 340 95 Grigr_Special31
26 00:00:00 Festival 3.1 OK 289 68 Grigr_Special32
27 00:00:01 Festival 3.1 OK 390 82 Grigr_Special33
28 00:00:00 Festival 3.1 OK 372 98 Grigr_Special34
29 00:00:01 Festival 3.1 OK 352 75 Grigr_Special35
30 00:00:01 Festival 3.1 OK 478 104 Grigr_Special36
31 00:00:00 Festival 3.1 OK 551 145 Grigr_Special37
32 00:00:01 Festival 3.1 OK 306 89 Grigr_Special38
33 00:00:01 Festival 3.1 OK 312 91 Grigr_Special39
34 00:00:00 Festival 3.1 OK 470 129 Grigr_Special4
35 00:00:01 Festival 3.1 OK 562 126 Grigr_Special5
36 00:00:02 Festival 3.1 OK 787 214 Grigr_Special6
37 00:00:01 Festival 3.1 OK 335 105 Grigr_Special7
38 00:00:02 Festival 3.1 OK 456 114 Grigr_Special8
39 00:00:01 Festival 3.1 OK 368 117 Grigr_Special9
40 00:00:01 Festival 3.1 OK 271 70 grigr2001Antena_32
41 00:00:01 Festival 3.1 OK 245 65 grigr2001Babochka_90
42 00:00:47 Festival 3.1 OK 1890 264 grigr2001Bardak_01
43 00:00:01 Festival 3.1 OK 218 60 grigr2001Big_uborka_79
44 00:00:00 Festival 3.1 OK 375 76 grigr2001Bumerang_34
45 00:00:01 Festival 3.1 OK 214 52 grigr2001Burlak_26
46 00:00:01 Festival 3.1 OK 251 60 grigr2001CFL_80
47 00:00:00 Festival 3.1 OK 218 44 grigr2001Cheburek_12
48 00:00:01 Festival 3.1 OK 81 20 grigr2001Cherta_56
49 00:00:01 Festival 3.1 OK 398 52 grigr2001Chmoki_23
50 00:00:00 Festival 3.1 OK 166 25 grigr2001Comci-comca_08
51 00:00:01 Festival 3.1 OK 168 40 grigr2001DenPo_59
52 00:00:01 Festival 3.1 OK 110 22 grigr2001Derji_Morda_57
53 00:00:00 Festival 3.1 OK 281 78 grigr2001Domovoy_96
54 00:00:01 Festival 3.1 OK 264 50 grigr2001Dva_brata_52
55 00:00:01 Festival 3.1 OK 260 66 grigr2001Dva_Torchka_46
56 00:00:00 Festival 3.1 OK 369 71 grigr2001Dve_dorogi_71
57 00:00:02 Festival 3.1 OK 414 78 grigr2001Egoza_(17r)_76
58 00:00:00 Festival 3.1 OK 456 122 grigr2001Flip-Flop_42
59 00:00:01 Festival 3.1 OK 169 41 grigr2001Gantel_45
60 00:00:09 Festival 3.1 OK 466 75 grigr2001GirLand_19
61 00:00:00 Festival 3.1 OK 160 39 grigr2001GKI_35
62 00:00:01 Festival 3.1 OK 588 100 grigr2001Green_key_48
63 00:00:01 Festival 3.1 OK 405 72 grigr2001Karusel_73
64 00:00:01 Festival 3.1 OK 460 97 grigr2001Katenka_33
65 00:00:00 Festival 3.1 OK 235 42 grigr2001Kino_21
66 00:00:01 Festival 3.1 OK 280 67 grigr2001Kompas_69
67 00:00:00 Festival 3.1 OK 252 56 grigr2001Korona_27
68 00:00:01 Festival 3.1 OK 253 57 grigr2001Krenol_11
69 00:00:01 Festival 3.1 OK 141 40 grigr2001Krestik_31
70 00:00:01 Festival 3.1 OK 474 80 grigr2001Krik_87
71 00:00:01 Festival 3.1 OK 282 61 grigr2001Kubiki_36
72 00:00:00 Festival 3.1 OK 213 39 grigr2001Kubizm_55
73 00:00:01 Festival 3.1 OK 255 40 grigr2001Lastochki_(08r)_44
74 00:00:00 Festival 3.1 OK 206 52 grigr2001Little_night_93
75 00:00:01 Festival 3.1 OK 207 46 grigr2001LM_13
76 00:00:01 Festival 3.1 OK 184 52 grigr2001LoLa_(93r)_89
77 00:00:01 Festival 3.1 OK 674 155 grigr2001Luja_81
78 00:00:00 Festival 3.1 OK 321 71 grigr2001Magazine_28
79 00:00:01 Festival 3.1 OK 247 84 grigr2001Mapat_91
80 00:00:01 Festival 3.1 OK 158 44 grigr2001Master_92
81 00:00:00 Festival 3.1 OK 225 52 grigr2001Metro_67
82 00:00:02 Festival 3.1 OK 522 110 grigr2001Miasorubka_(07r)_20
83 00:00:00 Festival 3.1 OK 112 30 grigr2001Miner_72
84 00:00:01 Festival 3.1 OK 134 29 grigr2001Mini_zagadka_58
85 00:00:01 Festival 3.1 OK 337 94 grigr2001Minutka_98
86 00:00:02 Festival 3.1 OK 843 164 grigr2001Monster_61
87 00:00:00 Festival 3.1 OK 1191 232 grigr2001MoraSoft_15
88 00:00:01 Festival 3.1 OK 243 68 grigr2001New_year's_fir_tree_94
89 00:00:02 Festival 3.1 OK 316 74 grigr2001Nitka_30
90 00:00:01 Festival 3.1 OK 329 105 grigr2001Okno_41
91 00:00:00 Festival 3.1 OK 305 53 grigr2001One_left_60
92 00:00:02 Festival 3.1 OK 768 120 grigr2001Only_you_100
93 00:02:53 Festival 3.1 OK 1827 439 grigr2001Original_conversion_(15)_84
94 00:10:01 Festival 3.1 Time limit exceeded grigr2001Original_conversion_(22)_78
95 00:10:01 Festival 3.1 Time limit exceeded grigr2001Original_conversion_(42)_02
96 00:00:00 Festival 3.1 OK 214 50 grigr2001Osen_22
97 00:00:01 Festival 3.1 OK 163 52 grigr2001Pereprig_10
98 00:00:00 Festival 3.1 OK 212 67 grigr2001Povorot_29
99 00:00:01 Festival 3.1 OK 130 30 grigr2001Radost_97
100 00:00:01 Festival 3.1 OK 220 51 grigr2001Raketa_37
101 00:00:00 Festival 3.1 OK 219 49 grigr2001Rassvet_47
102 00:00:05 Festival 3.1 OK 1499 294 grigr2001Rebus_40
103 00:00:01 Festival 3.1 OK 298 43 grigr2001Resheto_51
104 00:00:01 Festival 3.1 OK 168 44 grigr2001Rojdestvo_62
105 00:00:00 Festival 3.1 OK 477 71 grigr2001Rostok_43
106 00:00:01 Festival 3.1 OK 287 61 grigr2001Salto_(94r)_95
107 00:00:01 Festival 3.1 OK 352 80 grigr2001Salut_(86r)_85
108 00:00:01 Festival 3.1 OK 147 40 grigr2001Samogonka_99
109 00:00:01 Festival 3.1 OK 384 73 grigr2001Semechki_64
110 00:00:01 Festival 3.1 OK 450 108 grigr2001Sharlotka_70
111 00:00:01 Festival 3.1 OK 328 68 grigr2001Shito-Krito_86
112 00:00:01 Festival 3.1 OK 238 50 grigr2001Snake_38
113 00:00:02 Festival 3.1 OK 330 61 grigr2001Snejinki_50
114 00:00:00 Festival 3.1 OK 249 70 grigr2001SokoBat_18
115 00:00:01 Festival 3.1 OK 143 31 grigr2001Strelka_25
116 00:00:01 Festival 3.1 OK 387 88 grigr2001Tamagochi_82
117 00:00:00 Festival 3.1 OK 288 89 grigr2001Telefon_75
118 00:00:01 Festival 3.1 OK 386 69 grigr2001The_disorder_07
119 00:00:02 Festival 3.1 OK 590 186 grigr2001The_doors_66
120 00:00:00 Festival 3.1 OK 469 87 grigr2001The_X_53
121 00:00:01 Festival 3.1 OK 591 86 grigr2001Tiskoteka_54
122 00:00:01 Festival 3.1 OK 262 35 grigr2001Track_04
123 00:00:01 Festival 3.1 OK 223 53 grigr2001TriNaTri_83
124 00:00:00 Festival 3.1 OK 268 55 grigr2001Triple_Shelf_06
125 00:00:01 Festival 3.1 OK 218 54 grigr2001Ugolok_65
126 00:00:01 Festival 3.1 OK 78 17 grigr2001Uje_polnoch_16
127 00:00:00 Festival 3.1 OK 78 10 grigr2001updown_05
128 00:00:01 Festival 3.1 OK 166 28 grigr2001Ustal_88
129 00:00:00 Festival 3.1 OK 360 121 grigr2001Verenica_14
130 00:00:01 Festival 3.1 OK 345 61 grigr2001Vorona_49
131 00:00:01 Festival 3.1 OK 93 11 grigr2001Vverh_63
132 00:00:00 Festival 3.1 OK 534 119 grigr2001Xolodok_39
133 00:00:01 Festival 3.1 OK 159 26 grigr2001Zanoza_17
134 00:00:01 Festival 3.1 OK 227 42 grigr2001Zapiataya_74
135 00:00:00 Festival 3.1 OK 269 51 grigr2001Zavhoz_24
136 00:00:01 Festival 3.1 OK 120 26 grigr2001Zerkalo_77
137 00:00:01 Festival 3.1 OK 718 183 grigr2001Zigzag_03
138 00:00:00 Festival 3.1 OK 372 53 grigr2001Zimushka_Zima_68
139 00:00:01 Festival 3.1 OK 751 138 grigr2001Zontik_09
140 00:00:01 Festival 3.1 OK 342 75 grigr2002Anchor_106
141 00:00:00 Festival 3.1 OK 402 107 grigr2002Aniska_111
142 00:00:08 Festival 3.1 OK 567 135 grigr2002Blue_Eye_126
143 00:00:01 Festival 3.1 OK 483 117 grigr2002Colobok_103
144 00:00:01 Festival 3.1 OK 442 111 grigr2002Contra_108
145 00:00:01 Festival 3.1 OK 898 226 grigr2002Depth_120
146 00:00:01 Festival 3.1 OK 746 186 grigr2002Double_choice_101
147 00:00:01 Festival 3.1 OK 544 146 grigr2002Dreams_117
148 00:02:05 Festival 3.1 OK 1274 251 grigr2002Father_diode_110
149 00:00:02 Festival 3.1 OK 704 145 grigr2002Flying_idea_132
150 00:00:01 Festival 3.1 OK 550 138 grigr2002for_Paul_130
151 00:00:01 Festival 3.1 OK 780 252 grigr2002Honour_121
152 00:00:01 Festival 3.1 OK 603 144 grigr2002Irka_118
153 00:02:15 Festival 3.1 OK 838 226 grigr2002Juravli_140
154 00:00:01 Festival 3.1 OK 871 162 grigr2002Krasotka_109
155 00:00:01 Festival 3.1 OK 729 130 grigr2002Kruchok_105
156 00:00:02 Festival 3.1 OK 769 162 grigr2002KUB_123
157 00:00:01 Festival 3.1 OK 908 233 grigr2002Kuterma_114
158 00:00:01 Festival 3.1 OK 948 263 grigr2002Mad_Dog_139
159 00:00:01 Festival 3.1 OK 397 103 grigr2002Marazm_122
160 00:00:01 Festival 3.1 OK 506 161 grigr2002Mekom_135
161 00:00:01 Festival 3.1 OK 443 114 grigr2002My_heart_113
162 00:01:43 Festival 3.1 OK 820 207 grigr2002Nadejda_131
163 00:00:02 Festival 3.1 OK 721 195 grigr2002Oberon_136
164 00:00:01 Festival 3.1 OK 336 78 grigr2002Perekrestok_129
165 00:00:02 Festival 3.1 OK 591 182 grigr2002Pryanik_124
166 00:00:00 Festival 3.1 OK 315 67 grigr2002Red_star_104
167 00:00:01 Festival 3.1 OK 816 167 grigr2002Return_107
168 00:00:02 Festival 3.1 OK 579 135 grigr2002Rogalik_134
169 00:00:03 Festival 3.1 OK 575 149 grigr2002Sambist_133
170 00:00:02 Festival 3.1 OK 723 186 grigr2002Serpik_112
171 00:00:01 Festival 3.1 OK 445 101 grigr2002Sheriff_116
172 00:00:01 Festival 3.1 OK 571 140 grigr2002SokoSutra_137
173 00:00:01 Festival 3.1 OK 534 152 grigr2002Suriken_138
174 00:00:01 Festival 3.1 OK 780 171 grigr2002Svadba_125
175 00:00:01 Festival 3.1 OK 593 170 grigr2002Trevoga_115
176 00:00:04 Festival 3.1 OK 927 258 grigr2002Uspex_128
177 00:00:01 Festival 3.1 OK 576 106 grigr2002Wake_up_102
178 00:00:01 Festival 3.1 OK 562 115 grigr2002Zagar_119
179 00:07:22 Festival 3.1 OK 1537 246 grigr2002Ziko-City_127
180 00:00:01 Festival 3.1 OK 196 48 HandmadeSoko001
181 00:00:00 Festival 3.1 OK 100 19 HandmadeSoko002
182 00:00:01 Festival 3.1 OK 115 14 HandmadeSoko003
183 00:00:01 Festival 3.1 OK 110 13 HandmadeSoko004
184 00:00:00 Festival 3.1 OK 85 16 HandmadeSoko005
185 00:00:01 Festival 3.1 OK 98 28 HandmadeSoko006
186 00:00:00 Festival 3.1 OK 59 10 HandmadeSoko007
187 00:00:02 Festival 3.1 OK 628 165 HandmadeSoko008
188 00:00:00 Festival 3.1 OK 173 38 HandmadeSoko009
189 00:00:01 Festival 3.1 OK 43 14 HandmadeSoko010
190 00:00:01 Festival 3.1 OK 103 14 HandmadeSoko011
191 00:00:00 Festival 3.1 OK 104 26 HandmadeSoko012
192 00:00:01 Festival 3.1 OK 693 239 HandmadeSoko013
193 00:00:01 Festival 3.1 OK 299 51 HandmadeSoko014
194 00:00:00 Festival 3.1 OK 55 16 HandmadeSoko015
195 00:00:01 Festival 3.1 OK 80 21 HandmadeSoko016
196 00:00:00 Festival 3.1 OK 99 27 HandmadeSoko017
197 00:00:01 Festival 3.1 OK 250 61 HandmadeSoko018
198 00:00:01 Festival 3.1 OK 143 29 HandmadeSoko019
199 00:00:00 Festival 3.1 OK 242 47 HandmadeSoko020
200 00:00:01 Festival 3.1 OK 188 45 HandmadeSoko021
201 00:00:00 Festival 3.1 OK 161 37 HandmadeSoko022
202 00:00:01 Festival 3.1 OK 99 26 HandmadeSoko023
203 00:00:01 Festival 3.1 OK 127 24 HandmadeSoko024
204 00:00:00 Festival 3.1 OK 179 30 HandmadeSoko025
205 00:00:01 Festival 3.1 OK 125 33 HandmadeSoko026
206 00:00:00 Festival 3.1 OK 226 45 HandmadeSoko027
207 00:00:01 Festival 3.1 OK 186 36 HandmadeSoko028
208 00:00:01 Festival 3.1 OK 790 116 HandmadeSoko029
209 00:00:01 Festival 3.1 OK 145 39 HandmadeSoko030
210 00:00:00 Festival 3.1 OK 330 66 HandmadeSoko031
211 00:00:01 Festival 3.1 OK 153 28 HandmadeSoko032
212 00:00:01 Festival 3.1 OK 258 57 HandmadeSoko033
213 00:00:01 Festival 3.1 OK 598 82 HandmadeSoko034
214 00:00:00 Festival 3.1 OK 406 71 HandmadeSoko035
215 00:00:01 Festival 3.1 OK 204 46 HandmadeSoko036
216 00:00:00 Festival 3.1 OK 165 27 HandmadeSoko037
217 00:00:01 Festival 3.1 OK 238 43 HandmadeSoko038
218 00:00:01 Festival 3.1 OK 114 20 HandmadeSoko039
219 00:00:00 Festival 3.1 OK 69 16 HandmadeSoko040
220 00:00:01 Festival 3.1 OK 385 84 HandmadeSoko041
221 00:00:01 Festival 3.1 OK 178 38 HandmadeSoko042
222 00:00:00 Festival 3.1 OK 336 53 HandmadeSoko043
223 00:00:01 Festival 3.1 OK 160 36 HandmadeSoko044
224 00:00:01 Festival 3.1 OK 311 43 HandmadeSoko045
225 00:00:01 Festival 3.1 OK 516 70 HandmadeSoko046
226 00:00:00 Festival 3.1 OK 114 36 HandmadeSoko047
227 00:00:01 Festival 3.1 OK 137 21 HandmadeSoko048
228 00:00:00 Festival 3.1 OK 123 26 HandmadeSoko049
229 00:00:01 Festival 3.1 OK 187 23 HandmadeSoko050
230 00:00:01 Festival 3.1 OK 256 40 HandmadeSoko051
231 00:00:00 Festival 3.1 OK 113 31 HandmadeSoko052
232 00:00:01 Festival 3.1 OK 66 12 HandmadeSoko053
233 00:00:01 Festival 3.1 OK 126 27 HandmadeSoko054
234 00:00:00 Festival 3.1 OK 218 47 massasquatch1
235 00:00:06 Festival 3.1 OK 1329 141 massasquatch10
236 00:00:06 Festival 3.1 OK 805 193 massasquatch11
237 00:00:01 Festival 3.1 OK 184 40 massasquatch12
238 00:00:13 Festival 3.1 OK 1048 210 massasquatch13
239 00:00:01 Festival 3.1 OK 327 82 massasquatch14
240 00:00:23 Festival 3.1 OK 1754 392 massasquatch15
241 00:00:11 Festival 3.1 OK 647 68 massasquatch16
242 00:04:21 Festival 3.1 OK 10309 842 massasquatch17
243 00:05:41 Festival 3.1 OK 4238 736 massasquatch18
244 00:00:01 Festival 3.1 OK 788 194 massasquatch19
245 00:00:01 Festival 3.1 OK 395 102 massasquatch2
246 00:00:01 Festival 3.1 OK 2364 408 massasquatch20
247 00:00:11 Festival 3.1 OK 1085 300 massasquatch21
248 00:06:06 Festival 3.1 OK 3617 541 massasquatch22
249 00:00:01 Festival 3.1 OK 1887 143 massasquatch23
250 00:00:13 Festival 3.1 OK 1632 184 massasquatch24
251 00:03:30 Festival 3.1 OK 2590 224 massasquatch25
252 00:00:01 Festival 3.1 OK 994 268 massasquatch26
253 00:00:01 Festival 3.1 OK 1205 170 massasquatch27
254 00:10:01 Festival 3.1 Time limit exceeded massasquatch28
255 00:10:01 Festival 3.1 Time limit exceeded massasquatch29
256 00:00:00 Festival 3.1 OK 473 109 massasquatch3
257 00:00:01 Festival 3.1 OK 846 182 massasquatch30
258 00:00:01 Festival 3.1 OK 871 163 massasquatch31
259 00:00:01 Festival 3.1 OK 245 44 massasquatch32
260 00:00:01 Festival 3.1 OK 866 272 massasquatch33
261 00:00:00 Festival 3.1 OK 118 36 massasquatch34
262 00:00:01 Festival 3.1 OK 1200 246 massasquatch35
263 00:00:56 Festival 3.1 OK 1498 188 massasquatch36
264 00:08:27 Festival 3.1 OK 2780 518 massasquatch37
265 00:00:10 Festival 3.1 OK 4647 792 massasquatch38
266 00:00:02 Festival 3.1 OK 963 124 massasquatch39
267 00:00:08 Festival 3.1 OK 783 184 massasquatch4
268 00:01:37 Festival 3.1 OK 3583 736 massasquatch40
269 00:00:02 Festival 3.1 OK 655 128 massasquatch41
270 00:00:02 Festival 3.1 OK 2835 407 massasquatch42
271 00:00:09 Festival 3.1 OK 2292 513 massasquatch43
272 00:00:12 Festival 3.1 OK 885 282 massasquatch44
273 00:00:01 Festival 3.1 OK 1042 345 massasquatch45
274 00:10:01 Festival 3.1 Time limit exceeded massasquatch46
275 00:00:55 Festival 3.1 OK 1429 308 massasquatch47
276 00:00:03 Festival 3.1 OK 606 100 massasquatch48
277 00:10:01 Festival 3.1 Time limit exceeded massasquatch49
278 00:00:00 Festival 3.1 OK 517 89 massasquatch5
279 00:10:01 Festival 3.1 Time limit exceeded massasquatch50
280 00:00:02 Festival 3.1 OK 1374 297 massasquatch6
281 00:00:03 Festival 3.1 OK 1073 313 massasquatch7
282 00:00:00 Festival 3.1 OK 1105 215 massasquatch8
283 00:00:17 Festival 3.1 OK 5002 1280 massasquatch9
284 00:00:00 Festival 3.1 OK 107 21 Microban_01_ArrangedMicroban_101a
285 00:00:01 Festival 3.1 OK 272 50 Microban_01_ArrangedMicroban_145a
286 00:00:01 Festival 3.1 OK 142 20 Microban_01_ArrangedMicroban_146a
287 00:00:00 Festival 3.1 OK 321 60 Microban_02_ArrangedMas_Microban_109a
288 00:00:01 Festival 3.1 OK 413 72 Microban_02_ArrangedMas_Microban_109b
289 00:00:01 Festival 3.1 OK 135 30 Microban_02_ArrangedMas_Microban_113a
290 00:00:01 Festival 3.1 OK 209 46 Microban_02_ArrangedMas_Microban_115a
291 00:00:01 Festival 3.1 OK 751 126 Microban_02_ArrangedMas_Microban_126a
292 00:03:44 Festival 3.1 OK 4491 608 Microban_02_ArrangedMas_Microban_134a
293 00:00:01 Festival 3.1 OK 98 17 Microban_02_ArrangedMas_Microban_67a
294 00:01:38 Festival 3.1 OK 1280 250 Microban_02_ArrangedMas_Microban_68a
295 00:03:21 Festival 3.1 OK 850 156 Microban_02_ArrangedMas_Microban_68b
296 00:00:02 Festival 3.1 OK 668 124 Microban_02_ArrangedMas_Microban_68c
297 00:00:01 Festival 3.1 OK 162 46 Microban_02_ArrangedMas_Microban_93a
298 00:00:00 Festival 3.1 OK 88 27 Microban_III1
299 00:00:01 Festival 3.1 OK 81 13 Microban_III10
300 00:00:00 Festival 3.1 OK 50 10 Microban_III100
301 00:00:18 Festival 3.1 OK 2299 589 Microban_III101
302 00:00:00 Festival 3.1 OK 203 56 Microban_III11
303 00:00:01 Festival 3.1 OK 129 30 Microban_III12
304 00:00:00 Festival 3.1 OK 117 23 Microban_III13
305 00:00:01 Festival 3.1 OK 155 34 Microban_III14
306 00:00:00 Festival 3.1 OK 67 20 Microban_III15
307 00:00:01 Festival 3.1 OK 226 54 Microban_III16
308 00:00:01 Festival 3.1 OK 162 38 Microban_III17
309 00:00:00 Festival 3.1 OK 107 16 Microban_III18
310 00:00:01 Festival 3.1 OK 104 16 Microban_III19
311 00:00:00 Festival 3.1 OK 52 11 Microban_III2
312 00:00:01 Festival 3.1 OK 101 31 Microban_III20
313 00:00:01 Festival 3.1 OK 163 43 Microban_III21
314 00:00:00 Festival 3.1 OK 275 68 Microban_III22
315 00:00:01 Festival 3.1 OK 256 74 Microban_III23
316 00:00:00 Festival 3.1 OK 302 112 Microban_III24
317 00:00:01 Festival 3.1 OK 75 12 Microban_III25
318 00:00:01 Festival 3.1 OK 267 57 Microban_III26
319 00:00:00 Festival 3.1 OK 371 75 Microban_III27
320 00:00:01 Festival 3.1 OK 84 16 Microban_III28
321 00:00:00 Festival 3.1 OK 170 42 Microban_III29
322 00:00:01 Festival 3.1 OK 56 15 Microban_III3
323 00:00:01 Festival 3.1 OK 88 36 Microban_III30
324 00:00:00 Festival 3.1 OK 424 82 Microban_III31
325 00:00:01 Festival 3.1 OK 408 108 Microban_III32
326 00:00:00 Festival 3.1 OK 655 169 Microban_III33
327 00:00:01 Festival 3.1 OK 84 23 Microban_III34
328 00:00:01 Festival 3.1 OK 41 12 Microban_III35
329 00:00:00 Festival 3.1 OK 237 66 Microban_III36
330 00:00:01 Festival 3.1 OK 150 46 Microban_III37
331 00:00:00 Festival 3.1 OK 233 67 Microban_III38
332 00:00:01 Festival 3.1 OK 122 36 Microban_III39
333 00:00:01 Festival 3.1 OK 62 14 Microban_III4
334 00:00:00 Festival 3.1 OK 357 64 Microban_III40
335 00:00:01 Festival 3.1 OK 309 58 Microban_III41
336 00:00:00 Festival 3.1 OK 207 78 Microban_III42
337 00:00:01 Festival 3.1 OK 215 58 Microban_III43
338 00:00:00 Festival 3.1 OK 74 16 Microban_III44
339 00:00:01 Festival 3.1 OK 363 34 Microban_III45
340 00:00:06 Festival 3.1 OK 508 136 Microban_III46
341 00:00:06 Festival 3.1 OK 1460 184 Microban_III47
342 00:00:01 Festival 3.1 OK 83 20 Microban_III48
343 00:00:01 Festival 3.1 OK 39 13 Microban_III49
344 00:00:00 Festival 3.1 OK 76 20 Microban_III5
345 00:00:01 Festival 3.1 OK 55 19 Microban_III50
346 00:00:00 Festival 3.1 OK 182 33 Microban_III51
347 00:00:01 Festival 3.1 OK 132 23 Microban_III52
348 00:00:00 Festival 3.1 OK 110 17 Microban_III53
349 00:00:01 Festival 3.1 OK 484 156 Microban_III54
350 00:00:01 Festival 3.1 OK 172 42 Microban_III55
351 00:00:00 Festival 3.1 OK 228 64 Microban_III56
352 00:00:02 Festival 3.1 OK 328 44 Microban_III57
353 00:01:42 Festival 3.1 OK 960 160 Microban_III58
354 00:00:01 Festival 3.1 OK 397 24 Microban_III59
355 00:00:00 Festival 3.1 OK 76 18 Microban_III6
356 00:00:01 Festival 3.1 OK 160 15 Microban_III60
357 00:00:00 Festival 3.1 OK 69 13 Microban_III61
358 00:00:01 Festival 3.1 OK 56 17 Microban_III62
359 00:00:00 Festival 3.1 OK 89 19 Microban_III63
360 00:00:00 Festival 3.1 OK 110 37 Microban_III64
361 00:00:01 Festival 3.1 OK 54 13 Microban_III65
362 00:00:00 Festival 3.1 OK 89 13 Microban_III66
363 00:00:01 Festival 3.1 OK 39 9 Microban_III67
364 00:00:00 Festival 3.1 OK 33 7 Microban_III68
365 00:00:01 Festival 3.1 OK 67 21 Microban_III69
366 00:00:01 Festival 3.1 OK 193 49 Microban_III7
367 00:00:00 Festival 3.1 OK 54 13 Microban_III70
368 00:00:01 Festival 3.1 OK 93 16 Microban_III71
369 00:00:00 Festival 3.1 OK 89 24 Microban_III72
370 00:00:01 Festival 3.1 OK 91 16 Microban_III73
371 00:00:00 Festival 3.1 OK 82 18 Microban_III74
372 00:00:01 Festival 3.1 OK 53 18 Microban_III75
373 00:00:01 Festival 3.1 OK 75 16 Microban_III76
374 00:00:00 Festival 3.1 OK 65 19 Microban_III77
375 00:00:01 Festival 3.1 OK 54 13 Microban_III78
376 00:00:00 Festival 3.1 OK 46 9 Microban_III79
377 00:00:01 Festival 3.1 OK 152 42 Microban_III8
378 00:00:00 Festival 3.1 OK 81 23 Microban_III80
379 00:00:01 Festival 3.1 OK 65 22 Microban_III81
380 00:00:01 Festival 3.1 OK 63 14 Microban_III82
381 00:00:00 Festival 3.1 OK 87 14 Microban_III83
382 00:00:01 Festival 3.1 OK 76 18 Microban_III84
383 00:00:00 Festival 3.1 OK 75 20 Microban_III85
384 00:00:01 Festival 3.1 OK 69 16 Microban_III86
385 00:00:00 Festival 3.1 OK 93 16 Microban_III87
386 00:00:01 Festival 3.1 OK 141 42 Microban_III88
387 00:00:01 Festival 3.1 OK 42 14 Microban_III89
388 00:00:00 Festival 3.1 OK 193 58 Microban_III9
389 00:00:01 Festival 3.1 OK 44 14 Microban_III90
390 00:00:00 Festival 3.1 OK 28 8 Microban_III91
391 00:00:01 Festival 3.1 OK 28 6 Microban_III92
392 00:00:01 Festival 3.1 OK 38 12 Microban_III93
393 00:00:00 Festival 3.1 OK 42 12 Microban_III94
394 00:00:01 Festival 3.1 OK 47 14 Microban_III95
395 00:00:00 Festival 3.1 OK 62 20 Microban_III96
396 00:00:01 Festival 3.1 OK 50 12 Microban_III97
397 00:00:00 Festival 3.1 OK 80 26 Microban_III98
398 00:00:01 Festival 3.1 OK 56 20 Microban_III99
399 00:00:01 Festival 3.1 OK 34 12 Microban_IV1
400 00:00:00 Festival 3.1 OK 296 102 Microban_IV10
401 00:00:01 Festival 3.1 OK 327 86 Microban_IV100
402 00:00:00 Festival 3.1 OK 39 8 Microban_IV11
403 00:00:01 Festival 3.1 OK 65 21 Microban_IV12
404 00:00:01 Festival 3.1 OK 81 22 Microban_IV13
405 00:00:00 Festival 3.1 OK 116 20 Microban_IV14
406 00:00:01 Festival 3.1 OK 121 47 Microban_IV15
407 00:00:00 Festival 3.1 OK 87 23 Microban_IV16
408 00:00:01 Festival 3.1 OK 92 25 Microban_IV17
409 00:00:00 Festival 3.1 OK 208 40 Microban_IV18
410 00:00:01 Festival 3.1 OK 105 20 Microban_IV19
411 00:00:01 Festival 3.1 OK 92 26 Microban_IV2
412 00:00:00 Festival 3.1 OK 70 13 Microban_IV20
413 00:00:01 Festival 3.1 OK 105 26 Microban_IV21
414 00:00:00 Festival 3.1 OK 44 8 Microban_IV22
415 00:00:01 Festival 3.1 OK 122 40 Microban_IV23
416 00:00:01 Festival 3.1 OK 124 30 Microban_IV24
417 00:00:00 Festival 3.1 OK 428 102 Microban_IV25
418 00:00:01 Festival 3.1 OK 98 26 Microban_IV26
419 00:00:00 Festival 3.1 OK 130 29 Microban_IV27
420 00:00:01 Festival 3.1 OK 77 16 Microban_IV28
421 00:00:00 Festival 3.1 OK 158 38 Microban_IV29
422 00:00:01 Festival 3.1 OK 69 18 Microban_IV3
423 00:00:01 Festival 3.1 OK 412 166 Microban_IV30
424 00:00:00 Festival 3.1 OK 103 24 Microban_IV31
425 00:00:01 Festival 3.1 OK 212 76 Microban_IV32
426 00:00:00 Festival 3.1 OK 143 26 Microban_IV33
427 00:00:01 Festival 3.1 OK 62 14 Microban_IV34
428 00:00:01 Festival 3.1 OK 196 32 Microban_IV35
429 00:00:00 Festival 3.1 OK 173 20 Microban_IV36
430 00:00:01 Festival 3.1 OK 136 32 Microban_IV37
431 00:00:01 Festival 3.1 OK 130 18 Microban_IV38
432 00:00:00 Festival 3.1 OK 335 103 Microban_IV39
433 00:00:01 Festival 3.1 OK 61 15 Microban_IV4
434 00:00:00 Festival 3.1 OK 436 120 Microban_IV40
435 00:00:01 Festival 3.1 OK 241 82 Microban_IV41
436 00:00:01 Festival 3.1 OK 675 249 Microban_IV42
437 00:00:00 Festival 3.1 OK 214 35 Microban_IV43
438 00:00:01 Festival 3.1 OK 323 70 Microban_IV44
439 00:00:00 Festival 3.1 OK 259 35 Microban_IV45
440 00:00:01 Festival 3.1 OK 358 92 Microban_IV46
441 00:00:01 Festival 3.1 OK 297 64 Microban_IV47
442 00:00:00 Festival 3.1 OK 433 92 Microban_IV48
443 00:00:01 Festival 3.1 OK 317 66 Microban_IV49
444 00:00:00 Festival 3.1 OK 91 33 Microban_IV5
445 00:00:01 Festival 3.1 OK 516 108 Microban_IV50
446 00:00:01 Festival 3.1 OK 78 22 Microban_IV51
447 00:00:00 Festival 3.1 OK 60 10 Microban_IV52
448 00:00:01 Festival 3.1 OK 108 30 Microban_IV53
449 00:00:00 Festival 3.1 OK 66 20 Microban_IV54
450 00:00:01 Festival 3.1 OK 101 35 Microban_IV55
451 00:00:00 Festival 3.1 OK 702 144 Microban_IV56
452 00:00:01 Festival 3.1 OK 328 70 Microban_IV57
453 00:00:07 Festival 3.1 OK 224 28 Microban_IV58
454 00:00:02 Festival 3.1 OK 279 80 Microban_IV59
455 00:00:00 Festival 3.1 OK 241 78 Microban_IV6
456 00:00:02 Festival 3.1 OK 483 50 Microban_IV60
457 00:00:00 Festival 3.1 OK 42 12 Microban_IV61
458 00:00:01 Festival 3.1 OK 111 24 Microban_IV62
459 00:00:01 Festival 3.1 OK 219 32 Microban_IV63
460 00:00:00 Festival 3.1 OK 219 45 Microban_IV64
461 00:00:01 Festival 3.1 OK 94 28 Microban_IV65
462 00:00:01 Festival 3.1 OK 129 20 Microban_IV66
463 00:00:00 Festival 3.1 OK 315 57 Microban_IV67
464 00:00:01 Festival 3.1 OK 239 53 Microban_IV68
465 00:00:01 Festival 3.1 OK 283 44 Microban_IV69
466 00:00:00 Festival 3.1 OK 134 32 Microban_IV7
467 00:00:01 Festival 3.1 OK 342 81 Microban_IV70
468 00:00:01 Festival 3.1 OK 218 52 Microban_IV71
469 00:00:00 Festival 3.1 OK 276 61 Microban_IV72
470 00:00:01 Festival 3.1 OK 162 35 Microban_IV73
471 00:00:00 Festival 3.1 OK 167 49 Microban_IV74
472 00:00:01 Festival 3.1 OK 1100 291 Microban_IV75
473 00:00:01 Festival 3.1 OK 507 110 Microban_IV76
474 00:00:01 Festival 3.1 OK 210 39 Microban_IV77
475 00:00:00 Festival 3.1 OK 189 62 Microban_IV78
476 00:00:01 Festival 3.1 OK 142 31 Microban_IV79
477 00:00:02 Festival 3.1 OK 118 28 Microban_IV8
478 00:00:00 Festival 3.1 OK 303 73 Microban_IV80
479 00:00:01 Festival 3.1 OK 201 58 Microban_IV81
480 00:00:00 Festival 3.1 OK 94 34 Microban_IV82
481 00:00:01 Festival 3.1 OK 181 38 Microban_IV83
482 00:00:01 Festival 3.1 OK 191 43 Microban_IV84
483 00:00:03 Festival 3.1 OK 1717 511 Microban_IV85
484 00:00:01 Festival 3.1 OK 158 26 Microban_IV86
485 00:00:01 Festival 3.1 OK 108 31 Microban_IV87
486 00:00:00 Festival 3.1 OK 383 92 Microban_IV88
487 00:00:01 Festival 3.1 OK 247 42 Microban_IV89
488 00:00:01 Festival 3.1 OK 341 56 Microban_IV9
489 00:00:01 Festival 3.1 OK 247 54 Microban_IV90
490 00:00:00 Festival 3.1 OK 254 46 Microban_IV91
491 00:00:01 Festival 3.1 OK 342 68 Microban_IV92
492 00:00:01 Festival 3.1 OK 257 34 Microban_IV93
493 00:00:00 Festival 3.1 OK 161 34 Microban_IV94
494 00:00:01 Festival 3.1 OK 477 52 Microban_IV95
495 00:00:01 Festival 3.1 OK 485 68 Microban_IV96
496 00:00:01 Festival 3.1 OK 402 64 Microban_IV97
497 00:00:01 Festival 3.1 OK 362 72 Microban_IV98
498 00:00:01 Festival 3.1 OK 330 48 Microban_IV99
499 00:00:00 Festival 3.1 OK 198 46 Mulholland_D1
500 00:00:01 Festival 3.1 OK 267 60 Mulholland_D10
501 00:00:00 Festival 3.1 OK 517 69 Mulholland_D11
502 00:00:01 Festival 3.1 OK 139 41 Mulholland_D12
503 00:00:01 Festival 3.1 OK 138 35 Mulholland_D13
504 00:00:00 Festival 3.1 OK 185 28 Mulholland_D14
505 00:00:01 Festival 3.1 OK 217 38 Mulholland_D15
506 00:00:00 Festival 3.1 OK 80 30 Mulholland_D16
507 00:00:01 Festival 3.1 OK 240 43 Mulholland_D17
508 00:00:10 Festival 3.1 OK 342 85 Mulholland_D18
509 00:00:01 Festival 3.1 OK 473 103 Mulholland_D19
510 00:00:00 Festival 3.1 OK 103 23 Mulholland_D2
511 00:00:01 Festival 3.1 OK 253 44 Mulholland_D20
512 00:00:00 Festival 3.1 OK 190 43 Mulholland_D21
513 00:00:01 Festival 3.1 OK 171 48 Mulholland_D22
514 00:00:01 Festival 3.1 OK 697 115 Mulholland_D23
515 00:00:01 Festival 3.1 OK 317 64 Mulholland_D24
516 00:00:00 Festival 3.1 OK 389 60 Mulholland_D25
517 00:00:01 Festival 3.1 OK 236 59 Mulholland_D26
518 00:00:01 Festival 3.1 OK 204 64 Mulholland_D27
519 00:00:01 Festival 3.1 OK 280 96 Mulholland_D28
520 00:00:00 Festival 3.1 OK 168 36 Mulholland_D29
521 00:00:01 Festival 3.1 OK 86 19 Mulholland_D3
522 00:00:01 Festival 3.1 OK 120 28 Mulholland_D30
523 00:00:02 Festival 3.1 OK 429 90 Mulholland_D31
524 00:00:01 Festival 3.1 OK 319 70 Mulholland_D32
525 00:00:01 Festival 3.1 OK 236 61 Mulholland_D33
526 00:00:01 Festival 3.1 OK 292 79 Mulholland_D34
527 00:00:00 Festival 3.1 OK 349 47 Mulholland_D35
528 00:00:01 Festival 3.1 OK 258 65 Mulholland_D36
529 00:00:01 Festival 3.1 OK 210 66 Mulholland_D37
530 00:00:01 Festival 3.1 OK 258 60 Mulholland_D38
531 00:00:01 Festival 3.1 OK 375 66 Mulholland_D39
532 00:00:00 Festival 3.1 OK 65 16 Mulholland_D4
533 00:00:01 Festival 3.1 OK 265 68 Mulholland_D40
534 00:00:01 Festival 3.1 OK 242 59 Mulholland_D41
535 00:00:01 Festival 3.1 OK 272 59 Mulholland_D42
536 00:00:01 Festival 3.1 OK 214 59 Mulholland_D43
537 00:00:01 Festival 3.1 OK 392 67 Mulholland_D44
538 00:00:01 Festival 3.1 OK 231 48 Mulholland_D45
539 00:00:00 Festival 3.1 OK 194 58 Mulholland_D46
540 00:00:01 Festival 3.1 OK 339 65 Mulholland_D47
541 00:00:01 Festival 3.1 OK 185 63 Mulholland_D48
542 00:00:01 Festival 3.1 OK 276 66 Mulholland_D49
543 00:00:01 Festival 3.1 OK 545 186 Mulholland_D5
544 00:00:01 Festival 3.1 OK 340 81 Mulholland_D50
545 00:00:01 Festival 3.1 OK 332 87 Mulholland_D51
546 00:00:01 Festival 3.1 OK 397 97 Mulholland_D52
547 00:00:01 Festival 3.1 OK 332 71 Mulholland_D53
548 00:00:01 Festival 3.1 OK 548 115 Mulholland_D54
549 00:00:01 Festival 3.1 OK 488 98 Mulholland_D55
550 00:00:13 Festival 3.1 OK 339 103 Mulholland_D56
551 00:00:01 Festival 3.1 OK 325 96 Mulholland_D57
552 00:00:01 Festival 3.1 OK 90 24 Mulholland_D6
553 00:00:00 Festival 3.1 OK 173 49 Mulholland_D7
554 00:00:01 Festival 3.1 OK 127 25 Mulholland_D8
555 00:00:01 Festival 3.1 OK 178 59 Mulholland_D9
556 00:00:00 Festival 3.1 OK 332 52 sasquatchiii1
557 00:00:01 Festival 3.1 OK 316 40 sasquatchiii10
558 00:00:41 Festival 3.1 OK 1143 322 sasquatchiii11
559 00:00:00 Festival 3.1 OK 418 82 sasquatchiii12
560 00:00:03 Festival 3.1 OK 1092 274 sasquatchiii13
561 00:00:00 Festival 3.1 OK 559 130 sasquatchiii14
562 00:00:05 Festival 3.1 OK 862 184 sasquatchiii15
563 00:00:01 Festival 3.1 OK 197 42 sasquatchiii16
564 00:00:41 Festival 3.1 OK 1041 250 sasquatchiii17
565 00:00:20 Festival 3.1 OK 1651 246 sasquatchiii18
566 00:00:37 Festival 3.1 OK 2263 300 sasquatchiii19
567 00:00:26 Festival 3.1 OK 520 103 sasquatchiii2
568 00:00:01 Festival 3.1 OK 469 94 sasquatchiii20
569 00:00:13 Festival 3.1 OK 1022 224 sasquatchiii21
570 00:10:01 Festival 3.1 Time limit exceeded sasquatchiii22
571 00:01:53 Festival 3.1 OK 1156 172 sasquatchiii23
572 00:01:52 Festival 3.1 OK 1432 244 sasquatchiii24
573 00:03:21 Festival 3.1 OK 1277 150 sasquatchiii25
574 00:03:44 Festival 3.1 OK 3369 374 sasquatchiii26
575 00:02:56 Festival 3.1 OK 3788 332 sasquatchiii27
576 00:01:21 Festival 3.1 OK 1843 516 sasquatchiii28
577 00:10:01 Festival 3.1 Time limit exceeded sasquatchiii29
578 00:00:00 Festival 3.1 OK 1010 135 sasquatchiii3
579 00:00:05 Festival 3.1 OK 1794 256 sasquatchiii30
580 00:02:45 Festival 3.1 OK 2017 254 sasquatchiii31
581 00:10:01 Festival 3.1 Time limit exceeded sasquatchiii32
582 00:00:21 Festival 3.1 OK 1760 235 sasquatchiii33
583 00:01:41 Festival 3.1 OK 3114 472 sasquatchiii34
584 00:10:01 Festival 3.1 Time limit exceeded sasquatchiii35
585 00:03:31 Festival 3.1 OK 1348 216 sasquatchiii36
586 00:03:23 Festival 3.1 OK 2177 268 sasquatchiii37
587 00:00:01 Festival 3.1 OK 469 110 sasquatchiii38
588 00:00:02 Festival 3.1 OK 1453 254 sasquatchiii39
589 00:00:15 Festival 3.1 OK 2668 315 sasquatchiii4
590 00:04:13 Festival 3.1 OK 2948 316 sasquatchiii40
591 00:10:01 Festival 3.1 Time limit exceeded sasquatchiii41
592 00:09:09 Festival 3.1 OK 4721 548 sasquatchiii42
593 00:03:16 Festival 3.1 OK 2154 306 sasquatchiii43
594 00:03:36 Festival 3.1 OK 1539 118 sasquatchiii44
595 00:10:01 Festival 3.1 Time limit exceeded sasquatchiii45
596 00:04:16 Festival 3.1 OK 2271 236 sasquatchiii46
597 00:03:58 Festival 3.1 OK 2667 202 sasquatchiii47
598 00:00:02 Festival 3.1 OK 1225 314 sasquatchiii48
599 00:04:43 Festival 3.1 OK 6329 910 sasquatchiii49
600 00:00:01 Festival 3.1 OK 569 105 sasquatchiii5
601 00:00:18 Festival 3.1 OK 3797 796 sasquatchiii50
602 00:03:10 Festival 3.1 OK 1200 214 sasquatchiii6
603 00:00:00 Festival 3.1 OK 373 58 sasquatchiii7
604 00:00:01 Festival 3.1 OK 386 90 sasquatchiii8
605 00:00:01 Festival 3.1 OK 579 99 sasquatchiii9
606 00:00:01 Festival 3.1 OK 153 51 sasquatchiv1
607 00:00:00 Festival 3.1 OK 165 29 sasquatchiv10
608 00:00:01 Festival 3.1 OK 419 101 sasquatchiv11
609 00:00:00 Festival 3.1 OK 582 104 sasquatchiv12
610 00:00:01 Festival 3.1 OK 404 50 sasquatchiv13
611 00:00:01 Festival 3.1 OK 204 54 sasquatchiv14
612 00:00:07 Festival 3.1 OK 581 88 sasquatchiv15
613 00:01:10 Festival 3.1 OK 874 128 sasquatchiv16
614 00:02:14 Festival 3.1 OK 1972 236 sasquatchiv17
615 00:02:07 Festival 3.1 OK 2424 446 sasquatchiv18
616 00:00:01 Festival 3.1 OK 172 36 sasquatchiv19
617 00:00:00 Festival 3.1 OK 230 60 sasquatchiv2
618 00:00:01 Festival 3.1 OK 224 44 sasquatchiv20
619 00:00:01 Festival 3.1 OK 359 56 sasquatchiv21
620 00:00:02 Festival 3.1 OK 530 140 sasquatchiv22
621 00:00:01 Festival 3.1 OK 468 130 sasquatchiv23
622 00:00:01 Festival 3.1 OK 703 212 sasquatchiv24
623 00:00:01 Festival 3.1 OK 995 168 sasquatchiv25
624 00:00:01 Festival 3.1 OK 498 133 sasquatchiv26
625 00:00:02 Festival 3.1 OK 782 177 sasquatchiv27
626 00:00:02 Festival 3.1 OK 1020 207 sasquatchiv28
627 00:00:01 Festival 3.1 OK 581 47 sasquatchiv29
628 00:00:00 Festival 3.1 OK 171 35 sasquatchiv3
629 00:00:02 Festival 3.1 OK 1706 444 sasquatchiv30
630 00:01:58 Festival 3.1 OK 1066 178 sasquatchiv31
631 00:06:26 Festival 3.1 OK 1543 214 sasquatchiv32
632 00:10:01 Festival 3.1 Time limit exceeded sasquatchiv33
633 00:00:03 Festival 3.1 OK 443 120 sasquatchiv34
634 00:00:41 Festival 3.1 OK 969 106 sasquatchiv35
635 00:01:44 Festival 3.1 OK 1457 238 sasquatchiv36
636 00:00:02 Festival 3.1 OK 233 52 sasquatchiv37
637 00:00:30 Festival 3.1 OK 815 188 sasquatchiv38
638 00:00:03 Festival 3.1 OK 944 98 sasquatchiv39
639 00:00:00 Festival 3.1 OK 318 55 sasquatchiv4
640 00:10:01 Festival 3.1 Time limit exceeded sasquatchiv40
641 00:00:01 Festival 3.1 OK 806 144 sasquatchiv41
642 00:00:06 Festival 3.1 OK 2615 499 sasquatchiv42
643 00:00:02 Festival 3.1 OK 3105 404 sasquatchiv43
644 00:10:01 Festival 3.1 Time limit exceeded sasquatchiv44
645 00:03:29 Festival 3.1 OK 4113 450 sasquatchiv45
646 00:03:46 Festival 3.1 OK 5230 516 sasquatchiv46
647 00:05:31 Festival 3.1 OK 5310 456 sasquatchiv47
648 00:10:01 Festival 3.1 Time limit exceeded sasquatchiv48
649 00:10:01 Festival 3.1 Time limit exceeded sasquatchiv49
650 00:00:00 Festival 3.1 OK 124 33 sasquatchiv5
651 00:03:29 Festival 3.1 OK 3011 420 sasquatchiv50
652 00:00:00 Festival 3.1 OK 520 154 sasquatchiv6
653 00:00:01 Festival 3.1 OK 286 24 sasquatchiv7
654 00:00:00 Festival 3.1 OK 1243 144 sasquatchiv8
655 00:00:01 Festival 3.1 OK 312 98 sasquatchiv9
656 00:00:01 Festival 3.1 OK 138 43 sasquatchv1
657 00:00:00 Festival 3.1 OK 187 25 sasquatchv10
658 00:00:01 Festival 3.1 OK 129 19 sasquatchv11
659 00:00:01 Festival 3.1 OK 210 45 sasquatchv12
660 00:00:00 Festival 3.1 OK 286 40 sasquatchv13
661 00:00:01 Festival 3.1 OK 181 20 sasquatchv14
662 00:00:04 Festival 3.1 OK 342 58 sasquatchv15
663 00:00:01 Festival 3.1 OK 395 76 sasquatchv16
664 00:00:01 Festival 3.1 OK 204 46 sasquatchv17
665 00:00:01 Festival 3.1 OK 191 50 sasquatchv18
666 00:00:14 Festival 3.1 OK 965 188 sasquatchv19
667 00:00:01 Festival 3.1 OK 123 20 sasquatchv2
668 00:00:00 Festival 3.1 OK 845 102 sasquatchv20
669 00:00:02 Festival 3.1 OK 811 127 sasquatchv21
670 00:00:01 Festival 3.1 OK 596 129 sasquatchv22
671 00:00:03 Festival 3.1 OK 856 181 sasquatchv23
672 00:00:03 Festival 3.1 OK 1068 186 sasquatchv24
673 00:00:03 Festival 3.1 OK 1641 186 sasquatchv25
674 00:01:20 Festival 3.1 OK 1565 317 sasquatchv26
675 00:10:01 Festival 3.1 Time limit exceeded sasquatchv27
676 00:02:48 Festival 3.1 OK 1436 264 sasquatchv28
677 00:00:03 Festival 3.1 OK 367 114 sasquatchv29
678 00:00:00 Festival 3.1 OK 198 43 sasquatchv3
679 00:00:02 Festival 3.1 OK 1463 448 sasquatchv30
680 00:02:43 Festival 3.1 OK 2101 506 sasquatchv31
681 00:00:04 Festival 3.1 OK 358 66 sasquatchv32
682 00:00:01 Festival 3.1 OK 335 44 sasquatchv33
683 00:00:04 Festival 3.1 OK 334 86 sasquatchv34
684 00:00:04 Festival 3.1 OK 934 144 sasquatchv35
685 00:00:02 Festival 3.1 OK 379 46 sasquatchv36
686 00:00:02 Festival 3.1 OK 430 64 sasquatchv37
687 00:00:26 Festival 3.1 OK 2077 208 sasquatchv38
688 00:00:51 Festival 3.1 OK 1842 236 sasquatchv39
689 00:00:01 Festival 3.1 OK 222 42 sasquatchv4
690 00:10:01 Festival 3.1 Time limit exceeded sasquatchv40
691 00:00:01 Festival 3.1 OK 962 136 sasquatchv41
692 00:03:38 Festival 3.1 OK 4484 516 sasquatchv42
693 00:04:25 Festival 3.1 OK 4028 592 sasquatchv43
694 00:03:21 Festival 3.1 OK 3420 456 sasquatchv44
695 00:08:10 Festival 3.1 OK 2077 316 sasquatchv45
696 00:00:01 Festival 3.1 OK 4526 658 sasquatchv46
697 00:00:59 Festival 3.1 OK 3920 706 sasquatchv47
698 00:04:33 Festival 3.1 OK 9167 830 sasquatchv48
699 00:05:30 Festival 3.1 OK 9598 958 sasquatchv49
700 00:00:02 Festival 3.1 OK 269 89 sasquatchv5
701 00:00:00 Festival 3.1 Too many boxes sasquatchv50
702 00:00:00 Festival 3.1 OK 313 61 sasquatchv6
703 00:00:01 Festival 3.1 OK 118 31 sasquatchv7
704 00:00:00 Festival 3.1 OK 271 53 sasquatchv8
705 00:00:01 Festival 3.1 OK 597 58 sasquatchv9
706 00:00:01 Festival 3.1 OK 288 68 sasquatchvi1
707 00:00:04 Festival 3.1 OK 894 203 sasquatchvi10
708 00:00:01 Festival 3.1 OK 394 86 sasquatchvi11
709 00:00:01 Festival 3.1 OK 161 40 sasquatchvi12
710 00:00:01 Festival 3.1 OK 295 75 sasquatchvi13
711 00:00:06 Festival 3.1 OK 913 237 sasquatchvi14
712 00:01:00 Festival 3.1 OK 894 176 sasquatchvi15
713 00:00:11 Festival 3.1 OK 1167 202 sasquatchvi16
714 00:02:54 Festival 3.1 OK 1719 510 sasquatchvi17
715 00:10:01 Festival 3.1 Time limit exceeded sasquatchvi18
716 00:03:03 Festival 3.1 OK 1571 252 sasquatchvi19
717 00:00:01 Festival 3.1 OK 141 29 sasquatchvi2
718 00:00:00 Festival 3.1 OK 359 72 sasquatchvi20
719 00:00:01 Festival 3.1 OK 150 34 sasquatchvi21
720 00:00:01 Festival 3.1 OK 331 52 sasquatchvi22
721 00:00:01 Festival 3.1 OK 267 50 sasquatchvi23
722 00:00:01 Festival 3.1 OK 276 44 sasquatchvi24
723 00:00:02 Festival 3.1 OK 128 30 sasquatchvi25
724 00:00:00 Festival 3.1 OK 224 48 sasquatchvi26
725 00:00:01 Festival 3.1 OK 168 18 sasquatchvi27
726 00:00:02 Festival 3.1 OK 524 142 sasquatchvi28
727 00:00:01 Festival 3.1 OK 219 42 sasquatchvi29
728 00:00:00 Festival 3.1 OK 166 24 sasquatchvi3
729 00:00:02 Festival 3.1 OK 410 82 sasquatchvi30
730 00:01:39 Festival 3.1 OK 1017 184 sasquatchvi31
731 00:00:04 Festival 3.1 OK 576 108 sasquatchvi32
732 00:00:12 Festival 3.1 OK 996 224 sasquatchvi33
733 00:02:19 Festival 3.1 OK 2006 280 sasquatchvi34
734 00:01:19 Festival 3.1 OK 693 188 sasquatchvi35
735 00:00:02 Festival 3.1 OK 734 108 sasquatchvi36
736 00:02:39 Festival 3.1 OK 2302 308 sasquatchvi37
737 00:03:09 Festival 3.1 OK 2830 396 sasquatchvi38
738 00:00:01 Festival 3.1 OK 565 98 sasquatchvi39
739 00:00:01 Festival 3.1 OK 84 24 sasquatchvi4
740 00:04:05 Festival 3.1 OK 4370 1658 sasquatchvi40
741 00:00:04 Festival 3.1 OK 876 120 sasquatchvi41
742 00:10:01 Festival 3.1 Time limit exceeded sasquatchvi42
743 00:03:27 Festival 3.1 OK 2284 380 sasquatchvi43
744 00:04:35 Festival 3.1 OK 7126 898 sasquatchvi44
745 00:10:01 Festival 3.1 Time limit exceeded sasquatchvi45
746 00:10:01 Festival 3.1 Time limit exceeded sasquatchvi46
747 00:00:00 Festival 3.1 Too many boxes sasquatchvi47
748 00:10:01 Festival 3.1 Too many moves sasquatchvi48
749 00:00:00 Festival 3.1 Too many boxes sasquatchvi49
750 00:00:01 Festival 3.1 OK 335 86 sasquatchvi5
751 00:00:00 Festival 3.1 OK 189 34 sasquatchvi6
752 00:00:00 Festival 3.1 OK 387 116 sasquatchvi7
753 00:00:01 Festival 3.1 OK 300 32 sasquatchvi8
754 00:00:00 Festival 3.1 OK 282 48 sasquatchvi9
755 00:00:01 Festival 3.1 OK 168 49 sasquatchviii1
756 00:00:01 Festival 3.1 OK 350 54 sasquatchviii10
757 00:00:01 Festival 3.1 OK 386 44 sasquatchviii11
758 00:00:00 Festival 3.1 OK 241 41 sasquatchviii12
759 00:00:01 Festival 3.1 OK 156 28 sasquatchviii13
760 00:00:01 Festival 3.1 OK 306 72 sasquatchviii14
761 00:00:00 Festival 3.1 OK 201 53 sasquatchviii15
762 00:00:01 Festival 3.1 OK 161 22 sasquatchviii16
763 00:00:01 Festival 3.1 OK 1131 301 sasquatchviii17
764 00:01:36 Festival 3.1 OK 1647 287 sasquatchviii18
765 00:00:01 Festival 3.1 OK 401 98 sasquatchviii19
766 00:00:00 Festival 3.1 OK 228 36 sasquatchviii2
767 00:00:01 Festival 3.1 OK 473 121 sasquatchviii20
768 00:00:01 Festival 3.1 OK 691 119 sasquatchviii21
769 00:00:17 Festival 3.1 OK 1129 402 sasquatchviii22
770 00:00:01 Festival 3.1 OK 228 46 sasquatchviii23
771 00:00:03 Festival 3.1 OK 396 86 sasquatchviii24
772 00:00:01 Festival 3.1 OK 273 62 sasquatchviii25
773 00:00:01 Festival 3.1 OK 410 74 sasquatchviii26
774 00:00:01 Festival 3.1 OK 470 74 sasquatchviii27
775 00:03:26 Festival 3.1 OK 3138 404 sasquatchviii28
776 00:00:04 Festival 3.1 OK 722 81 sasquatchviii29
777 00:00:00 Festival 3.1 OK 194 50 sasquatchviii3
778 00:00:02 Festival 3.1 OK 1255 138 sasquatchviii30
779 00:00:05 Festival 3.1 OK 1678 242 sasquatchviii31
780 00:00:01 Festival 3.1 OK 405 70 sasquatchviii32
781 00:03:29 Festival 3.1 OK 4120 438 sasquatchviii33
782 00:00:06 Festival 3.1 OK 753 194 sasquatchviii34
783 00:00:03 Festival 3.1 OK 911 78 sasquatchviii35
784 00:03:23 Festival 3.1 OK 4065 241 sasquatchviii36
785 00:01:08 Festival 3.1 OK 959 156 sasquatchviii37
786 00:10:01 Festival 3.1 Time limit exceeded sasquatchviii38
787 00:10:01 Festival 3.1 Time limit exceeded sasquatchviii39
788 00:00:05 Festival 3.1 OK 220 57 sasquatchviii4
789 00:03:36 Festival 3.1 OK 3481 496 sasquatchviii40
790 00:00:05 Festival 3.1 OK 925 166 sasquatchviii41
791 00:10:01 Festival 3.1 Time limit exceeded sasquatchviii42
792 00:10:01 Festival 3.1 Time limit exceeded sasquatchviii43
793 00:02:53 Festival 3.1 OK 2260 276 sasquatchviii44
794 00:03:35 Festival 3.1 OK 4134 498 sasquatchviii45
795 00:02:37 Festival 3.1 OK 1700 272 sasquatchviii46
796 00:00:01 Festival 3.1 OK 199 41 sasquatchviii5
797 00:00:01 Festival 3.1 OK 425 104 sasquatchviii6
798 00:00:07 Festival 3.1 OK 1136 321 sasquatchviii7
799 00:00:01 Festival 3.1 OK 526 152 sasquatchviii8
800 00:00:03 Festival 3.1 OK 759 160 sasquatchviii9
801 00:00:00 Festival 3.1 OK 142 33 Sasquatchx1
802 00:00:01 Festival 3.1 OK 138 33 Sasquatchx10
803 00:00:01 Festival 3.1 OK 767 201 Sasquatchx11
804 00:00:01 Festival 3.1 OK 224 34 Sasquatchx12
805 00:00:03 Festival 3.1 OK 642 131 Sasquatchx13
806 00:00:01 Festival 3.1 OK 301 34 Sasquatchx14
807 00:00:00 Festival 3.1 OK 249 32 Sasquatchx15
808 00:00:01 Festival 3.1 OK 282 66 Sasquatchx16
809 00:00:01 Festival 3.1 OK 429 70 Sasquatchx17
810 00:00:01 Festival 3.1 OK 242 50 Sasquatchx18
811 00:00:00 Festival 3.1 OK 101 24 Sasquatchx19
812 00:00:01 Festival 3.1 OK 123 28 Sasquatchx2
813 00:00:02 Festival 3.1 OK 300 84 Sasquatchx20
814 00:00:01 Festival 3.1 OK 229 68 Sasquatchx21
815 00:03:31 Festival 3.1 OK 1169 210 Sasquatchx22
816 00:00:04 Festival 3.1 OK 487 124 Sasquatchx23
817 00:00:00 Festival 3.1 OK 377 94 Sasquatchx24
818 00:00:08 Festival 3.1 OK 745 174 Sasquatchx25
819 00:03:25 Festival 3.1 OK 334 42 Sasquatchx26
820 00:00:03 Festival 3.1 OK 639 144 Sasquatchx27
821 00:10:01 Festival 3.1 Time limit exceeded Sasquatchx28
822 00:10:01 Festival 3.1 Time limit exceeded Sasquatchx29
823 00:00:00 Festival 3.1 OK 73 22 Sasquatchx3
824 00:00:02 Festival 3.1 OK 385 40 Sasquatchx30
825 00:10:01 Festival 3.1 Time limit exceeded Sasquatchx31
826 00:00:08 Festival 3.1 OK 918 106 Sasquatchx32
827 00:02:52 Festival 3.1 OK 562 92 Sasquatchx33
828 00:00:01 Festival 3.1 OK 393 118 Sasquatchx34
829 00:01:02 Festival 3.1 OK 2712 228 Sasquatchx35
830 00:00:35 Festival 3.1 OK 535 122 Sasquatchx36
831 00:03:22 Festival 3.1 OK 1291 154 Sasquatchx37
832 00:00:17 Festival 3.1 OK 1635 156 Sasquatchx38
833 00:10:01 Festival 3.1 Time limit exceeded Sasquatchx39
834 00:00:00 Festival 3.1 OK 121 32 Sasquatchx4
835 00:00:04 Festival 3.1 OK 552 84 Sasquatchx40
836 00:00:12 Festival 3.1 OK 2376 343 Sasquatchx41
837 00:01:22 Festival 3.1 OK 787 212 Sasquatchx42
838 00:00:02 Festival 3.1 OK 2500 401 Sasquatchx43
839 00:03:22 Festival 3.1 OK 1940 366 Sasquatchx44
840 00:01:13 Festival 3.1 OK 3524 414 Sasquatchx45
841 00:10:01 Festival 3.1 Time limit exceeded Sasquatchx46
842 00:00:00 Festival 3.1 Too many boxes Sasquatchx47
843 00:01:04 Festival 3.1 OK 6313 522 Sasquatchx48
844 00:10:01 Festival 3.1 Time limit exceeded Sasquatchx49
845 00:00:00 Festival 3.1 OK 74 16 Sasquatchx5
846 00:00:00 Festival 3.1 Too many boxes Sasquatchx50
847 00:00:01 Festival 3.1 OK 201 34 Sasquatchx6
848 00:00:01 Festival 3.1 OK 174 36 Sasquatchx7
849 00:00:00 Festival 3.1 OK 156 39 Sasquatchx8
850 00:00:01 Festival 3.1 OK 225 42 Sasquatchx9
851 00:00:01 Festival 3.1 OK 1729 122 SvenSE_1
852 00:00:01 Festival 3.1 OK 1476 452 SvenSE_10
853 00:00:00 Festival 3.1 OK 205 39 SvenSE_100
854 00:00:18 Festival 3.1 OK 902 218 SvenSE_1000
855 00:03:29 Festival 3.1 OK 1224 250 SvenSE_1001
856 00:00:15 Festival 3.1 OK 1563 440 SvenSE_1002
857 00:00:01 Festival 3.1 OK 560 131 SvenSE_1003
858 00:00:00 Festival 3.1 OK 194 25 SvenSE_1004
859 00:00:00 Festival 3.1 OK 188 31 SvenSE_1005
860 00:00:02 Festival 3.1 OK 500 76 SvenSE_1006
861 00:00:01 Festival 3.1 OK 192 31 SvenSE_1007
862 00:00:00 Festival 3.1 OK 115 22 SvenSE_1008
863 00:00:01 Festival 3.1 OK 154 37 SvenSE_1009
864 00:00:01 Festival 3.1 OK 569 123 SvenSE_101
865 00:00:01 Festival 3.1 OK 228 54 SvenSE_1010
866 00:00:01 Festival 3.1 OK 279 66 SvenSE_1011
867 00:00:01 Festival 3.1 OK 275 74 SvenSE_1012
868 00:00:01 Festival 3.1 OK 201 41 SvenSE_1013
869 00:02:35 Festival 3.1 OK 1381 240 SvenSE_1014
870 00:00:52 Festival 3.1 OK 1975 359 SvenSE_1015
871 00:00:02 Festival 3.1 OK 1378 204 SvenSE_1016
872 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1017
873 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1018
874 00:00:01 Festival 3.1 OK 1194 148 SvenSE_1019
875 00:00:02 Festival 3.1 OK 588 99 SvenSE_102
876 00:00:01 Festival 3.1 OK 413 83 SvenSE_1020
877 00:02:05 Festival 3.1 OK 622 80 SvenSE_1021
878 00:00:00 Festival 3.1 OK 108 24 SvenSE_1022
879 00:04:20 Festival 3.1 OK 1540 274 SvenSE_1023
880 00:00:01 Festival 3.1 OK 295 80 SvenSE_1024
881 00:00:01 Festival 3.1 OK 258 51 SvenSE_1025
882 00:00:02 Festival 3.1 OK 363 105 SvenSE_1026
883 00:00:01 Festival 3.1 OK 103 18 SvenSE_1027
884 00:00:01 Festival 3.1 OK 263 58 SvenSE_1028
885 00:03:43 Festival 3.1 OK 3347 384 SvenSE_1029
886 00:00:02 Festival 3.1 OK 652 127 SvenSE_103
887 00:00:10 Festival 3.1 OK 271 44 SvenSE_1030
888 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1031
889 00:03:44 Festival 3.1 OK 888 118 SvenSE_1032
890 00:02:15 Festival 3.1 OK 846 136 SvenSE_1033
891 00:00:01 Festival 3.1 OK 450 97 SvenSE_1034
892 00:01:58 Festival 3.1 OK 830 199 SvenSE_1035
893 00:00:09 Festival 3.1 OK 697 195 SvenSE_1036
894 00:00:02 Festival 3.1 OK 929 116 SvenSE_1037
895 00:00:03 Festival 3.1 OK 546 56 SvenSE_1038
896 00:00:02 Festival 3.1 OK 1422 405 SvenSE_1039
897 00:00:47 Festival 3.1 OK 907 207 SvenSE_104
898 00:00:28 Festival 3.1 OK 519 100 SvenSE_1040
899 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1041
900 00:00:01 Festival 3.1 OK 2666 1241 SvenSE_1042
901 00:03:23 Festival 3.1 OK 1435 206 SvenSE_1043
902 00:00:08 Festival 3.1 OK 635 198 SvenSE_1044
903 00:00:02 Festival 3.1 OK 285 60 SvenSE_1045
904 00:00:04 Festival 3.1 OK 404 98 SvenSE_1046
905 00:00:01 Festival 3.1 OK 725 96 SvenSE_1047
906 00:03:55 Festival 3.1 OK 4784 1595 SvenSE_1048
907 00:00:01 Festival 3.1 OK 910 345 SvenSE_1049
908 00:00:10 Festival 3.1 OK 1293 295 SvenSE_105
909 00:00:00 Festival 3.1 OK 448 163 SvenSE_1050
910 00:00:01 Festival 3.1 OK 314 51 SvenSE_1051
911 00:00:01 Festival 3.1 OK 311 54 SvenSE_1052
912 00:00:01 Festival 3.1 OK 322 106 SvenSE_1053
913 00:00:00 Festival 3.1 OK 162 24 SvenSE_1054
914 00:01:37 Festival 3.1 OK 1059 240 SvenSE_1055
915 00:00:01 Festival 3.1 OK 123 27 SvenSE_1056
916 00:00:01 Festival 3.1 OK 532 48 SvenSE_1057
917 00:03:28 Festival 3.1 OK 1858 204 SvenSE_1058
918 00:00:01 Festival 3.1 OK 628 139 SvenSE_1059
919 00:00:01 Festival 3.1 OK 1137 194 SvenSE_106
920 00:00:02 Festival 3.1 OK 1451 289 SvenSE_1060
921 00:00:01 Festival 3.1 OK 1389 265 SvenSE_1061
922 00:00:14 Festival 3.1 OK 966 221 SvenSE_1062
923 00:00:01 Festival 3.1 OK 540 119 SvenSE_1063
924 00:00:17 Festival 3.1 OK 846 190 SvenSE_1064
925 00:00:03 Festival 3.1 OK 402 98 SvenSE_1065
926 00:00:03 Festival 3.1 OK 821 178 SvenSE_1066
927 00:00:01 Festival 3.1 OK 452 82 SvenSE_1067
928 00:00:03 Festival 3.1 OK 420 86 SvenSE_1068
929 00:00:00 Festival 3.1 OK 120 16 SvenSE_1069
930 00:00:15 Festival 3.1 OK 459 57 SvenSE_107
931 00:00:01 Festival 3.1 OK 330 50 SvenSE_1070
932 00:00:37 Festival 3.1 OK 502 98 SvenSE_1071
933 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1072
934 00:00:01 Festival 3.1 OK 222 42 SvenSE_1073
935 00:00:00 Festival 3.1 OK 336 39 SvenSE_1074
936 00:00:01 Festival 3.1 OK 431 68 SvenSE_1075
937 00:00:13 Festival 3.1 OK 1201 180 SvenSE_1076
938 00:00:20 Festival 3.1 OK 1224 134 SvenSE_1077
939 00:04:32 Festival 3.1 OK 685 82 SvenSE_1078
940 00:00:05 Festival 3.1 OK 610 130 SvenSE_1079
941 00:00:02 Festival 3.1 OK 340 41 SvenSE_108
942 00:00:03 Festival 3.1 OK 1130 340 SvenSE_1080
943 00:00:05 Festival 3.1 OK 303 42 SvenSE_1081
944 00:00:08 Festival 3.1 OK 385 66 SvenSE_1082
945 00:00:03 Festival 3.1 OK 548 130 SvenSE_1083
946 00:00:00 Festival 3.1 OK 350 32 SvenSE_1084
947 00:00:01 Festival 3.1 OK 186 30 SvenSE_1085
948 00:00:01 Festival 3.1 OK 430 56 SvenSE_1086
949 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1087
950 00:00:01 Festival 3.1 OK 241 39 SvenSE_1088
951 00:00:03 Festival 3.1 OK 1607 596 SvenSE_1089
952 00:00:04 Festival 3.1 OK 157 33 SvenSE_109
953 00:00:04 Festival 3.1 OK 572 128 SvenSE_1090
954 00:00:02 Festival 3.1 OK 356 78 SvenSE_1091
955 00:00:00 Festival 3.1 OK 425 78 SvenSE_1092
956 00:00:01 Festival 3.1 OK 353 72 SvenSE_1093
957 00:00:18 Festival 3.1 OK 487 92 SvenSE_1094
958 00:00:05 Festival 3.1 OK 605 92 SvenSE_1095
959 00:00:02 Festival 3.1 OK 551 102 SvenSE_1096
960 00:00:01 Festival 3.1 OK 271 60 SvenSE_1097
961 00:00:00 Festival 3.1 OK 235 86 SvenSE_1098
962 00:00:02 Festival 3.1 OK 339 118 SvenSE_1099
963 00:10:01 Festival 3.1 Time limit exceeded SvenSE_11
964 00:00:03 Festival 3.1 OK 123 29 SvenSE_110
965 00:00:01 Festival 3.1 OK 169 26 SvenSE_1100
966 00:00:06 Festival 3.1 OK 452 81 SvenSE_1101
967 00:00:00 Festival 3.1 OK 423 64 SvenSE_1102
968 00:00:01 Festival 3.1 OK 181 57 SvenSE_1103
969 00:00:01 Festival 3.1 OK 278 71 SvenSE_1104
970 00:00:01 Festival 3.1 OK 223 63 SvenSE_1105
971 00:00:00 Festival 3.1 OK 166 42 SvenSE_1106
972 00:02:05 Festival 3.1 OK 591 140 SvenSE_1107
973 00:03:00 Festival 3.1 OK 1708 454 SvenSE_1108
974 00:06:19 Festival 3.1 OK 2789 540 SvenSE_1109
975 00:00:16 Festival 3.1 OK 483 58 SvenSE_111
976 00:03:42 Festival 3.1 OK 3808 478 SvenSE_1110
977 00:00:01 Festival 3.1 OK 602 227 SvenSE_1111
978 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1112
979 00:00:01 Festival 3.1 OK 203 52 SvenSE_1113
980 00:02:32 Festival 3.1 OK 1631 437 SvenSE_1114
981 00:00:01 Festival 3.1 OK 348 57 SvenSE_1115
982 00:00:01 Festival 3.1 OK 177 36 SvenSE_1116
983 00:00:00 Festival 3.1 OK 202 32 SvenSE_1117
984 00:00:01 Festival 3.1 OK 224 39 SvenSE_1118
985 00:00:01 Festival 3.1 OK 136 28 SvenSE_1119
986 00:00:19 Festival 3.1 OK 477 56 SvenSE_112
987 00:00:01 Festival 3.1 OK 398 77 SvenSE_1120
988 00:00:03 Festival 3.1 OK 379 80 SvenSE_1121
989 00:03:37 Festival 3.1 OK 980 130 SvenSE_1122
990 00:03:22 Festival 3.1 OK 862 90 SvenSE_1123
991 00:00:02 Festival 3.1 OK 879 107 SvenSE_1124
992 00:00:37 Festival 3.1 OK 1673 190 SvenSE_1125
993 00:00:00 Festival 3.1 OK 485 55 SvenSE_1126
994 00:00:01 Festival 3.1 OK 240 52 SvenSE_1127
995 00:00:02 Festival 3.1 OK 901 97 SvenSE_1128
996 00:00:01 Festival 3.1 OK 629 169 SvenSE_1129
997 00:00:00 Festival 3.1 OK 603 135 SvenSE_113
998 00:00:01 Festival 3.1 OK 585 205 SvenSE_1130
999 00:00:04 Festival 3.1 OK 516 75 SvenSE_1131
1000 00:00:03 Festival 3.1 OK 466 72 SvenSE_1132
1001 00:00:05 Festival 3.1 OK 460 80 SvenSE_1133
1002 00:00:03 Festival 3.1 OK 621 50 SvenSE_1134
1003 00:00:01 Festival 3.1 OK 187 24 SvenSE_1135
1004 00:00:01 Festival 3.1 OK 199 25 SvenSE_1136
1005 00:00:06 Festival 3.1 OK 549 72 SvenSE_1137
1006 00:00:01 Festival 3.1 OK 183 43 SvenSE_1138
1007 00:00:27 Festival 3.1 OK 1065 177 SvenSE_1139
1008 00:00:01 Festival 3.1 OK 866 132 SvenSE_114
1009 00:00:00 Festival 3.1 OK 66 21 SvenSE_1140
1010 00:00:01 Festival 3.1 OK 356 56 SvenSE_1141
1011 00:00:01 Festival 3.1 OK 129 23 SvenSE_1142
1012 00:00:33 Festival 3.1 OK 1173 220 SvenSE_1143
1013 00:00:07 Festival 3.1 OK 1079 188 SvenSE_1144
1014 00:03:25 Festival 3.1 OK 2314 206 SvenSE_1145
1015 00:03:40 Festival 3.1 OK 1930 256 SvenSE_1146
1016 00:00:16 Festival 3.1 OK 1972 238 SvenSE_1147
1017 00:00:01 Festival 3.1 OK 214 36 SvenSE_1148
1018 00:00:01 Festival 3.1 OK 1080 164 SvenSE_1149
1019 00:00:54 Festival 3.1 OK 811 85 SvenSE_115
1020 00:00:08 Festival 3.1 OK 1290 196 SvenSE_1150
1021 00:00:37 Festival 3.1 OK 378 58 SvenSE_1151
1022 00:00:00 Festival 3.1 OK 519 100 SvenSE_1152
1023 00:00:02 Festival 3.1 OK 789 164 SvenSE_1153
1024 00:00:19 Festival 3.1 OK 1345 251 SvenSE_1154
1025 00:03:34 Festival 3.1 OK 2054 290 SvenSE_1155
1026 00:00:01 Festival 3.1 OK 174 39 SvenSE_1156
1027 00:00:01 Festival 3.1 OK 204 57 SvenSE_1157
1028 00:00:01 Festival 3.1 OK 197 53 SvenSE_1158
1029 00:00:02 Festival 3.1 OK 351 85 SvenSE_1159
1030 00:00:49 Festival 3.1 OK 606 65 SvenSE_116
1031 00:00:18 Festival 3.1 OK 373 65 SvenSE_1160
1032 00:00:01 Festival 3.1 OK 253 86 SvenSE_1161
1033 00:00:13 Festival 3.1 OK 753 150 SvenSE_1162
1034 00:00:00 Festival 3.1 OK 53 13 SvenSE_1163
1035 00:00:02 Festival 3.1 OK 174 34 SvenSE_1164
1036 00:01:52 Festival 3.1 OK 543 112 SvenSE_1165
1037 00:00:09 Festival 3.1 OK 400 82 SvenSE_1166
1038 00:00:01 Festival 3.1 OK 84 21 SvenSE_1167
1039 00:00:21 Festival 3.1 OK 639 81 SvenSE_1168
1040 00:00:00 Festival 3.1 OK 21 7 SvenSE_1169
1041 00:00:04 Festival 3.1 OK 564 66 SvenSE_117
1042 00:00:00 Festival 3.1 OK 40 11 SvenSE_1170
1043 00:00:01 Festival 3.1 OK 50 15 SvenSE_1171
1044 00:00:08 Festival 3.1 OK 489 85 SvenSE_1172
1045 00:00:12 Festival 3.1 OK 963 164 SvenSE_1173
1046 00:00:03 Festival 3.1 OK 740 97 SvenSE_1174
1047 00:00:01 Festival 3.1 OK 493 65 SvenSE_1175
1048 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1176
1049 00:00:00 Festival 3.1 OK 75 14 SvenSE_1177
1050 00:00:05 Festival 3.1 OK 460 82 SvenSE_1178
1051 00:00:00 Festival 3.1 OK 108 21 SvenSE_1179
1052 00:00:08 Festival 3.1 OK 494 82 SvenSE_118
1053 00:00:01 Festival 3.1 OK 301 58 SvenSE_1180
1054 00:00:00 Festival 3.1 OK 165 32 SvenSE_1181
1055 00:00:01 Festival 3.1 OK 288 57 SvenSE_1182
1056 00:00:01 Festival 3.1 OK 246 57 SvenSE_1183
1057 00:00:02 Festival 3.1 OK 386 89 SvenSE_1184
1058 00:03:21 Festival 3.1 OK 914 165 SvenSE_1185
1059 00:00:01 Festival 3.1 OK 111 14 SvenSE_1186
1060 00:06:31 Festival 3.1 OK 1779 260 SvenSE_1187
1061 00:00:01 Festival 3.1 OK 180 23 SvenSE_1188
1062 00:00:01 Festival 3.1 OK 330 60 SvenSE_1189
1063 00:00:00 Festival 3.1 OK 230 24 SvenSE_119
1064 00:00:01 Festival 3.1 OK 143 44 SvenSE_1190
1065 00:00:01 Festival 3.1 OK 312 29 SvenSE_1191
1066 00:00:00 Festival 3.1 OK 151 15 SvenSE_1192
1067 00:00:02 Festival 3.1 OK 600 70 SvenSE_1193
1068 00:00:21 Festival 3.1 OK 1054 70 SvenSE_1194
1069 00:00:04 Festival 3.1 OK 308 35 SvenSE_1195
1070 00:05:24 Festival 3.1 OK 1462 132 SvenSE_1196
1071 00:00:02 Festival 3.1 OK 970 164 SvenSE_1197
1072 00:00:02 Festival 3.1 OK 978 172 SvenSE_1198
1073 00:00:00 Festival 3.1 OK 496 99 SvenSE_1199
1074 00:00:03 Festival 3.1 OK 820 144 SvenSE_12
1075 00:00:01 Festival 3.1 OK 49 15 SvenSE_120
1076 00:00:29 Festival 3.1 OK 877 150 SvenSE_1200
1077 00:00:01 Festival 3.1 OK 89 18 SvenSE_1201
1078 00:00:02 Festival 3.1 OK 547 94 SvenSE_1202
1079 00:00:01 Festival 3.1 OK 131 28 SvenSE_1203
1080 00:00:01 Festival 3.1 OK 200 39 SvenSE_1204
1081 00:00:00 Festival 3.1 OK 327 58 SvenSE_1205
1082 00:00:01 Festival 3.1 OK 250 50 SvenSE_1206
1083 00:00:00 Festival 3.1 OK 227 52 SvenSE_1207
1084 00:00:07 Festival 3.1 OK 547 72 SvenSE_1208
1085 00:00:04 Festival 3.1 OK 490 68 SvenSE_1209
1086 00:00:00 Festival 3.1 OK 218 20 SvenSE_121
1087 00:00:01 Festival 3.1 OK 603 96 SvenSE_1210
1088 00:00:07 Festival 3.1 OK 1221 178 SvenSE_1211
1089 00:00:05 Festival 3.1 OK 840 147 SvenSE_1212
1090 00:00:02 Festival 3.1 OK 518 88 SvenSE_1213
1091 00:02:21 Festival 3.1 OK 1067 198 SvenSE_1214
1092 00:00:01 Festival 3.1 OK 1230 164 SvenSE_1215
1093 00:00:06 Festival 3.1 OK 1717 208 SvenSE_1216
1094 00:00:03 Festival 3.1 OK 523 108 SvenSE_1217
1095 00:00:01 Festival 3.1 OK 433 74 SvenSE_1218
1096 00:00:06 Festival 3.1 OK 696 90 SvenSE_1219
1097 00:00:00 Festival 3.1 OK 189 25 SvenSE_122
1098 00:00:01 Festival 3.1 OK 225 41 SvenSE_1220
1099 00:00:07 Festival 3.1 OK 898 156 SvenSE_1221
1100 00:00:00 Festival 3.1 OK 194 32 SvenSE_1222
1101 00:00:01 Festival 3.1 OK 185 42 SvenSE_1223
1102 00:00:01 Festival 3.1 OK 103 20 SvenSE_1224
1103 00:00:01 Festival 3.1 OK 546 124 SvenSE_1225
1104 00:04:51 Festival 3.1 OK 2580 411 SvenSE_1226
1105 00:00:02 Festival 3.1 OK 847 191 SvenSE_1227
1106 00:03:23 Festival 3.1 OK 2245 294 SvenSE_1228
1107 00:00:01 Festival 3.1 OK 245 36 SvenSE_1229
1108 00:00:01 Festival 3.1 OK 160 20 SvenSE_123
1109 00:00:00 Festival 3.1 OK 204 34 SvenSE_1230
1110 00:00:01 Festival 3.1 OK 282 75 SvenSE_1231
1111 00:00:02 Festival 3.1 OK 341 90 SvenSE_1232
1112 00:00:01 Festival 3.1 OK 513 104 SvenSE_1233
1113 00:00:08 Festival 3.1 OK 847 232 SvenSE_1234
1114 00:00:02 Festival 3.1 OK 1300 452 SvenSE_1235
1115 00:01:39 Festival 3.1 OK 1815 486 SvenSE_1236
1116 00:00:01 Festival 3.1 OK 94 15 SvenSE_1237
1117 00:00:01 Festival 3.1 OK 200 38 SvenSE_1238
1118 00:00:02 Festival 3.1 OK 502 86 SvenSE_1239
1119 00:00:01 Festival 3.1 OK 109 25 SvenSE_124
1120 00:00:01 Festival 3.1 OK 333 49 SvenSE_1240
1121 00:00:00 Festival 3.1 OK 125 33 SvenSE_1241
1122 00:00:03 Festival 3.1 OK 400 90 SvenSE_1242
1123 00:00:01 Festival 3.1 OK 205 55 SvenSE_1243
1124 00:00:03 Festival 3.1 OK 1092 134 SvenSE_1244
1125 00:01:17 Festival 3.1 OK 2296 390 SvenSE_1245
1126 00:03:40 Festival 3.1 OK 4259 582 SvenSE_1246
1127 00:00:01 Festival 3.1 OK 695 122 SvenSE_1247
1128 00:00:16 Festival 3.1 OK 1027 156 SvenSE_1248
1129 00:03:22 Festival 3.1 OK 2763 407 SvenSE_1249
1130 00:00:01 Festival 3.1 OK 242 24 SvenSE_125
1131 00:00:20 Festival 3.1 OK 749 72 SvenSE_1250
1132 00:00:03 Festival 3.1 OK 1222 140 SvenSE_1251
1133 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1252
1134 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1253
1135 00:06:45 Festival 3.1 OK 1721 340 SvenSE_1254
1136 00:00:03 Festival 3.1 OK 953 166 SvenSE_1255
1137 00:00:00 Festival 3.1 OK 674 150 SvenSE_1256
1138 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1257
1139 00:00:00 Festival 3.1 OK 90 23 SvenSE_1258
1140 00:00:01 Festival 3.1 OK 152 37 SvenSE_1259
1141 00:03:22 Festival 3.1 OK 723 136 SvenSE_126
1142 00:00:01 Festival 3.1 OK 202 51 SvenSE_1260
1143 00:00:00 Festival 3.1 OK 168 43 SvenSE_1261
1144 00:00:01 Festival 3.1 OK 280 77 SvenSE_1262
1145 00:00:01 Festival 3.1 OK 250 60 SvenSE_1263
1146 00:00:01 Festival 3.1 OK 614 122 SvenSE_1264
1147 00:00:01 Festival 3.1 OK 328 88 SvenSE_1265
1148 00:00:01 Festival 3.1 OK 396 111 SvenSE_1266
1149 00:00:16 Festival 3.1 OK 881 109 SvenSE_1267
1150 00:00:01 Festival 3.1 OK 539 168 SvenSE_1268
1151 00:00:01 Festival 3.1 OK 354 98 SvenSE_1269
1152 00:00:01 Festival 3.1 OK 250 32 SvenSE_127
1153 00:00:01 Festival 3.1 OK 205 51 SvenSE_1270
1154 00:00:01 Festival 3.1 OK 458 98 SvenSE_1271
1155 00:03:37 Festival 3.1 OK 1699 392 SvenSE_1272
1156 00:00:37 Festival 3.1 OK 1599 562 SvenSE_1273
1157 00:00:01 Festival 3.1 OK 133 28 SvenSE_1274
1158 00:00:01 Festival 3.1 OK 444 70 SvenSE_1275
1159 00:02:13 Festival 3.1 OK 1278 376 SvenSE_1276
1160 00:00:01 Festival 3.1 OK 250 58 SvenSE_1277
1161 00:00:01 Festival 3.1 OK 243 61 SvenSE_1278
1162 00:00:09 Festival 3.1 OK 1158 198 SvenSE_1279
1163 00:00:00 Festival 3.1 OK 193 31 SvenSE_128
1164 00:00:01 Festival 3.1 OK 615 112 SvenSE_1280
1165 00:00:01 Festival 3.1 OK 391 99 SvenSE_1281
1166 00:00:00 Festival 3.1 OK 298 71 SvenSE_1282
1167 00:01:00 Festival 3.1 OK 1321 256 SvenSE_1283
1168 00:00:01 Festival 3.1 OK 745 235 SvenSE_1284
1169 00:00:02 Festival 3.1 OK 543 148 SvenSE_1285
1170 00:00:00 Festival 3.1 OK 242 54 SvenSE_1286
1171 00:00:04 Festival 3.1 OK 1057 272 SvenSE_1287
1172 00:03:22 Festival 3.1 OK 2353 522 SvenSE_1288
1173 00:00:01 Festival 3.1 OK 304 77 SvenSE_1289
1174 00:00:01 Festival 3.1 OK 222 30 SvenSE_129
1175 00:00:00 Festival 3.1 OK 230 65 SvenSE_1290
1176 00:03:03 Festival 3.1 OK 1465 254 SvenSE_1291
1177 00:00:05 Festival 3.1 OK 479 97 SvenSE_1292
1178 00:00:01 Festival 3.1 OK 244 30 SvenSE_1293
1179 00:00:26 Festival 3.1 OK 1152 138 SvenSE_1294
1180 00:00:01 Festival 3.1 OK 447 76 SvenSE_1295
1181 00:00:01 Festival 3.1 OK 338 81 SvenSE_1296
1182 00:07:12 Festival 3.1 OK 2698 314 SvenSE_1297
1183 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1298
1184 00:00:04 Festival 3.1 OK 340 58 SvenSE_1299
1185 00:00:07 Festival 3.1 OK 1996 503 SvenSE_13
1186 00:00:01 Festival 3.1 OK 266 32 SvenSE_130
1187 00:00:00 Festival 3.1 OK 619 105 SvenSE_1300
1188 00:00:01 Festival 3.1 OK 393 53 SvenSE_1301
1189 00:02:36 Festival 3.1 OK 1192 226 SvenSE_1302
1190 00:00:01 Festival 3.1 OK 389 72 SvenSE_1303
1191 00:01:58 Festival 3.1 OK 656 123 SvenSE_1304
1192 00:00:02 Festival 3.1 OK 488 126 SvenSE_1305
1193 00:00:01 Festival 3.1 OK 637 132 SvenSE_1306
1194 00:00:01 Festival 3.1 OK 1098 212 SvenSE_1307
1195 00:00:02 Festival 3.1 OK 473 91 SvenSE_1308
1196 00:00:03 Festival 3.1 OK 993 161 SvenSE_1309
1197 00:00:01 Festival 3.1 OK 159 30 SvenSE_131
1198 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1310
1199 00:00:31 Festival 3.1 OK 531 126 SvenSE_1311
1200 00:00:01 Festival 3.1 OK 258 78 SvenSE_1312
1201 00:00:00 Festival 3.1 OK 253 83 SvenSE_1313
1202 00:00:21 Festival 3.1 OK 1060 218 SvenSE_1314
1203 00:00:05 Festival 3.1 OK 1203 248 SvenSE_1315
1204 00:00:01 Festival 3.1 OK 320 70 SvenSE_1316
1205 00:00:01 Festival 3.1 OK 287 50 SvenSE_1317
1206 00:00:03 Festival 3.1 OK 1028 180 SvenSE_1318
1207 00:00:01 Festival 3.1 OK 432 48 SvenSE_1319
1208 00:00:02 Festival 3.1 OK 527 60 SvenSE_132
1209 00:05:53 Festival 3.1 OK 1300 172 SvenSE_1320
1210 00:00:07 Festival 3.1 OK 722 206 SvenSE_1321
1211 00:00:00 Festival 3.1 OK 138 24 SvenSE_1322
1212 00:05:27 Festival 3.1 OK 808 122 SvenSE_1323
1213 00:00:04 Festival 3.1 OK 638 154 SvenSE_1324
1214 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1325
1215 00:00:00 Festival 3.1 OK 390 52 SvenSE_1326
1216 00:02:04 Festival 3.1 OK 729 130 SvenSE_1327
1217 00:03:51 Festival 3.1 OK 1824 274 SvenSE_1328
1218 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1329
1219 00:00:00 Festival 3.1 OK 328 72 SvenSE_133
1220 00:03:23 Festival 3.1 OK 2141 172 SvenSE_1330
1221 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1331
1222 00:04:16 Festival 3.1 OK 1813 305 SvenSE_1332
1223 00:00:00 Festival 3.1 OK 403 91 SvenSE_1333
1224 00:03:21 Festival 3.1 OK 1340 274 SvenSE_1334
1225 00:00:02 Festival 3.1 OK 447 63 SvenSE_1335
1226 00:00:31 Festival 3.1 OK 1256 230 SvenSE_1336
1227 00:00:01 Festival 3.1 OK 354 54 SvenSE_1337
1228 00:00:00 Festival 3.1 OK 375 56 SvenSE_1338
1229 00:00:05 Festival 3.1 OK 803 124 SvenSE_1339
1230 00:00:01 Festival 3.1 OK 134 26 SvenSE_134
1231 00:00:03 Festival 3.1 OK 487 78 SvenSE_1340
1232 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1341
1233 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1342
1234 00:00:01 Festival 3.1 OK 654 151 SvenSE_1343
1235 00:04:45 Festival 3.1 OK 3166 322 SvenSE_1344
1236 00:00:07 Festival 3.1 OK 474 130 SvenSE_1345
1237 00:00:01 Festival 3.1 OK 88 28 SvenSE_1346
1238 00:00:03 Festival 3.1 OK 761 162 SvenSE_1347
1239 00:00:24 Festival 3.1 OK 1293 316 SvenSE_1348
1240 00:00:04 Festival 3.1 OK 610 102 SvenSE_1349
1241 00:00:01 Festival 3.1 OK 174 32 SvenSE_135
1242 00:00:13 Festival 3.1 OK 840 180 SvenSE_1350
1243 00:00:01 Festival 3.1 OK 176 52 SvenSE_1351
1244 00:00:09 Festival 3.1 OK 363 108 SvenSE_1352
1245 00:00:02 Festival 3.1 OK 539 92 SvenSE_1353
1246 00:00:01 Festival 3.1 OK 446 80 SvenSE_1354
1247 00:00:03 Festival 3.1 OK 492 85 SvenSE_1355
1248 00:00:01 Festival 3.1 OK 407 84 SvenSE_1356
1249 00:00:03 Festival 3.1 OK 505 117 SvenSE_1357
1250 00:04:49 Festival 3.1 OK 1111 246 SvenSE_1358
1251 00:00:03 Festival 3.1 OK 392 71 SvenSE_1359
1252 00:00:00 Festival 3.1 OK 80 18 SvenSE_136
1253 00:00:02 Festival 3.1 OK 441 56 SvenSE_1360
1254 00:00:02 Festival 3.1 OK 1022 142 SvenSE_1361
1255 00:00:02 Festival 3.1 OK 1453 258 SvenSE_1362
1256 00:00:02 Festival 3.1 OK 468 154 SvenSE_1363
1257 00:00:01 Festival 3.1 OK 902 145 SvenSE_1364
1258 00:00:00 Festival 3.1 OK 425 110 SvenSE_1365
1259 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1366
1260 00:00:03 Festival 3.1 OK 929 251 SvenSE_1367
1261 00:00:06 Festival 3.1 OK 1828 206 SvenSE_1368
1262 00:00:01 Festival 3.1 OK 401 69 SvenSE_1369
1263 00:00:01 Festival 3.1 OK 225 34 SvenSE_137
1264 00:00:05 Festival 3.1 OK 425 54 SvenSE_1370
1265 00:00:00 Festival 3.1 OK 495 66 SvenSE_1371
1266 00:00:02 Festival 3.1 OK 314 71 SvenSE_1372
1267 00:00:07 Festival 3.1 OK 448 102 SvenSE_1373
1268 00:00:00 Festival 3.1 OK 248 33 SvenSE_1374
1269 00:00:01 Festival 3.1 OK 449 47 SvenSE_1375
1270 00:00:03 Festival 3.1 OK 314 76 SvenSE_1376
1271 00:00:01 Festival 3.1 OK 764 178 SvenSE_1377
1272 00:00:01 Festival 3.1 OK 315 80 SvenSE_1378
1273 00:00:10 Festival 3.1 OK 1396 359 SvenSE_1379
1274 00:00:02 Festival 3.1 OK 258 36 SvenSE_138
1275 00:00:03 Festival 3.1 OK 533 120 SvenSE_1380
1276 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1381
1277 00:00:54 Festival 3.1 OK 1239 261 SvenSE_1382
1278 00:00:48 Festival 3.1 OK 992 192 SvenSE_1383
1279 00:00:01 Festival 3.1 OK 418 76 SvenSE_1384
1280 00:00:03 Festival 3.1 OK 447 70 SvenSE_1385
1281 00:00:00 Festival 3.1 OK 115 21 SvenSE_1386
1282 00:00:03 Festival 3.1 OK 576 102 SvenSE_1387
1283 00:00:01 Festival 3.1 OK 259 42 SvenSE_1388
1284 00:02:07 Festival 3.1 OK 403 104 SvenSE_1389
1285 00:00:01 Festival 3.1 OK 336 68 SvenSE_139
1286 00:01:34 Festival 3.1 OK 545 102 SvenSE_1390
1287 00:00:01 Festival 3.1 OK 307 36 SvenSE_1391
1288 00:00:44 Festival 3.1 OK 1095 92 SvenSE_1392
1289 00:00:01 Festival 3.1 OK 644 119 SvenSE_1393
1290 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1394
1291 00:00:12 Festival 3.1 OK 2155 376 SvenSE_1395
1292 00:00:00 Festival 3.1 OK 364 55 SvenSE_1396
1293 00:00:02 Festival 3.1 OK 321 63 SvenSE_1397
1294 00:04:26 Festival 3.1 OK 1029 162 SvenSE_1398
1295 00:02:47 Festival 3.1 OK 971 230 SvenSE_1399
1296 00:00:00 Festival 3.1 OK 2036 586 SvenSE_14
1297 00:00:01 Festival 3.1 OK 530 98 SvenSE_140
1298 00:00:01 Festival 3.1 OK 109 22 SvenSE_1400
1299 00:00:01 Festival 3.1 OK 880 176 SvenSE_1401
1300 00:00:01 Festival 3.1 OK 66 16 SvenSE_1402
1301 00:00:29 Festival 3.1 OK 992 176 SvenSE_1403
1302 00:00:13 Festival 3.1 OK 1404 200 SvenSE_1404
1303 00:00:17 Festival 3.1 OK 1964 459 SvenSE_1405
1304 00:00:01 Festival 3.1 OK 439 73 SvenSE_1406
1305 00:00:05 Festival 3.1 OK 1839 193 SvenSE_1407
1306 00:01:36 Festival 3.1 OK 1364 180 SvenSE_1408
1307 00:00:28 Festival 3.1 OK 882 94 SvenSE_1409
1308 00:00:02 Festival 3.1 OK 1220 263 SvenSE_141
1309 00:00:18 Festival 3.1 OK 1010 114 SvenSE_1410
1310 00:02:45 Festival 3.1 OK 2412 297 SvenSE_1411
1311 00:00:01 Festival 3.1 OK 155 26 SvenSE_1412
1312 00:00:01 Festival 3.1 OK 228 31 SvenSE_1413
1313 00:00:00 Festival 3.1 OK 354 48 SvenSE_1414
1314 00:00:06 Festival 3.1 OK 904 162 SvenSE_1415
1315 00:01:18 Festival 3.1 OK 1122 210 SvenSE_1416
1316 00:00:44 Festival 3.1 OK 694 150 SvenSE_1417
1317 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1418
1318 00:00:02 Festival 3.1 OK 647 145 SvenSE_1419
1319 00:00:04 Festival 3.1 OK 550 62 SvenSE_142
1320 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1420
1321 00:00:06 Festival 3.1 OK 855 116 SvenSE_1421
1322 00:00:01 Festival 3.1 OK 200 31 SvenSE_1422
1323 00:00:00 Festival 3.1 OK 247 62 SvenSE_1423
1324 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1424
1325 00:00:03 Festival 3.1 OK 779 147 SvenSE_1425
1326 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1426
1327 00:00:00 Festival 3.1 OK 44 10 SvenSE_1427
1328 00:00:02 Festival 3.1 OK 598 44 SvenSE_1428
1329 00:00:01 Festival 3.1 OK 526 51 SvenSE_1429
1330 00:00:11 Festival 3.1 OK 656 86 SvenSE_143
1331 00:00:33 Festival 3.1 OK 532 112 SvenSE_1430
1332 00:00:01 Festival 3.1 OK 357 71 SvenSE_1431
1333 00:00:00 Festival 3.1 OK 202 56 SvenSE_1432
1334 00:00:01 Festival 3.1 OK 145 35 SvenSE_1433
1335 00:02:07 Festival 3.1 OK 1432 312 SvenSE_1434
1336 00:00:23 Festival 3.1 OK 1469 227 SvenSE_1435
1337 00:00:01 Festival 3.1 OK 799 194 SvenSE_1436
1338 00:00:15 Festival 3.1 OK 463 156 SvenSE_1437
1339 00:00:00 Festival 3.1 OK 136 38 SvenSE_1438
1340 00:00:01 Festival 3.1 OK 222 36 SvenSE_1439
1341 00:03:35 Festival 3.1 OK 5135 1145 SvenSE_144
1342 00:00:00 Festival 3.1 OK 166 35 SvenSE_1440
1343 00:00:01 Festival 3.1 OK 218 35 SvenSE_1441
1344 00:00:10 Festival 3.1 OK 721 112 SvenSE_1442
1345 00:00:01 Festival 3.1 OK 729 138 SvenSE_1443
1346 00:00:01 Festival 3.1 OK 233 41 SvenSE_1444
1347 00:00:01 Festival 3.1 OK 447 112 SvenSE_1445
1348 00:00:03 Festival 3.1 OK 441 84 SvenSE_1446
1349 00:00:09 Festival 3.1 OK 976 120 SvenSE_1447
1350 00:00:01 Festival 3.1 OK 194 46 SvenSE_1448
1351 00:00:13 Festival 3.1 OK 1619 298 SvenSE_1449
1352 00:00:01 Festival 3.1 OK 700 260 SvenSE_145
1353 00:00:01 Festival 3.1 OK 165 43 SvenSE_1450
1354 00:00:04 Festival 3.1 OK 445 107 SvenSE_1451
1355 00:00:01 Festival 3.1 OK 849 117 SvenSE_1452
1356 00:01:11 Festival 3.1 OK 505 176 SvenSE_1453
1357 00:00:01 Festival 3.1 OK 508 134 SvenSE_1454
1358 00:00:01 Festival 3.1 OK 213 41 SvenSE_1455
1359 00:00:01 Festival 3.1 OK 277 47 SvenSE_1456
1360 00:00:10 Festival 3.1 OK 1079 185 SvenSE_1457
1361 00:00:08 Festival 3.1 OK 665 83 SvenSE_1458
1362 00:00:40 Festival 3.1 OK 1250 196 SvenSE_1459
1363 00:00:07 Festival 3.1 OK 1262 217 SvenSE_146
1364 00:00:02 Festival 3.1 OK 398 86 SvenSE_1460
1365 00:00:03 Festival 3.1 OK 409 54 SvenSE_1461
1366 00:04:21 Festival 3.1 OK 2318 406 SvenSE_1462
1367 00:00:03 Festival 3.1 OK 747 120 SvenSE_1463
1368 00:00:10 Festival 3.1 OK 359 100 SvenSE_1464
1369 00:00:33 Festival 3.1 OK 1337 257 SvenSE_1465
1370 00:00:00 Festival 3.1 OK 408 100 SvenSE_1466
1371 00:00:01 Festival 3.1 OK 317 53 SvenSE_1467
1372 00:01:24 Festival 3.1 OK 1380 277 SvenSE_1468
1373 00:00:01 Festival 3.1 OK 344 99 SvenSE_1469
1374 00:00:00 Festival 3.1 OK 308 54 SvenSE_147
1375 00:03:34 Festival 3.1 OK 848 154 SvenSE_1470
1376 00:00:01 Festival 3.1 OK 363 65 SvenSE_1471
1377 00:00:17 Festival 3.1 OK 441 122 SvenSE_1472
1378 00:00:02 Festival 3.1 OK 791 143 SvenSE_1473
1379 00:00:02 Festival 3.1 OK 313 72 SvenSE_1474
1380 00:00:00 Festival 3.1 OK 189 42 SvenSE_1475
1381 00:01:09 Festival 3.1 OK 1034 217 SvenSE_1476
1382 00:00:02 Festival 3.1 OK 743 211 SvenSE_1477
1383 00:00:02 Festival 3.1 OK 162 38 SvenSE_1478
1384 00:00:01 Festival 3.1 OK 556 130 SvenSE_1479
1385 00:00:00 Festival 3.1 OK 368 64 SvenSE_148
1386 00:00:01 Festival 3.1 OK 487 113 SvenSE_1480
1387 00:00:01 Festival 3.1 OK 158 30 SvenSE_1481
1388 00:00:01 Festival 3.1 OK 790 134 SvenSE_1482
1389 00:00:01 Festival 3.1 OK 342 54 SvenSE_1483
1390 00:00:01 Festival 3.1 OK 455 59 SvenSE_1484
1391 00:00:00 Festival 3.1 OK 347 49 SvenSE_1485
1392 00:00:05 Festival 3.1 OK 712 112 SvenSE_1486
1393 00:00:01 Festival 3.1 OK 477 96 SvenSE_1487
1394 00:00:01 Festival 3.1 OK 1034 228 SvenSE_1488
1395 00:00:03 Festival 3.1 OK 730 88 SvenSE_1489
1396 00:00:00 Festival 3.1 OK 226 34 SvenSE_149
1397 00:00:01 Festival 3.1 OK 368 80 SvenSE_1490
1398 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1491
1399 00:00:00 Festival 3.1 OK 302 80 SvenSE_1492
1400 00:00:01 Festival 3.1 OK 298 64 SvenSE_1493
1401 00:00:01 Festival 3.1 OK 277 76 SvenSE_1494
1402 00:00:01 Festival 3.1 OK 270 70 SvenSE_1495
1403 00:00:01 Festival 3.1 OK 181 52 SvenSE_1496
1404 00:00:24 Festival 3.1 OK 533 142 SvenSE_1497
1405 00:00:00 Festival 3.1 OK 220 38 SvenSE_1498
1406 00:00:01 Festival 3.1 OK 297 102 SvenSE_1499
1407 00:00:08 Festival 3.1 OK 8125 1562 SvenSE_15
1408 00:00:00 Festival 3.1 OK 224 44 SvenSE_150
1409 00:00:00 Festival 3.1 OK 106 31 SvenSE_1500
1410 00:00:04 Festival 3.1 OK 665 106 SvenSE_1501
1411 00:00:05 Festival 3.1 OK 472 112 SvenSE_1502
1412 00:00:01 Festival 3.1 OK 529 78 SvenSE_1503
1413 00:00:01 Festival 3.1 OK 309 56 SvenSE_1504
1414 00:00:01 Festival 3.1 OK 285 34 SvenSE_1505
1415 00:04:16 Festival 3.1 OK 1543 218 SvenSE_1506
1416 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1507
1417 00:00:42 Festival 3.1 OK 2758 230 SvenSE_1508
1418 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1509
1419 00:00:08 Festival 3.1 OK 458 64 SvenSE_151
1420 00:00:12 Festival 3.1 OK 938 152 SvenSE_1510
1421 00:00:04 Festival 3.1 OK 332 74 SvenSE_1511
1422 00:00:00 Festival 3.1 OK 88 16 SvenSE_1512
1423 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1513
1424 00:00:01 Festival 3.1 OK 650 106 SvenSE_1514
1425 00:00:04 Festival 3.1 OK 1135 288 SvenSE_1515
1426 00:01:01 Festival 3.1 OK 419 86 SvenSE_1516
1427 00:00:12 Festival 3.1 OK 983 185 SvenSE_1517
1428 00:00:01 Festival 3.1 OK 192 36 SvenSE_1518
1429 00:00:03 Festival 3.1 OK 427 72 SvenSE_1519
1430 00:00:01 Festival 3.1 OK 676 213 SvenSE_152
1431 00:00:02 Festival 3.1 OK 398 70 SvenSE_1520
1432 00:00:02 Festival 3.1 OK 359 54 SvenSE_1521
1433 00:00:10 Festival 3.1 OK 523 96 SvenSE_1522
1434 00:00:03 Festival 3.1 OK 434 64 SvenSE_1523
1435 00:00:00 Festival 3.1 OK 82 18 SvenSE_1524
1436 00:00:01 Festival 3.1 OK 197 28 SvenSE_1525
1437 00:00:01 Festival 3.1 OK 132 33 SvenSE_1526
1438 00:00:02 Festival 3.1 OK 314 60 SvenSE_1527
1439 00:00:01 Festival 3.1 OK 311 56 SvenSE_1528
1440 00:00:01 Festival 3.1 OK 116 26 SvenSE_1529
1441 00:00:07 Festival 3.1 OK 564 56 SvenSE_153
1442 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1530
1443 00:00:59 Festival 3.1 OK 522 66 SvenSE_1531
1444 00:00:00 Festival 3.1 OK 460 72 SvenSE_1532
1445 00:03:09 Festival 3.1 OK 2000 270 SvenSE_1533
1446 00:00:01 Festival 3.1 OK 430 70 SvenSE_1534
1447 00:00:01 Festival 3.1 OK 289 32 SvenSE_1535
1448 00:00:01 Festival 3.1 OK 373 83 SvenSE_1536
1449 00:00:01 Festival 3.1 OK 741 152 SvenSE_1537
1450 00:00:01 Festival 3.1 OK 391 59 SvenSE_1538
1451 00:00:00 Festival 3.1 OK 299 45 SvenSE_1539
1452 00:00:10 Festival 3.1 OK 1060 160 SvenSE_154
1453 00:00:01 Festival 3.1 OK 205 45 SvenSE_1540
1454 00:00:01 Festival 3.1 OK 338 43 SvenSE_1541
1455 00:00:05 Festival 3.1 OK 728 138 SvenSE_1542
1456 00:00:01 Festival 3.1 OK 275 41 SvenSE_1543
1457 00:00:01 Festival 3.1 OK 188 28 SvenSE_1544
1458 00:00:00 Festival 3.1 OK 184 26 SvenSE_1545
1459 00:00:03 Festival 3.1 OK 625 52 SvenSE_1546
1460 00:01:20 Festival 3.1 OK 515 73 SvenSE_1547
1461 00:00:01 Festival 3.1 OK 236 70 SvenSE_1548
1462 00:00:00 Festival 3.1 OK 166 49 SvenSE_1549
1463 00:00:11 Festival 3.1 OK 788 86 SvenSE_155
1464 00:00:01 Festival 3.1 OK 513 70 SvenSE_1550
1465 00:00:07 Festival 3.1 OK 368 76 SvenSE_1551
1466 00:00:00 Festival 3.1 OK 239 23 SvenSE_1552
1467 00:00:02 Festival 3.1 OK 325 36 SvenSE_1553
1468 00:00:01 Festival 3.1 OK 547 88 SvenSE_1554
1469 00:00:08 Festival 3.1 OK 554 86 SvenSE_1555
1470 00:00:02 Festival 3.1 OK 655 126 SvenSE_1556
1471 00:00:01 Festival 3.1 OK 508 62 SvenSE_1557
1472 00:00:01 Festival 3.1 OK 295 66 SvenSE_1558
1473 00:00:00 Festival 3.1 OK 99 22 SvenSE_1559
1474 00:01:31 Festival 3.1 OK 976 146 SvenSE_156
1475 00:02:33 Festival 3.1 OK 2479 306 SvenSE_1560
1476 00:00:04 Festival 3.1 OK 1061 227 SvenSE_1561
1477 00:00:00 Festival 3.1 OK 380 90 SvenSE_1562
1478 00:00:02 Festival 3.1 OK 425 77 SvenSE_1563
1479 00:00:01 Festival 3.1 OK 374 80 SvenSE_1564
1480 00:00:01 Festival 3.1 OK 256 56 SvenSE_1565
1481 00:00:10 Festival 3.1 OK 3372 571 SvenSE_1566
1482 00:00:00 Festival 3.1 OK 485 161 SvenSE_1567
1483 00:00:01 Festival 3.1 OK 150 37 SvenSE_1568
1484 00:00:01 Festival 3.1 OK 343 58 SvenSE_1569
1485 00:00:00 Festival 3.1 OK 84 10 SvenSE_157
1486 00:00:03 Festival 3.1 OK 362 76 SvenSE_1570
1487 00:00:01 Festival 3.1 OK 92 24 SvenSE_1571
1488 00:01:22 Festival 3.1 OK 1148 200 SvenSE_1572
1489 00:00:07 Festival 3.1 OK 808 142 SvenSE_1573
1490 00:00:08 Festival 3.1 OK 718 273 SvenSE_1574
1491 00:00:01 Festival 3.1 OK 183 40 SvenSE_1575
1492 00:00:01 Festival 3.1 OK 100 32 SvenSE_1576
1493 00:00:01 Festival 3.1 OK 47 16 SvenSE_1577
1494 00:00:00 Festival 3.1 OK 179 52 SvenSE_1578
1495 00:00:01 Festival 3.1 OK 199 35 SvenSE_1579
1496 00:01:12 Festival 3.1 OK 1232 112 SvenSE_158
1497 00:00:02 Festival 3.1 OK 335 60 SvenSE_1580
1498 00:00:00 Festival 3.1 OK 217 36 SvenSE_1581
1499 00:00:01 Festival 3.1 OK 194 48 SvenSE_1582
1500 00:00:30 Festival 3.1 OK 2145 382 SvenSE_1583
1501 00:03:28 Festival 3.1 OK 2712 266 SvenSE_1584
1502 00:00:01 Festival 3.1 OK 155 33 SvenSE_1585
1503 00:00:01 Festival 3.1 OK 165 15 SvenSE_1586
1504 00:00:02 Festival 3.1 OK 790 98 SvenSE_1587
1505 00:00:01 Festival 3.1 OK 690 74 SvenSE_1588
1506 00:01:04 Festival 3.1 OK 1139 110 SvenSE_1589
1507 00:00:13 Festival 3.1 OK 560 88 SvenSE_159
1508 00:00:01 Festival 3.1 OK 244 26 SvenSE_1590
1509 00:00:01 Festival 3.1 OK 146 24 SvenSE_1591
1510 00:00:02 Festival 3.1 OK 280 72 SvenSE_1592
1511 00:00:07 Festival 3.1 OK 861 268 SvenSE_1593
1512 00:00:00 Festival 3.1 OK 166 32 SvenSE_1594
1513 00:00:02 Festival 3.1 OK 419 115 SvenSE_1595
1514 00:00:01 Festival 3.1 OK 508 96 SvenSE_1596
1515 00:00:32 Festival 3.1 OK 813 207 SvenSE_1597
1516 00:00:01 Festival 3.1 OK 949 213 SvenSE_1598
1517 00:00:00 Festival 3.1 OK 141 39 SvenSE_1599
1518 00:10:01 Festival 3.1 Time limit exceeded SvenSE_16
1519 00:00:04 Festival 3.1 OK 776 96 SvenSE_160
1520 00:00:00 Festival 3.1 OK 72 16 SvenSE_1600
1521 00:00:01 Festival 3.1 OK 64 16 SvenSE_1601
1522 00:00:28 Festival 3.1 OK 2639 612 SvenSE_1602
1523 00:00:01 Festival 3.1 OK 231 46 SvenSE_1603
1524 00:00:10 Festival 3.1 OK 2015 375 SvenSE_1604
1525 00:00:14 Festival 3.1 OK 2355 438 SvenSE_1605
1526 00:00:01 Festival 3.1 OK 244 50 SvenSE_1606
1527 00:00:29 Festival 3.1 OK 2735 1128 SvenSE_1607
1528 00:00:03 Festival 3.1 OK 1007 182 SvenSE_1608
1529 00:00:01 Festival 3.1 OK 859 207 SvenSE_1609
1530 00:00:08 Festival 3.1 OK 1032 98 SvenSE_161
1531 00:00:02 Festival 3.1 OK 469 81 SvenSE_1610
1532 00:00:00 Festival 3.1 OK 671 134 SvenSE_1611
1533 00:00:02 Festival 3.1 OK 457 72 SvenSE_1612
1534 00:00:01 Festival 3.1 OK 151 32 SvenSE_1613
1535 00:00:00 Festival 3.1 OK 396 62 SvenSE_1614
1536 00:00:01 Festival 3.1 OK 342 69 SvenSE_1615
1537 00:00:03 Festival 3.1 OK 559 99 SvenSE_1616
1538 00:00:01 Festival 3.1 OK 378 74 SvenSE_1617
1539 00:00:00 Festival 3.1 OK 117 28 SvenSE_1618
1540 00:00:01 Festival 3.1 OK 550 105 SvenSE_1619
1541 00:00:02 Festival 3.1 OK 288 30 SvenSE_162
1542 00:00:30 Festival 3.1 OK 3639 630 SvenSE_1620
1543 00:00:02 Festival 3.1 OK 1585 241 SvenSE_1621
1544 00:00:03 Festival 3.1 OK 607 72 SvenSE_1622
1545 00:05:08 Festival 3.1 OK 3938 320 SvenSE_1623
1546 00:00:09 Festival 3.1 OK 801 108 SvenSE_1624
1547 00:00:02 Festival 3.1 OK 424 90 SvenSE_1625
1548 00:00:05 Festival 3.1 OK 1042 141 SvenSE_1626
1549 00:00:01 Festival 3.1 OK 476 80 SvenSE_1627
1550 00:00:01 Festival 3.1 OK 368 52 SvenSE_1628
1551 00:00:01 Festival 3.1 OK 701 141 SvenSE_1629
1552 00:00:02 Festival 3.1 OK 346 62 SvenSE_163
1553 00:00:09 Festival 3.1 OK 711 134 SvenSE_1630
1554 00:00:00 Festival 3.1 OK 80 13 SvenSE_1631
1555 00:00:01 Festival 3.1 OK 54 12 SvenSE_1632
1556 00:00:00 Festival 3.1 OK 94 20 SvenSE_1633
1557 00:00:01 Festival 3.1 OK 185 28 SvenSE_1634
1558 00:00:01 Festival 3.1 OK 280 64 SvenSE_1635
1559 00:00:01 Festival 3.1 OK 75 16 SvenSE_1636
1560 00:00:01 Festival 3.1 OK 572 171 SvenSE_1637
1561 00:00:01 Festival 3.1 OK 510 142 SvenSE_1638
1562 00:00:02 Festival 3.1 OK 641 174 SvenSE_1639
1563 00:02:26 Festival 3.1 OK 1105 196 SvenSE_164
1564 00:00:01 Festival 3.1 OK 98 16 SvenSE_1640
1565 00:00:00 Festival 3.1 OK 64 12 SvenSE_1641
1566 00:00:01 Festival 3.1 OK 330 67 SvenSE_1642
1567 00:00:01 Festival 3.1 OK 918 136 SvenSE_1643
1568 00:00:01 Festival 3.1 OK 323 42 SvenSE_1644
1569 00:00:00 Festival 3.1 OK 253 44 SvenSE_1645
1570 00:00:01 Festival 3.1 OK 93 18 SvenSE_1646
1571 00:00:01 Festival 3.1 OK 247 38 SvenSE_1647
1572 00:00:00 Festival 3.1 OK 155 35 SvenSE_1648
1573 00:00:01 Festival 3.1 OK 179 39 SvenSE_1649
1574 00:00:02 Festival 3.1 OK 696 90 SvenSE_165
1575 00:00:01 Festival 3.1 OK 89 20 SvenSE_1650
1576 00:00:01 Festival 3.1 OK 59 16 SvenSE_1651
1577 00:00:00 Festival 3.1 OK 120 32 SvenSE_1652
1578 00:00:01 Festival 3.1 OK 263 64 SvenSE_1653
1579 00:00:01 Festival 3.1 OK 106 14 SvenSE_1654
1580 00:00:01 Festival 3.1 OK 439 105 SvenSE_1655
1581 00:00:01 Festival 3.1 OK 456 52 SvenSE_1656
1582 00:00:01 Festival 3.1 OK 144 18 SvenSE_1657
1583 00:00:00 Festival 3.1 OK 271 57 SvenSE_1658
1584 00:00:01 Festival 3.1 OK 149 19 SvenSE_1659
1585 00:00:29 Festival 3.1 OK 1392 176 SvenSE_166
1586 00:00:01 Festival 3.1 OK 118 22 SvenSE_1660
1587 00:00:00 Festival 3.1 OK 288 63 SvenSE_1661
1588 00:00:03 Festival 3.1 OK 475 73 SvenSE_1662
1589 00:00:01 Festival 3.1 OK 89 22 SvenSE_1663
1590 00:00:00 Festival 3.1 OK 204 46 SvenSE_1664
1591 00:00:01 Festival 3.1 OK 120 33 SvenSE_1665
1592 00:00:01 Festival 3.1 OK 512 106 SvenSE_1666
1593 00:00:01 Festival 3.1 OK 286 51 SvenSE_1667
1594 00:00:01 Festival 3.1 OK 632 129 SvenSE_1668
1595 00:00:24 Festival 3.1 OK 1211 184 SvenSE_1669
1596 00:02:03 Festival 3.1 OK 2622 274 SvenSE_167
1597 00:00:01 Festival 3.1 OK 446 129 SvenSE_1670
1598 00:00:01 Festival 3.1 OK 139 30 SvenSE_1671
1599 00:00:00 Festival 3.1 OK 199 22 SvenSE_1672
1600 00:00:01 Festival 3.1 OK 286 42 SvenSE_1673
1601 00:00:46 Festival 3.1 OK 1950 304 SvenSE_1674
1602 00:00:05 Festival 3.1 OK 606 110 SvenSE_1675
1603 00:00:19 Festival 3.1 OK 1777 284 SvenSE_1676
1604 00:00:02 Festival 3.1 OK 371 108 SvenSE_1677
1605 00:00:13 Festival 3.1 OK 1475 264 SvenSE_1678
1606 00:00:00 Festival 3.1 OK 409 77 SvenSE_1679
1607 00:00:05 Festival 3.1 OK 852 190 SvenSE_168
1608 00:00:01 Festival 3.1 OK 289 92 SvenSE_1680
1609 00:00:01 Festival 3.1 OK 152 26 SvenSE_1681
1610 00:00:01 Festival 3.1 OK 134 29 SvenSE_1682
1611 00:00:08 Festival 3.1 OK 397 68 SvenSE_1683
1612 00:00:37 Festival 3.1 OK 761 116 SvenSE_1684
1613 00:00:02 Festival 3.1 OK 401 44 SvenSE_1685
1614 00:00:02 Festival 3.1 OK 203 33 SvenSE_1686
1615 00:00:01 Festival 3.1 OK 336 44 SvenSE_1687
1616 00:00:00 Festival 3.1 OK 352 43 SvenSE_1688
1617 00:00:01 Festival 3.1 OK 255 36 SvenSE_1689
1618 00:01:56 Festival 3.1 OK 357 65 SvenSE_169
1619 00:03:11 Festival 3.1 OK 1028 102 SvenSE_1690
1620 00:00:01 Festival 3.1 OK 674 96 SvenSE_1691
1621 00:00:01 Festival 3.1 OK 363 56 SvenSE_1692
1622 00:00:00 Festival 3.1 OK 222 38 SvenSE_1693
1623 00:00:01 Festival 3.1 OK 571 71 SvenSE_1694
1624 00:00:01 Festival 3.1 OK 113 30 SvenSE_1695
1625 00:00:01 Festival 3.1 OK 635 86 SvenSE_1696
1626 00:00:01 Festival 3.1 OK 138 20 SvenSE_1697
1627 00:00:01 Festival 3.1 OK 360 110 SvenSE_1698
1628 00:00:05 Festival 3.1 OK 463 107 SvenSE_1699
1629 00:01:17 Festival 3.1 OK 2562 613 SvenSE_17
1630 00:02:38 Festival 3.1 OK 1927 293 SvenSE_170
1631 00:00:01 Festival 3.1 OK 554 148 SvenSE_1700
1632 00:00:01 Festival 3.1 OK 182 41 SvenSE_1701
1633 00:00:01 Festival 3.1 OK 297 60 SvenSE_1702
1634 00:00:01 Festival 3.1 OK 382 62 SvenSE_1703
1635 00:00:01 Festival 3.1 OK 316 63 SvenSE_1704
1636 00:00:36 Festival 3.1 OK 3191 645 SvenSE_1705
1637 00:00:01 Festival 3.1 OK 130 35 SvenSE_1706
1638 00:00:01 Festival 3.1 OK 345 66 SvenSE_1707
1639 00:00:01 Festival 3.1 OK 311 72 SvenSE_1708
1640 00:00:00 Festival 3.1 OK 199 31 SvenSE_1709
1641 00:03:24 Festival 3.1 OK 2457 353 SvenSE_171
1642 00:00:02 Festival 3.1 OK 336 48 SvenSE_1710
1643 00:02:07 Festival 3.1 OK 1643 263 SvenSE_1711
1644 00:00:00 Festival 3.1 OK 185 36 SvenSE_1712
1645 00:00:01 Festival 3.1 OK 82 17 SvenSE_1713
1646 00:00:01 Festival 3.1 OK 208 59 SvenSE_1714
1647 00:00:00 Festival 3.1 OK 423 92 SvenSE_1715
1648 00:00:01 Festival 3.1 OK 251 50 SvenSE_1716
1649 00:00:16 Festival 3.1 OK 499 101 SvenSE_1717
1650 00:00:01 Festival 3.1 OK 240 35 SvenSE_1718
1651 00:00:04 Festival 3.1 OK 2171 177 SvenSE_1719
1652 00:03:35 Festival 3.1 OK 2431 322 SvenSE_172
1653 00:01:07 Festival 3.1 OK 3879 244 SvenSE_1720
1654 00:00:51 Festival 3.1 OK 9142 569 SvenSE_1721
1655 00:02:01 Festival 3.1 OK 7998 678 SvenSE_1722
1656 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1723
1657 00:00:00 Festival 3.1 OK 127 27 SvenSE_1724
1658 00:00:05 Festival 3.1 OK 844 128 SvenSE_1725
1659 00:00:01 Festival 3.1 OK 571 114 SvenSE_1726
1660 00:00:01 Festival 3.1 OK 874 250 SvenSE_1727
1661 00:00:01 Festival 3.1 OK 86 24 SvenSE_1728
1662 00:00:36 Festival 3.1 OK 1003 240 SvenSE_1729
1663 00:03:25 Festival 3.1 OK 1907 263 SvenSE_173
1664 00:00:01 Festival 3.1 OK 192 36 SvenSE_1730
1665 00:00:01 Festival 3.1 OK 561 115 SvenSE_1731
1666 00:00:01 Festival 3.1 OK 116 14 SvenSE_1732
1667 00:00:01 Festival 3.1 OK 148 28 SvenSE_1733
1668 00:00:01 Festival 3.1 OK 92 12 SvenSE_1734
1669 00:00:01 Festival 3.1 OK 321 46 SvenSE_1735
1670 00:00:01 Festival 3.1 OK 206 34 SvenSE_1736
1671 00:00:02 Festival 3.1 OK 213 62 SvenSE_1737
1672 00:00:00 Festival 3.1 OK 360 42 SvenSE_1738
1673 00:00:01 Festival 3.1 OK 431 147 SvenSE_1739
1674 00:00:01 Festival 3.1 OK 121 28 SvenSE_174
1675 00:00:00 Festival 3.1 OK 948 157 SvenSE_1740
1676 00:00:01 Festival 3.1 OK 274 78 SvenSE_1741
1677 00:00:01 Festival 3.1 OK 565 107 SvenSE_1742
1678 00:00:01 Festival 3.1 OK 668 263 SvenSE_1743
1679 00:00:00 Festival 3.1 OK 62 20 SvenSE_1744
1680 00:00:01 Festival 3.1 OK 173 31 SvenSE_1745
1681 00:00:01 Festival 3.1 OK 33 11 SvenSE_1746
1682 00:00:00 Festival 3.1 OK 59 15 SvenSE_1747
1683 00:00:01 Festival 3.1 OK 105 21 SvenSE_1748
1684 00:00:01 Festival 3.1 OK 224 50 SvenSE_1749
1685 00:00:01 Festival 3.1 OK 739 112 SvenSE_175
1686 00:00:01 Festival 3.1 OK 236 22 SvenSE_1750
1687 00:00:00 Festival 3.1 OK 367 46 SvenSE_1751
1688 00:00:01 Festival 3.1 OK 102 24 SvenSE_1752
1689 00:00:00 Festival 3.1 OK 76 27 SvenSE_1753
1690 00:00:02 Festival 3.1 OK 530 62 SvenSE_1754
1691 00:00:01 Festival 3.1 OK 78 10 SvenSE_1755
1692 00:00:00 Festival 3.1 OK 405 80 SvenSE_1756
1693 00:00:04 Festival 3.1 OK 522 92 SvenSE_1757
1694 00:00:01 Festival 3.1 OK 198 40 SvenSE_1758
1695 00:00:08 Festival 3.1 OK 1186 248 SvenSE_1759
1696 00:00:03 Festival 3.1 OK 1015 112 SvenSE_176
1697 00:00:09 Festival 3.1 OK 706 76 SvenSE_1760
1698 00:00:01 Festival 3.1 OK 124 24 SvenSE_1761
1699 00:00:00 Festival 3.1 OK 203 41 SvenSE_1762
1700 00:00:01 Festival 3.1 OK 129 18 SvenSE_1763
1701 00:00:00 Festival 3.1 OK 181 18 SvenSE_1764
1702 00:00:01 Festival 3.1 OK 482 61 SvenSE_1765
1703 00:00:01 Festival 3.1 OK 380 128 SvenSE_1766
1704 00:00:00 Festival 3.1 OK 283 96 SvenSE_1767
1705 00:00:01 Festival 3.1 OK 120 21 SvenSE_1768
1706 00:00:01 Festival 3.1 OK 87 20 SvenSE_1769
1707 00:00:02 Festival 3.1 OK 2859 1164 SvenSE_177
1708 00:00:00 Festival 3.1 OK 140 18 SvenSE_1770
1709 00:00:01 Festival 3.1 OK 104 12 SvenSE_1771
1710 00:00:00 Festival 3.1 OK 29 12 SvenSE_1772
1711 00:00:01 Festival 3.1 OK 384 60 SvenSE_1773
1712 00:00:02 Festival 3.1 OK 475 132 SvenSE_1774
1713 00:00:00 Festival 3.1 OK 182 33 SvenSE_1775
1714 00:00:01 Festival 3.1 OK 68 14 SvenSE_1776
1715 00:00:20 Festival 3.1 OK 512 71 SvenSE_1777
1716 00:00:01 Festival 3.1 OK 106 22 SvenSE_1778
1717 00:00:01 Festival 3.1 OK 155 32 SvenSE_1779
1718 00:00:03 Festival 3.1 OK 3575 1470 SvenSE_178
1719 00:00:00 Festival 3.1 OK 110 26 SvenSE_1780
1720 00:00:01 Festival 3.1 OK 374 54 SvenSE_1781
1721 00:00:01 Festival 3.1 OK 240 39 SvenSE_1782
1722 00:00:01 Festival 3.1 OK 154 36 SvenSE_1783
1723 00:00:01 Festival 3.1 OK 85 22 SvenSE_1784
1724 00:00:01 Festival 3.1 OK 367 88 SvenSE_1785
1725 00:00:00 Festival 3.1 OK 73 23 SvenSE_1786
1726 00:00:01 Festival 3.1 OK 91 18 SvenSE_1787
1727 00:00:00 Festival 3.1 OK 132 21 SvenSE_1788
1728 00:00:03 Festival 3.1 OK 560 106 SvenSE_1789
1729 00:00:00 Festival 3.1 OK 40 4 SvenSE_179
1730 00:00:02 Festival 3.1 OK 779 145 SvenSE_1790
1731 00:00:00 Festival 3.1 OK 263 50 SvenSE_1791
1732 00:00:01 Festival 3.1 OK 135 31 SvenSE_1792
1733 00:00:01 Festival 3.1 OK 504 95 SvenSE_1793
1734 00:00:01 Festival 3.1 OK 116 34 SvenSE_1794
1735 00:00:00 Festival 3.1 OK 100 27 SvenSE_1795
1736 00:00:03 Festival 3.1 OK 166 44 SvenSE_1796
1737 00:00:01 Festival 3.1 OK 149 30 SvenSE_1797
1738 00:00:01 Festival 3.1 OK 82 10 SvenSE_1798
1739 00:00:00 Festival 3.1 OK 135 17 SvenSE_1799
1740 00:00:02 Festival 3.1 OK 1602 554 SvenSE_18
1741 00:00:01 Festival 3.1 OK 67 10 SvenSE_180
1742 00:00:01 Festival 3.1 OK 186 45 SvenSE_1800
1743 00:00:00 Festival 3.1 OK 45 11 SvenSE_1801
1744 00:00:01 Festival 3.1 OK 106 10 SvenSE_1802
1745 00:00:01 Festival 3.1 OK 127 20 SvenSE_1803
1746 00:00:00 Festival 3.1 OK 105 11 SvenSE_1804
1747 00:00:01 Festival 3.1 OK 69 25 SvenSE_1805
1748 00:00:00 Festival 3.1 OK 183 43 SvenSE_1806
1749 00:00:01 Festival 3.1 OK 189 33 SvenSE_1807
1750 00:00:01 Festival 3.1 OK 91 18 SvenSE_1808
1751 00:00:00 Festival 3.1 OK 159 53 SvenSE_1809
1752 00:00:01 Festival 3.1 OK 143 20 SvenSE_181
1753 00:00:01 Festival 3.1 OK 99 28 SvenSE_1810
1754 00:00:00 Festival 3.1 OK 310 101 SvenSE_1811
1755 00:00:01 Festival 3.1 OK 93 27 SvenSE_1812
1756 00:00:01 Festival 3.1 OK 32 9 SvenSE_1813
1757 00:00:00 Festival 3.1 OK 41 14 SvenSE_1814
1758 00:00:01 Festival 3.1 OK 88 30 SvenSE_1815
1759 00:00:01 Festival 3.1 OK 83 18 SvenSE_1816
1760 00:00:00 Festival 3.1 OK 164 17 SvenSE_1817
1761 00:00:01 Festival 3.1 OK 431 78 SvenSE_1818
1762 00:00:01 Festival 3.1 OK 201 37 SvenSE_1819
1763 00:00:00 Festival 3.1 OK 471 82 SvenSE_182
1764 00:00:02 Festival 3.1 OK 261 32 SvenSE_1820
1765 00:00:00 Festival 3.1 OK 135 30 SvenSE_1821
1766 00:00:01 Festival 3.1 OK 45 22 SvenSE_1822
1767 00:00:01 Festival 3.1 OK 242 48 SvenSE_1823
1768 00:00:00 Festival 3.1 OK 128 21 SvenSE_1824
1769 00:00:02 Festival 3.1 OK 435 84 SvenSE_1825
1770 00:00:01 Festival 3.1 OK 254 49 SvenSE_1826
1771 00:00:01 Festival 3.1 OK 517 72 SvenSE_1827
1772 00:00:01 Festival 3.1 OK 57 12 SvenSE_1828
1773 00:00:00 Festival 3.1 OK 203 44 SvenSE_1829
1774 00:00:03 Festival 3.1 OK 989 170 SvenSE_183
1775 00:00:02 Festival 3.1 OK 886 212 SvenSE_1830
1776 00:00:00 Festival 3.1 OK 433 119 SvenSE_1831
1777 00:00:01 Festival 3.1 OK 262 58 SvenSE_1832
1778 00:00:01 Festival 3.1 OK 213 35 SvenSE_1833
1779 00:00:01 Festival 3.1 OK 305 86 SvenSE_1834
1780 00:00:06 Festival 3.1 OK 538 118 SvenSE_1835
1781 00:00:01 Festival 3.1 OK 369 132 SvenSE_1836
1782 00:00:00 Festival 3.1 OK 54 16 SvenSE_1837
1783 00:00:01 Festival 3.1 OK 302 42 SvenSE_1838
1784 00:00:00 Festival 3.1 OK 160 34 SvenSE_1839
1785 00:00:06 Festival 3.1 OK 268 53 SvenSE_184
1786 00:00:01 Festival 3.1 OK 182 22 SvenSE_1840
1787 00:00:01 Festival 3.1 OK 318 44 SvenSE_1841
1788 00:00:01 Festival 3.1 OK 413 57 SvenSE_1842
1789 00:00:26 Festival 3.1 OK 815 162 SvenSE_1843
1790 00:00:00 Festival 3.1 OK 148 38 SvenSE_1844
1791 00:00:02 Festival 3.1 OK 556 110 SvenSE_1845
1792 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1846
1793 00:00:00 Festival 3.1 OK 213 46 SvenSE_1847
1794 00:00:01 Festival 3.1 OK 439 79 SvenSE_1848
1795 00:00:01 Festival 3.1 OK 362 81 SvenSE_1849
1796 00:00:00 Festival 3.1 OK 174 57 SvenSE_185
1797 00:00:02 Festival 3.1 OK 336 83 SvenSE_1850
1798 00:00:00 Festival 3.1 OK 435 98 SvenSE_1851
1799 00:00:02 Festival 3.1 OK 557 110 SvenSE_1852
1800 00:00:02 Festival 3.1 OK 585 116 SvenSE_1853
1801 00:00:00 Festival 3.1 OK 70 14 SvenSE_1854
1802 00:00:01 Festival 3.1 OK 385 72 SvenSE_1855
1803 00:00:00 Festival 3.1 OK 174 50 SvenSE_1856
1804 00:00:02 Festival 3.1 OK 789 65 SvenSE_1857
1805 00:00:06 Festival 3.1 OK 568 70 SvenSE_1858
1806 00:00:06 Festival 3.1 OK 360 64 SvenSE_1859
1807 00:00:01 Festival 3.1 OK 152 49 SvenSE_186
1808 00:00:01 Festival 3.1 OK 246 50 SvenSE_1860
1809 00:00:00 Festival 3.1 OK 173 52 SvenSE_1861
1810 00:00:01 Festival 3.1 OK 174 38 SvenSE_1862
1811 00:00:00 Festival 3.1 OK 153 20 SvenSE_1863
1812 00:00:01 Festival 3.1 OK 302 78 SvenSE_1864
1813 00:00:00 Festival 3.1 OK 372 67 SvenSE_1865
1814 00:00:08 Festival 3.1 OK 511 108 SvenSE_1866
1815 00:00:01 Festival 3.1 OK 130 26 SvenSE_1867
1816 00:03:22 Festival 3.1 OK 830 101 SvenSE_1868
1817 00:00:01 Festival 3.1 OK 260 26 SvenSE_1869
1818 00:00:10 Festival 3.1 OK 1446 268 SvenSE_187
1819 00:00:00 Festival 3.1 OK 120 14 SvenSE_1870
1820 00:00:01 Festival 3.1 OK 55 9 SvenSE_1871
1821 00:00:01 Festival 3.1 OK 249 30 SvenSE_1872
1822 00:00:01 Festival 3.1 OK 415 54 SvenSE_1873
1823 00:00:01 Festival 3.1 OK 277 27 SvenSE_1874
1824 00:00:00 Festival 3.1 OK 225 56 SvenSE_1875
1825 00:00:01 Festival 3.1 OK 340 48 SvenSE_1876
1826 00:00:01 Festival 3.1 OK 213 57 SvenSE_1877
1827 00:00:01 Festival 3.1 OK 185 41 SvenSE_1878
1828 00:00:02 Festival 3.1 OK 295 50 SvenSE_1879
1829 00:01:45 Festival 3.1 OK 933 140 SvenSE_188
1830 00:00:09 Festival 3.1 OK 821 106 SvenSE_1880
1831 00:00:01 Festival 3.1 OK 633 111 SvenSE_1881
1832 00:00:00 Festival 3.1 OK 219 50 SvenSE_1882
1833 00:00:01 Festival 3.1 OK 927 208 SvenSE_1883
1834 00:00:01 Festival 3.1 OK 558 80 SvenSE_1884
1835 00:00:01 Festival 3.1 OK 308 26 SvenSE_1885
1836 00:00:02 Festival 3.1 OK 1092 240 SvenSE_1886
1837 00:00:01 Festival 3.1 OK 670 142 SvenSE_1887
1838 00:00:01 Festival 3.1 OK 197 40 SvenSE_1888
1839 00:00:00 Festival 3.1 OK 101 20 SvenSE_1889
1840 00:01:09 Festival 3.1 OK 756 128 SvenSE_189
1841 00:00:01 Festival 3.1 OK 598 153 SvenSE_1890
1842 00:00:01 Festival 3.1 OK 396 189 SvenSE_1891
1843 00:00:01 Festival 3.1 OK 1073 211 SvenSE_1892
1844 00:00:01 Festival 3.1 OK 52 15 SvenSE_1893
1845 00:00:00 Festival 3.1 OK 64 14 SvenSE_1894
1846 00:00:01 Festival 3.1 OK 100 24 SvenSE_1895
1847 00:00:00 Festival 3.1 OK 71 23 SvenSE_1896
1848 00:00:01 Festival 3.1 OK 36 12 SvenSE_1897
1849 00:00:01 Festival 3.1 OK 64 17 SvenSE_1898
1850 00:03:10 Festival 3.1 OK 1704 198 SvenSE_1899
1851 00:00:02 Festival 3.1 OK 2094 650 SvenSE_19
1852 00:00:00 Festival 3.1 OK 24 8 SvenSE_190
1853 00:00:02 Festival 3.1 OK 260 48 SvenSE_1900
1854 00:00:02 Festival 3.1 OK 553 98 SvenSE_1901
1855 00:00:01 Festival 3.1 OK 157 33 SvenSE_1902
1856 00:00:05 Festival 3.1 OK 606 78 SvenSE_1903
1857 00:00:02 Festival 3.1 OK 426 116 SvenSE_1904
1858 00:00:01 Festival 3.1 OK 445 68 SvenSE_1905
1859 00:01:34 Festival 3.1 OK 731 114 SvenSE_1906
1860 00:10:01 Festival 3.1 Time limit exceeded SvenSE_1907
1861 00:00:00 Festival 3.1 OK 149 33 SvenSE_1908
1862 00:00:01 Festival 3.1 OK 283 47 SvenSE_1909
1863 00:00:01 Festival 3.1 OK 238 36 SvenSE_191
1864 00:00:01 Festival 3.1 OK 295 46 SvenSE_1910
1865 00:00:05 Festival 3.1 OK 386 70 SvenSE_1911
1866 00:00:01 Festival 3.1 OK 476 86 SvenSE_192
1867 00:00:01 Festival 3.1 OK 196 43 SvenSE_193
1868 00:00:01 Festival 3.1 OK 248 42 SvenSE_194
1869 00:00:00 Festival 3.1 OK 228 80 SvenSE_195
1870 00:00:44 Festival 3.1 OK 5694 723 SvenSE_196
1871 00:01:03 Festival 3.1 OK 7182 952 SvenSE_197
1872 00:10:01 Festival 3.1 Time limit exceeded SvenSE_198
1873 00:01:56 Festival 3.1 OK 1388 158 SvenSE_199
1874 00:00:02 Festival 3.1 OK 2035 872 SvenSE_2
1875 00:00:01 Festival 3.1 OK 2184 154 SvenSE_20
1876 00:00:11 Festival 3.1 OK 442 69 SvenSE_200
1877 00:00:49 Festival 3.1 OK 678 199 SvenSE_201
1878 00:00:14 Festival 3.1 OK 1443 341 SvenSE_202
1879 00:00:02 Festival 3.1 OK 380 48 SvenSE_203
1880 00:00:05 Festival 3.1 OK 632 94 SvenSE_204
1881 00:03:44 Festival 3.1 OK 9697 1267 SvenSE_205
1882 00:03:38 Festival 3.1 OK 5038 613 SvenSE_206
1883 00:01:36 Festival 3.1 OK 7938 1043 SvenSE_207
1884 00:03:22 Festival 3.1 OK 9947 1311 SvenSE_208
1885 00:00:39 Festival 3.1 OK 2048 257 SvenSE_209
1886 00:00:03 Festival 3.1 OK 2085 541 SvenSE_21
1887 00:00:00 Festival 3.1 OK 127 41 SvenSE_210
1888 00:00:20 Festival 3.1 OK 774 88 SvenSE_211
1889 00:00:02 Festival 3.1 OK 220 26 SvenSE_212
1890 00:00:13 Festival 3.1 OK 244 36 SvenSE_213
1891 00:00:24 Festival 3.1 OK 466 84 SvenSE_214
1892 00:00:32 Festival 3.1 OK 710 96 SvenSE_215
1893 00:04:46 Festival 3.1 OK 1924 216 SvenSE_216
1894 00:04:44 Festival 3.1 OK 1246 124 SvenSE_217
1895 00:08:02 Festival 3.1 OK 3292 396 SvenSE_218
1896 00:03:25 Festival 3.1 OK 730 126 SvenSE_219
1897 00:00:01 Festival 3.1 OK 874 186 SvenSE_22
1898 00:01:47 Festival 3.1 OK 948 142 SvenSE_220
1899 00:02:50 Festival 3.1 OK 2040 236 SvenSE_221
1900 00:03:51 Festival 3.1 OK 4844 414 SvenSE_222
1901 00:02:57 Festival 3.1 OK 3280 284 SvenSE_223
1902 00:05:35 Festival 3.1 OK 2916 260 SvenSE_224
1903 00:06:24 Festival 3.1 OK 3876 412 SvenSE_225
1904 00:02:57 Festival 3.1 OK 7398 781 SvenSE_226
1905 00:04:39 Festival 3.1 OK 5759 662 SvenSE_227
1906 00:10:01 Festival 3.1 Time limit exceeded SvenSE_228
1907 00:00:02 Festival 3.1 OK 566 138 SvenSE_229
1908 00:00:44 Festival 3.1 OK 4883 1695 SvenSE_23
1909 00:00:00 Festival 3.1 OK 726 214 SvenSE_230
1910 00:10:01 Festival 3.1 Time limit exceeded SvenSE_231
1911 00:02:12 Festival 3.1 OK 2382 222 SvenSE_232
1912 00:05:31 Festival 3.1 OK 1626 178 SvenSE_233
1913 00:00:02 Festival 3.1 OK 1661 625 SvenSE_234
1914 00:00:03 Festival 3.1 OK 1375 445 SvenSE_235
1915 00:00:00 Festival 3.1 OK 468 85 SvenSE_236
1916 00:00:01 Festival 3.1 OK 598 82 SvenSE_237
1917 00:00:01 Festival 3.1 OK 746 125 SvenSE_238
1918 00:03:27 Festival 3.1 OK 1147 297 SvenSE_239
1919 00:00:34 Festival 3.1 OK 3622 651 SvenSE_24
1920 00:00:06 Festival 3.1 OK 1341 401 SvenSE_240
1921 00:00:02 Festival 3.1 OK 499 142 SvenSE_241
1922 00:00:01 Festival 3.1 OK 623 150 SvenSE_242
1923 00:00:08 Festival 3.1 OK 1041 123 SvenSE_243
1924 00:00:12 Festival 3.1 OK 1142 134 SvenSE_244
1925 00:00:01 Festival 3.1 OK 241 58 SvenSE_245
1926 00:00:01 Festival 3.1 OK 88 16 SvenSE_246
1927 00:00:02 Festival 3.1 OK 282 22 SvenSE_247
1928 00:00:00 Festival 3.1 OK 67 16 SvenSE_248
1929 00:00:47 Festival 3.1 OK 835 106 SvenSE_249
1930 00:00:01 Festival 3.1 OK 415 87 SvenSE_25
1931 00:00:03 Festival 3.1 OK 729 82 SvenSE_250
1932 00:00:00 Festival 3.1 OK 54 14 SvenSE_251
1933 00:00:01 Festival 3.1 OK 73 16 SvenSE_252
1934 00:00:00 Festival 3.1 OK 57 14 SvenSE_253
1935 00:00:01 Festival 3.1 OK 45 12 SvenSE_254
1936 00:00:00 Festival 3.1 OK 43 12 SvenSE_255
1937 00:00:01 Festival 3.1 OK 132 28 SvenSE_256
1938 00:00:01 Festival 3.1 OK 440 74 SvenSE_257
1939 00:00:00 Festival 3.1 OK 214 22 SvenSE_258
1940 00:00:02 Festival 3.1 OK 455 162 SvenSE_259
1941 00:00:01 Festival 3.1 OK 256 56 SvenSE_26
1942 00:00:01 Festival 3.1 OK 261 50 SvenSE_260
1943 00:00:01 Festival 3.1 OK 511 121 SvenSE_261
1944 00:00:01 Festival 3.1 OK 33 10 SvenSE_262
1945 00:00:00 Festival 3.1 OK 39 12 SvenSE_263
1946 00:00:01 Festival 3.1 OK 35 12 SvenSE_264
1947 00:00:01 Festival 3.1 OK 59 14 SvenSE_265
1948 00:00:00 Festival 3.1 OK 47 14 SvenSE_266
1949 00:00:01 Festival 3.1 OK 709 185 SvenSE_267
1950 00:03:24 Festival 3.1 OK 645 96 SvenSE_268
1951 00:00:01 Festival 3.1 OK 89 23 SvenSE_269
1952 00:00:00 Festival 3.1 OK 310 40 SvenSE_27
1953 00:04:33 Festival 3.1 OK 1227 198 SvenSE_270
1954 00:08:45 Festival 3.1 OK 2828 753 SvenSE_271
1955 00:00:01 Festival 3.1 OK 1523 474 SvenSE_272
1956 00:00:03 Festival 3.1 OK 2491 430 SvenSE_273
1957 00:01:08 Festival 3.1 OK 2294 513 SvenSE_274
1958 00:00:00 Festival 3.1 OK 217 28 SvenSE_275
1959 00:00:01 Festival 3.1 OK 95 14 SvenSE_276
1960 00:00:01 Festival 3.1 OK 239 38 SvenSE_277
1961 00:00:34 Festival 3.1 OK 3771 1372 SvenSE_278
1962 00:07:01 Festival 3.1 OK 8153 1555 SvenSE_279
1963 00:00:01 Festival 3.1 OK 276 46 SvenSE_28
1964 00:02:11 Festival 3.1 OK 1791 306 SvenSE_280
1965 00:00:01 Festival 3.1 OK 536 124 SvenSE_281
1966 00:00:02 Festival 3.1 OK 412 70 SvenSE_282
1967 00:01:34 Festival 3.1 OK 1175 286 SvenSE_283
1968 00:00:01 Festival 3.1 OK 402 75 SvenSE_284
1969 00:00:10 Festival 3.1 OK 518 99 SvenSE_285
1970 00:00:03 Festival 3.1 OK 405 69 SvenSE_286
1971 00:00:10 Festival 3.1 OK 403 60 SvenSE_287
1972 00:00:01 Festival 3.1 OK 452 82 SvenSE_288
1973 00:00:01 Festival 3.1 OK 1116 230 SvenSE_289
1974 00:00:00 Festival 3.1 OK 360 69 SvenSE_29
1975 00:00:01 Festival 3.1 OK 393 123 SvenSE_290
1976 00:10:01 Festival 3.1 Time limit exceeded SvenSE_291
1977 00:00:40 Festival 3.1 OK 2257 580 SvenSE_292
1978 00:08:55 Festival 3.1 OK 986 174 SvenSE_293
1979 00:00:01 Festival 3.1 OK 79 29 SvenSE_294
1980 00:03:28 Festival 3.1 OK 3586 807 SvenSE_295
1981 00:00:01 Festival 3.1 OK 257 68 SvenSE_296
1982 00:00:05 Festival 3.1 OK 409 118 SvenSE_297
1983 00:00:00 Festival 3.1 OK 50 8 SvenSE_298
1984 00:00:02 Festival 3.1 OK 588 96 SvenSE_299
1985 00:00:01 Festival 3.1 OK 669 129 SvenSE_3
1986 00:00:25 Festival 3.1 OK 3399 655 SvenSE_30
1987 00:00:19 Festival 3.1 OK 605 184 SvenSE_300
1988 00:07:34 Festival 3.1 OK 4770 943 SvenSE_301
1989 00:00:01 Festival 3.1 OK 114 15 SvenSE_302
1990 00:00:00 Festival 3.1 OK 106 14 SvenSE_303
1991 00:00:02 Festival 3.1 OK 331 44 SvenSE_304
1992 00:00:01 Festival 3.1 OK 311 40 SvenSE_305
1993 00:00:01 Festival 3.1 OK 131 23 SvenSE_306
1994 00:00:01 Festival 3.1 OK 180 27 SvenSE_307
1995 00:00:01 Festival 3.1 OK 220 38 SvenSE_308
1996 00:00:01 Festival 3.1 OK 296 55 SvenSE_309
1997 00:00:02 Festival 3.1 OK 2536 703 SvenSE_31
1998 00:00:00 Festival 3.1 OK 237 51 SvenSE_310
1999 00:00:01 Festival 3.1 OK 240 50 SvenSE_311
2000 00:00:03 Festival 3.1 OK 476 58 SvenSE_312
2001 00:00:06 Festival 3.1 OK 575 86 SvenSE_313
2002 00:00:01 Festival 3.1 OK 94 26 SvenSE_314
2003 00:00:00 Festival 3.1 OK 60 17 SvenSE_315
2004 00:00:00 Festival 3.1 OK 138 37 SvenSE_316
2005 00:00:01 Festival 3.1 OK 119 26 SvenSE_317
2006 00:00:00 Festival 3.1 OK 189 50 SvenSE_318
2007 00:00:01 Festival 3.1 OK 296 83 SvenSE_319
2008 00:00:00 Festival 3.1 OK 350 36 SvenSE_32
2009 00:00:01 Festival 3.1 OK 399 105 SvenSE_320
2010 00:00:01 Festival 3.1 OK 168 22 SvenSE_321
2011 00:00:00 Festival 3.1 OK 140 17 SvenSE_322
2012 00:00:01 Festival 3.1 OK 110 17 SvenSE_323
2013 00:00:00 Festival 3.1 OK 412 66 SvenSE_324
2014 00:00:02 Festival 3.1 OK 406 76 SvenSE_325
2015 00:00:10 Festival 3.1 OK 1270 226 SvenSE_326
2016 00:01:35 Festival 3.1 OK 842 92 SvenSE_327
2017 00:00:01 Festival 3.1 OK 404 70 SvenSE_328
2018 00:00:01 Festival 3.1 OK 272 80 SvenSE_329
2019 00:00:00 Festival 3.1 OK 730 95 SvenSE_33
2020 00:00:01 Festival 3.1 OK 132 18 SvenSE_330
2021 00:00:02 Festival 3.1 OK 303 55 SvenSE_331
2022 00:00:02 Festival 3.1 OK 345 48 SvenSE_332
2023 00:00:01 Festival 3.1 OK 341 54 SvenSE_333
2024 00:00:12 Festival 3.1 OK 174 32 SvenSE_334
2025 00:00:01 Festival 3.1 OK 43 15 SvenSE_335
2026 00:00:00 Festival 3.1 OK 58 19 SvenSE_336
2027 00:00:01 Festival 3.1 OK 250 49 SvenSE_337
2028 00:00:01 Festival 3.1 OK 121 15 SvenSE_338
2029 00:00:01 Festival 3.1 OK 340 28 SvenSE_339
2030 00:03:28 Festival 3.1 OK 2186 494 SvenSE_34
2031 00:01:19 Festival 3.1 OK 715 70 SvenSE_340
2032 00:04:54 Festival 3.1 OK 1151 167 SvenSE_341
2033 00:00:01 Festival 3.1 OK 514 84 SvenSE_342
2034 00:02:05 Festival 3.1 OK 1526 262 SvenSE_343
2035 00:00:00 Festival 3.1 OK 113 18 SvenSE_344
2036 00:00:04 Festival 3.1 OK 385 40 SvenSE_345
2037 00:00:01 Festival 3.1 OK 41 10 SvenSE_346
2038 00:00:01 Festival 3.1 OK 405 64 SvenSE_347
2039 00:00:01 Festival 3.1 OK 142 30 SvenSE_348
2040 00:00:00 Festival 3.1 OK 146 28 SvenSE_349
2041 00:00:01 Festival 3.1 OK 190 23 SvenSE_35
2042 00:00:01 Festival 3.1 OK 80 14 SvenSE_350
2043 00:00:00 Festival 3.1 OK 56 16 SvenSE_351
2044 00:00:01 Festival 3.1 OK 181 42 SvenSE_352
2045 00:00:00 Festival 3.1 OK 232 45 SvenSE_353
2046 00:00:01 Festival 3.1 OK 167 32 SvenSE_354
2047 00:00:00 Festival 3.1 OK 97 18 SvenSE_355
2048 00:00:00 Festival 3.1 OK 128 27 SvenSE_356
2049 00:00:01 Festival 3.1 OK 277 42 SvenSE_357
2050 00:00:01 Festival 3.1 OK 168 50 SvenSE_358
2051 00:00:00 Festival 3.1 OK 194 39 SvenSE_359
2052 00:00:01 Festival 3.1 OK 318 54 SvenSE_36
2053 00:00:01 Festival 3.1 OK 75 20 SvenSE_360
2054 00:00:00 Festival 3.1 OK 81 20 SvenSE_361
2055 00:00:01 Festival 3.1 OK 70 21 SvenSE_362
2056 00:00:01 Festival 3.1 OK 263 41 SvenSE_363
2057 00:00:01 Festival 3.1 OK 73 17 SvenSE_364
2058 00:00:00 Festival 3.1 OK 191 46 SvenSE_365
2059 00:00:01 Festival 3.1 OK 97 48 SvenSE_366
2060 00:00:00 Festival 3.1 OK 104 50 SvenSE_367
2061 00:00:01 Festival 3.1 OK 275 78 SvenSE_368
2062 00:00:01 Festival 3.1 OK 177 36 SvenSE_369
2063 00:00:00 Festival 3.1 OK 1054 214 SvenSE_37
2064 00:00:01 Festival 3.1 OK 149 32 SvenSE_370
2065 00:00:01 Festival 3.1 OK 135 29 SvenSE_371
2066 00:00:00 Festival 3.1 OK 141 35 SvenSE_372
2067 00:00:01 Festival 3.1 OK 185 38 SvenSE_373
2068 00:00:00 Festival 3.1 OK 273 57 SvenSE_374
2069 00:00:01 Festival 3.1 OK 265 55 SvenSE_375
2070 00:00:01 Festival 3.1 OK 145 38 SvenSE_376
2071 00:00:00 Festival 3.1 OK 214 58 SvenSE_377
2072 00:00:01 Festival 3.1 OK 219 39 SvenSE_378
2073 00:00:00 Festival 3.1 OK 113 35 SvenSE_379
2074 00:00:01 Festival 3.1 OK 426 62 SvenSE_38
2075 00:00:00 Festival 3.1 OK 233 53 SvenSE_380
2076 00:00:01 Festival 3.1 OK 82 26 SvenSE_381
2077 00:00:01 Festival 3.1 OK 170 42 SvenSE_382
2078 00:00:00 Festival 3.1 OK 185 46 SvenSE_383
2079 00:00:01 Festival 3.1 OK 127 36 SvenSE_384
2080 00:00:00 Festival 3.1 OK 115 22 SvenSE_385
2081 00:00:02 Festival 3.1 OK 222 26 SvenSE_386
2082 00:00:01 Festival 3.1 OK 182 29 SvenSE_387
2083 00:00:00 Festival 3.1 OK 268 48 SvenSE_388
2084 00:00:01 Festival 3.1 OK 256 39 SvenSE_389
2085 00:00:01 Festival 3.1 OK 1110 157 SvenSE_39
2086 00:00:01 Festival 3.1 OK 288 38 SvenSE_390
2087 00:00:01 Festival 3.1 OK 356 42 SvenSE_391
2088 00:00:01 Festival 3.1 OK 224 25 SvenSE_392
2089 00:00:01 Festival 3.1 OK 342 37 SvenSE_393
2090 00:00:00 Festival 3.1 OK 134 20 SvenSE_394
2091 00:00:01 Festival 3.1 OK 201 39 SvenSE_395
2092 00:00:00 Festival 3.1 OK 241 37 SvenSE_396
2093 00:00:01 Festival 3.1 OK 123 28 SvenSE_397
2094 00:00:01 Festival 3.1 OK 218 51 SvenSE_398
2095 00:00:03 Festival 3.1 OK 190 40 SvenSE_399
2096 00:00:03 Festival 3.1 OK 951 148 SvenSE_4
2097 00:00:00 Festival 3.1 OK 882 54 SvenSE_40
2098 00:00:03 Festival 3.1 OK 211 38 SvenSE_400
2099 00:00:01 Festival 3.1 OK 139 34 SvenSE_401
2100 00:00:00 Festival 3.1 OK 138 29 SvenSE_402
2101 00:00:01 Festival 3.1 OK 220 43 SvenSE_403
2102 00:00:01 Festival 3.1 OK 150 35 SvenSE_404
2103 00:00:00 Festival 3.1 OK 89 20 SvenSE_405
2104 00:00:01 Festival 3.1 OK 63 17 SvenSE_406
2105 00:00:00 Festival 3.1 OK 27 10 SvenSE_407
2106 00:00:01 Festival 3.1 OK 56 15 SvenSE_408
2107 00:00:01 Festival 3.1 OK 49 15 SvenSE_409
2108 00:00:00 Festival 3.1 OK 120 15 SvenSE_41
2109 00:00:01 Festival 3.1 OK 57 17 SvenSE_410
2110 00:00:00 Festival 3.1 OK 44 15 SvenSE_411
2111 00:00:01 Festival 3.1 OK 45 15 SvenSE_412
2112 00:00:01 Festival 3.1 OK 71 20 SvenSE_413
2113 00:00:00 Festival 3.1 OK 76 23 SvenSE_414
2114 00:00:01 Festival 3.1 OK 72 23 SvenSE_415
2115 00:00:00 Festival 3.1 OK 78 21 SvenSE_416
2116 00:00:01 Festival 3.1 OK 88 23 SvenSE_417
2117 00:00:01 Festival 3.1 OK 62 19 SvenSE_418
2118 00:00:00 Festival 3.1 OK 46 15 SvenSE_419
2119 00:03:07 Festival 3.1 OK 4080 399 SvenSE_42
2120 00:00:00 Festival 3.1 OK 50 16 SvenSE_420
2121 00:00:01 Festival 3.1 OK 50 16 SvenSE_421
2122 00:00:00 Festival 3.1 OK 43 13 SvenSE_422
2123 00:00:01 Festival 3.1 OK 79 20 SvenSE_423
2124 00:00:01 Festival 3.1 OK 60 17 SvenSE_424
2125 00:00:00 Festival 3.1 OK 58 17 SvenSE_425
2126 00:00:01 Festival 3.1 OK 45 14 SvenSE_426
2127 00:00:01 Festival 3.1 OK 45 14 SvenSE_427
2128 00:00:00 Festival 3.1 OK 38 9 SvenSE_428
2129 00:00:01 Festival 3.1 OK 58 9 SvenSE_429
2130 00:00:01 Festival 3.1 OK 893 254 SvenSE_43
2131 00:00:01 Festival 3.1 OK 45 10 SvenSE_430
2132 00:00:01 Festival 3.1 OK 220 40 SvenSE_431
2133 00:00:00 Festival 3.1 OK 376 84 SvenSE_432
2134 00:00:01 Festival 3.1 OK 340 66 SvenSE_433
2135 00:00:01 Festival 3.1 OK 308 66 SvenSE_434
2136 00:00:01 Festival 3.1 OK 344 68 SvenSE_435
2137 00:00:00 Festival 3.1 OK 107 20 SvenSE_436
2138 00:00:01 Festival 3.1 OK 122 24 SvenSE_437
2139 00:00:00 Festival 3.1 OK 176 30 SvenSE_438
2140 00:00:01 Festival 3.1 OK 208 32 SvenSE_439
2141 00:00:01 Festival 3.1 OK 55 10 SvenSE_44
2142 00:00:00 Festival 3.1 OK 184 28 SvenSE_440
2143 00:00:01 Festival 3.1 OK 334 68 SvenSE_441
2144 00:00:01 Festival 3.1 OK 328 68 SvenSE_442
2145 00:00:01 Festival 3.1 OK 290 68 SvenSE_443
2146 00:00:01 Festival 3.1 OK 372 84 SvenSE_444
2147 00:00:00 Festival 3.1 OK 231 51 SvenSE_445
2148 00:00:01 Festival 3.1 OK 309 65 SvenSE_446
2149 00:00:01 Festival 3.1 OK 163 28 SvenSE_447
2150 00:00:00 Festival 3.1 OK 93 28 SvenSE_448
2151 00:00:01 Festival 3.1 OK 91 36 SvenSE_449
2152 00:00:00 Festival 3.1 OK 1571 442 SvenSE_45
2153 00:00:01 Festival 3.1 OK 189 67 SvenSE_450
2154 00:00:01 Festival 3.1 OK 85 27 SvenSE_451
2155 00:00:01 Festival 3.1 OK 96 27 SvenSE_452
2156 00:00:01 Festival 3.1 OK 75 27 SvenSE_453
2157 00:00:01 Festival 3.1 OK 30 10 SvenSE_454
2158 00:00:00 Festival 3.1 OK 51 9 SvenSE_455
2159 00:00:01 Festival 3.1 OK 212 71 SvenSE_456
2160 00:00:00 Festival 3.1 OK 65 25 SvenSE_457
2161 00:00:01 Festival 3.1 OK 182 27 SvenSE_458
2162 00:00:01 Festival 3.1 OK 216 33 SvenSE_459
2163 00:00:02 Festival 3.1 OK 1152 226 SvenSE_46
2164 00:00:00 Festival 3.1 OK 83 22 SvenSE_460
2165 00:00:01 Festival 3.1 OK 61 17 SvenSE_461
2166 00:00:01 Festival 3.1 OK 94 23 SvenSE_462
2167 00:00:00 Festival 3.1 OK 102 23 SvenSE_463
2168 00:00:01 Festival 3.1 OK 155 29 SvenSE_464
2169 00:00:01 Festival 3.1 OK 176 37 SvenSE_465
2170 00:00:00 Festival 3.1 OK 195 31 SvenSE_466
2171 00:00:01 Festival 3.1 OK 192 31 SvenSE_467
2172 00:00:01 Festival 3.1 OK 197 32 SvenSE_468
2173 00:00:01 Festival 3.1 OK 214 32 SvenSE_469
2174 00:00:00 Festival 3.1 OK 3311 504 SvenSE_47
2175 00:00:01 Festival 3.1 OK 85 20 SvenSE_470
2176 00:00:02 Festival 3.1 OK 415 76 SvenSE_471
2177 00:00:01 Festival 3.1 OK 491 90 SvenSE_472
2178 00:00:01 Festival 3.1 OK 98 35 SvenSE_473
2179 00:00:00 Festival 3.1 OK 102 37 SvenSE_474
2180 00:00:01 Festival 3.1 OK 156 33 SvenSE_475
2181 00:00:01 Festival 3.1 OK 62 18 SvenSE_476
2182 00:00:01 Festival 3.1 OK 81 22 SvenSE_477
2183 00:00:01 Festival 3.1 OK 76 21 SvenSE_478
2184 00:00:01 Festival 3.1 OK 70 21 SvenSE_479
2185 00:00:02 Festival 3.1 OK 458 118 SvenSE_48
2186 00:00:01 Festival 3.1 OK 83 23 SvenSE_480
2187 00:00:00 Festival 3.1 OK 250 28 SvenSE_481
2188 00:00:01 Festival 3.1 OK 195 26 SvenSE_482
2189 00:00:01 Festival 3.1 OK 220 26 SvenSE_483
2190 00:00:01 Festival 3.1 OK 183 26 SvenSE_484
2191 00:00:01 Festival 3.1 OK 147 36 SvenSE_485
2192 00:00:00 Festival 3.1 OK 125 32 SvenSE_486
2193 00:00:01 Festival 3.1 OK 154 40 SvenSE_487
2194 00:00:00 Festival 3.1 OK 121 26 SvenSE_488
2195 00:00:01 Festival 3.1 OK 110 22 SvenSE_489
2196 00:00:02 Festival 3.1 OK 981 329 SvenSE_49
2197 00:00:01 Festival 3.1 OK 159 32 SvenSE_490
2198 00:00:01 Festival 3.1 OK 107 35 SvenSE_491
2199 00:00:00 Festival 3.1 OK 133 37 SvenSE_492
2200 00:00:01 Festival 3.1 OK 146 37 SvenSE_493
2201 00:00:01 Festival 3.1 OK 229 49 SvenSE_494
2202 00:00:00 Festival 3.1 OK 200 42 SvenSE_495
2203 00:00:01 Festival 3.1 OK 211 42 SvenSE_496
2204 00:00:01 Festival 3.1 OK 199 42 SvenSE_497
2205 00:00:01 Festival 3.1 OK 257 58 SvenSE_498
2206 00:00:00 Festival 3.1 OK 111 31 SvenSE_499
2207 00:00:08 Festival 3.1 OK 754 123 SvenSE_5
2208 00:00:01 Festival 3.1 OK 330 55 SvenSE_50
2209 00:00:01 Festival 3.1 OK 83 28 SvenSE_500
2210 00:00:00 Festival 3.1 OK 71 25 SvenSE_501
2211 00:00:01 Festival 3.1 OK 101 36 SvenSE_502
2212 00:00:01 Festival 3.1 OK 83 28 SvenSE_503
2213 00:00:00 Festival 3.1 OK 81 27 SvenSE_504
2214 00:00:01 Festival 3.1 OK 166 51 SvenSE_505
2215 00:00:01 Festival 3.1 OK 158 47 SvenSE_506
2216 00:00:00 Festival 3.1 OK 362 102 SvenSE_507
2217 00:00:01 Festival 3.1 OK 142 47 SvenSE_508
2218 00:00:01 Festival 3.1 OK 166 51 SvenSE_509
2219 00:00:00 Festival 3.1 OK 69 7 SvenSE_51
2220 00:00:01 Festival 3.1 OK 96 26 SvenSE_510
2221 00:00:01 Festival 3.1 OK 123 34 SvenSE_511
2222 00:00:01 Festival 3.1 OK 270 64 SvenSE_512
2223 00:00:01 Festival 3.1 OK 154 44 SvenSE_513
2224 00:00:01 Festival 3.1 OK 293 70 SvenSE_514
2225 00:00:01 Festival 3.1 OK 355 73 SvenSE_515
2226 00:00:02 Festival 3.1 OK 341 73 SvenSE_516
2227 00:00:00 Festival 3.1 OK 167 34 SvenSE_517
2228 00:00:01 Festival 3.1 OK 103 27 SvenSE_518
2229 00:00:01 Festival 3.1 OK 204 56 SvenSE_519
2230 00:00:01 Festival 3.1 OK 384 108 SvenSE_52
2231 00:00:01 Festival 3.1 OK 175 64 SvenSE_520
2232 00:00:00 Festival 3.1 OK 223 64 SvenSE_521
2233 00:00:01 Festival 3.1 OK 339 106 SvenSE_522
2234 00:00:01 Festival 3.1 OK 284 76 SvenSE_523
2235 00:00:01 Festival 3.1 OK 293 50 SvenSE_524
2236 00:00:01 Festival 3.1 OK 123 32 SvenSE_525
2237 00:00:01 Festival 3.1 OK 179 48 SvenSE_526
2238 00:00:02 Festival 3.1 OK 215 49 SvenSE_527
2239 00:00:02 Festival 3.1 OK 189 43 SvenSE_528
2240 00:00:00 Festival 3.1 OK 227 61 SvenSE_529
2241 00:00:00 Festival 3.1 OK 152 54 SvenSE_53
2242 00:00:01 Festival 3.1 OK 153 45 SvenSE_530
2243 00:00:02 Festival 3.1 OK 169 41 SvenSE_531
2244 00:00:01 Festival 3.1 OK 219 61 SvenSE_532
2245 00:00:01 Festival 3.1 OK 179 46 SvenSE_533
2246 00:00:01 Festival 3.1 OK 119 29 SvenSE_534
2247 00:00:00 Festival 3.1 OK 104 38 SvenSE_535
2248 00:00:01 Festival 3.1 OK 91 29 SvenSE_536
2249 00:00:02 Festival 3.1 OK 199 46 SvenSE_537
2250 00:00:02 Festival 3.1 OK 178 48 SvenSE_538
2251 00:00:02 Festival 3.1 OK 149 34 SvenSE_539
2252 00:00:01 Festival 3.1 OK 335 80 SvenSE_54
2253 00:00:00 Festival 3.1 OK 237 73 SvenSE_540
2254 00:00:01 Festival 3.1 OK 129 34 SvenSE_541
2255 00:00:01 Festival 3.1 OK 279 48 SvenSE_542
2256 00:00:00 Festival 3.1 OK 253 44 SvenSE_543
2257 00:00:01 Festival 3.1 OK 255 48 SvenSE_544
2258 00:00:00 Festival 3.1 OK 275 36 SvenSE_545
2259 00:00:01 Festival 3.1 OK 221 36 SvenSE_546
2260 00:00:01 Festival 3.1 OK 243 37 SvenSE_547
2261 00:00:00 Festival 3.1 OK 244 34 SvenSE_548
2262 00:00:01 Festival 3.1 OK 347 60 SvenSE_549
2263 00:01:11 Festival 3.1 OK 822 266 SvenSE_55
2264 00:00:00 Festival 3.1 OK 239 39 SvenSE_550
2265 00:00:01 Festival 3.1 OK 276 40 SvenSE_551
2266 00:00:00 Festival 3.1 OK 153 22 SvenSE_552
2267 00:00:01 Festival 3.1 OK 123 20 SvenSE_553
2268 00:00:01 Festival 3.1 OK 121 22 SvenSE_554
2269 00:00:00 Festival 3.1 OK 107 21 SvenSE_555
2270 00:00:01 Festival 3.1 OK 140 28 SvenSE_556
2271 00:00:00 Festival 3.1 OK 168 28 SvenSE_557
2272 00:00:01 Festival 3.1 OK 157 22 SvenSE_558
2273 00:00:01 Festival 3.1 OK 441 88 SvenSE_559
2274 00:00:00 Festival 3.1 OK 184 24 SvenSE_56
2275 00:00:05 Festival 3.1 OK 276 64 SvenSE_560
2276 00:00:00 Festival 3.1 OK 434 90 SvenSE_561
2277 00:00:01 Festival 3.1 OK 306 76 SvenSE_562
2278 00:00:00 Festival 3.1 OK 401 95 SvenSE_563
2279 00:00:01 Festival 3.1 OK 357 82 SvenSE_564
2280 00:00:00 Festival 3.1 OK 228 54 SvenSE_565
2281 00:00:01 Festival 3.1 OK 329 90 SvenSE_566
2282 00:00:01 Festival 3.1 OK 501 130 SvenSE_567
2283 00:00:00 Festival 3.1 OK 253 66 SvenSE_568
2284 00:00:01 Festival 3.1 OK 187 48 SvenSE_569
2285 00:00:01 Festival 3.1 OK 302 48 SvenSE_57
2286 00:00:00 Festival 3.1 OK 192 24 SvenSE_570
2287 00:00:01 Festival 3.1 OK 176 24 SvenSE_571
2288 00:00:01 Festival 3.1 OK 77 16 SvenSE_572
2289 00:00:00 Festival 3.1 OK 45 10 SvenSE_573
2290 00:00:01 Festival 3.1 OK 154 28 SvenSE_574
2291 00:00:00 Festival 3.1 OK 90 14 SvenSE_575
2292 00:00:01 Festival 3.1 OK 245 52 SvenSE_576
2293 00:00:00 Festival 3.1 OK 143 48 SvenSE_577
2294 00:00:01 Festival 3.1 OK 136 40 SvenSE_578
2295 00:00:00 Festival 3.1 OK 109 38 SvenSE_579
2296 00:00:01 Festival 3.1 OK 160 24 SvenSE_58
2297 00:00:01 Festival 3.1 OK 120 40 SvenSE_580
2298 00:00:00 Festival 3.1 OK 144 42 SvenSE_581
2299 00:00:01 Festival 3.1 OK 140 26 SvenSE_582
2300 00:00:01 Festival 3.1 OK 167 30 SvenSE_583
2301 00:00:01 Festival 3.1 OK 157 28 SvenSE_584
2302 00:00:01 Festival 3.1 OK 111 32 SvenSE_585
2303 00:00:00 Festival 3.1 OK 51 14 SvenSE_586
2304 00:00:01 Festival 3.1 OK 101 28 SvenSE_587
2305 00:00:00 Festival 3.1 OK 106 30 SvenSE_588
2306 00:00:01 Festival 3.1 OK 119 27 SvenSE_589
2307 00:00:01 Festival 3.1 OK 566 110 SvenSE_59
2308 00:00:00 Festival 3.1 OK 129 25 SvenSE_590
2309 00:00:01 Festival 3.1 OK 131 32 SvenSE_591
2310 00:00:00 Festival 3.1 OK 175 50 SvenSE_592
2311 00:00:01 Festival 3.1 OK 232 42 SvenSE_593
2312 00:00:01 Festival 3.1 OK 203 58 SvenSE_594
2313 00:00:01 Festival 3.1 OK 363 65 SvenSE_595
2314 00:00:01 Festival 3.1 OK 92 24 SvenSE_596
2315 00:00:00 Festival 3.1 OK 182 30 SvenSE_597
2316 00:00:01 Festival 3.1 OK 306 68 SvenSE_598
2317 00:00:02 Festival 3.1 OK 164 44 SvenSE_599
2318 00:00:15 Festival 3.1 OK 1541 500 SvenSE_6
2319 00:00:01 Festival 3.1 OK 155 20 SvenSE_60
2320 00:00:01 Festival 3.1 OK 183 46 SvenSE_600
2321 00:00:01 Festival 3.1 OK 151 34 SvenSE_601
2322 00:00:01 Festival 3.1 OK 114 28 SvenSE_602
2323 00:00:01 Festival 3.1 OK 115 28 SvenSE_603
2324 00:00:01 Festival 3.1 OK 151 32 SvenSE_604
2325 00:00:02 Festival 3.1 OK 167 38 SvenSE_605
2326 00:00:01 Festival 3.1 OK 183 34 SvenSE_606
2327 00:00:02 Festival 3.1 OK 181 35 SvenSE_607
2328 00:00:01 Festival 3.1 OK 123 18 SvenSE_608
2329 00:00:00 Festival 3.1 OK 183 28 SvenSE_609
2330 00:00:01 Festival 3.1 OK 448 80 SvenSE_61
2331 00:00:01 Festival 3.1 OK 114 20 SvenSE_610
2332 00:00:01 Festival 3.1 OK 216 38 SvenSE_611
2333 00:00:01 Festival 3.1 OK 218 30 SvenSE_612
2334 00:00:02 Festival 3.1 OK 159 35 SvenSE_613
2335 00:00:00 Festival 3.1 OK 59 16 SvenSE_614
2336 00:00:01 Festival 3.1 OK 53 14 SvenSE_615
2337 00:00:01 Festival 3.1 OK 133 19 SvenSE_616
2338 00:00:00 Festival 3.1 OK 91 16 SvenSE_617
2339 00:00:01 Festival 3.1 OK 281 58 SvenSE_618
2340 00:00:01 Festival 3.1 OK 184 32 SvenSE_619
2341 00:00:00 Festival 3.1 OK 452 84 SvenSE_62
2342 00:00:01 Festival 3.1 OK 110 18 SvenSE_620
2343 00:00:01 Festival 3.1 OK 118 20 SvenSE_621
2344 00:00:00 Festival 3.1 OK 151 26 SvenSE_622
2345 00:00:01 Festival 3.1 OK 100 26 SvenSE_623
2346 00:00:01 Festival 3.1 OK 48 15 SvenSE_624
2347 00:00:00 Festival 3.1 OK 100 22 SvenSE_625
2348 00:00:01 Festival 3.1 OK 116 24 SvenSE_626
2349 00:00:01 Festival 3.1 OK 221 49 SvenSE_627
2350 00:00:01 Festival 3.1 OK 127 32 SvenSE_628
2351 00:00:00 Festival 3.1 OK 94 28 SvenSE_629
2352 00:00:01 Festival 3.1 OK 328 64 SvenSE_63
2353 00:00:01 Festival 3.1 OK 223 41 SvenSE_630
2354 00:00:00 Festival 3.1 OK 79 21 SvenSE_631
2355 00:00:01 Festival 3.1 OK 162 34 SvenSE_632
2356 00:00:01 Festival 3.1 OK 162 34 SvenSE_633
2357 00:00:01 Festival 3.1 OK 180 48 SvenSE_634
2358 00:00:00 Festival 3.1 OK 123 30 SvenSE_635
2359 00:00:01 Festival 3.1 OK 215 45 SvenSE_636
2360 00:00:01 Festival 3.1 OK 59 16 SvenSE_637
2361 00:00:01 Festival 3.1 OK 145 38 SvenSE_638
2362 00:00:01 Festival 3.1 OK 325 68 SvenSE_639
2363 00:00:00 Festival 3.1 OK 524 72 SvenSE_64
2364 00:00:01 Festival 3.1 OK 344 82 SvenSE_640
2365 00:00:01 Festival 3.1 OK 43 8 SvenSE_641
2366 00:00:00 Festival 3.1 OK 188 40 SvenSE_642
2367 00:00:01 Festival 3.1 OK 239 44 SvenSE_643
2368 00:00:03 Festival 3.1 OK 504 88 SvenSE_644
2369 00:00:02 Festival 3.1 OK 448 83 SvenSE_645
2370 00:00:01 Festival 3.1 OK 68 15 SvenSE_646
2371 00:00:00 Festival 3.1 OK 44 11 SvenSE_647
2372 00:00:01 Festival 3.1 OK 127 27 SvenSE_648
2373 00:00:01 Festival 3.1 OK 179 29 SvenSE_649
2374 00:00:00 Festival 3.1 OK 174 28 SvenSE_65
2375 00:00:01 Festival 3.1 OK 115 17 SvenSE_650
2376 00:00:00 Festival 3.1 OK 55 11 SvenSE_651
2377 00:00:01 Festival 3.1 OK 54 14 SvenSE_652
2378 00:00:01 Festival 3.1 OK 92 20 SvenSE_653
2379 00:00:00 Festival 3.1 OK 95 19 SvenSE_654
2380 00:00:01 Festival 3.1 OK 174 32 SvenSE_655
2381 00:00:02 Festival 3.1 OK 199 37 SvenSE_656
2382 00:00:01 Festival 3.1 OK 338 52 SvenSE_657
2383 00:00:01 Festival 3.1 OK 425 71 SvenSE_658
2384 00:00:01 Festival 3.1 OK 97 18 SvenSE_659
2385 00:00:01 Festival 3.1 OK 181 54 SvenSE_66
2386 00:00:01 Festival 3.1 OK 141 19 SvenSE_660
2387 00:00:00 Festival 3.1 OK 155 20 SvenSE_661
2388 00:00:01 Festival 3.1 OK 124 15 SvenSE_662
2389 00:00:00 Festival 3.1 OK 133 19 SvenSE_663
2390 00:00:01 Festival 3.1 OK 172 26 SvenSE_664
2391 00:00:01 Festival 3.1 OK 229 31 SvenSE_665
2392 00:00:00 Festival 3.1 OK 142 32 SvenSE_666
2393 00:00:02 Festival 3.1 OK 299 51 SvenSE_667
2394 00:00:00 Festival 3.1 OK 92 22 SvenSE_668
2395 00:00:00 Festival 3.1 OK 118 20 SvenSE_669
2396 00:00:01 Festival 3.1 OK 141 32 SvenSE_67
2397 00:00:01 Festival 3.1 OK 223 49 SvenSE_670
2398 00:00:01 Festival 3.1 OK 299 38 SvenSE_671
2399 00:00:01 Festival 3.1 OK 102 23 SvenSE_672
2400 00:00:00 Festival 3.1 OK 101 21 SvenSE_673
2401 00:00:02 Festival 3.1 OK 211 41 SvenSE_674
2402 00:00:01 Festival 3.1 OK 206 37 SvenSE_675
2403 00:00:00 Festival 3.1 OK 247 53 SvenSE_676
2404 00:00:01 Festival 3.1 OK 157 27 SvenSE_677
2405 00:00:01 Festival 3.1 OK 89 24 SvenSE_678
2406 00:00:00 Festival 3.1 OK 155 37 SvenSE_679
2407 00:00:01 Festival 3.1 OK 128 34 SvenSE_68
2408 00:00:01 Festival 3.1 OK 143 38 SvenSE_680
2409 00:00:00 Festival 3.1 OK 141 28 SvenSE_681
2410 00:00:01 Festival 3.1 OK 133 34 SvenSE_682
2411 00:00:01 Festival 3.1 OK 85 23 SvenSE_683
2412 00:00:00 Festival 3.1 OK 83 17 SvenSE_684
2413 00:00:01 Festival 3.1 OK 92 18 SvenSE_685
2414 00:00:00 Festival 3.1 OK 70 22 SvenSE_686
2415 00:00:00 Festival 3.1 OK 369 70 SvenSE_687
2416 00:00:01 Festival 3.1 OK 56 18 SvenSE_688
2417 00:00:01 Festival 3.1 OK 629 104 SvenSE_689
2418 00:00:01 Festival 3.1 OK 218 52 SvenSE_69
2419 00:00:01 Festival 3.1 OK 598 84 SvenSE_690
2420 00:00:02 Festival 3.1 OK 589 112 SvenSE_691
2421 00:00:01 Festival 3.1 OK 330 52 SvenSE_692
2422 00:00:01 Festival 3.1 OK 289 39 SvenSE_693
2423 00:00:02 Festival 3.1 OK 339 52 SvenSE_694
2424 00:00:02 Festival 3.1 OK 307 43 SvenSE_695
2425 00:00:01 Festival 3.1 OK 83 22 SvenSE_696
2426 00:00:00 Festival 3.1 OK 97 26 SvenSE_697
2427 00:00:01 Festival 3.1 OK 117 26 SvenSE_698
2428 00:00:01 Festival 3.1 OK 125 28 SvenSE_699
2429 00:00:04 Festival 3.1 OK 1449 482 SvenSE_7
2430 00:00:01 Festival 3.1 OK 208 34 SvenSE_70
2431 00:00:00 Festival 3.1 OK 147 40 SvenSE_700
2432 00:00:01 Festival 3.1 OK 169 30 SvenSE_701
2433 00:00:01 Festival 3.1 OK 118 26 SvenSE_702
2434 00:00:01 Festival 3.1 OK 113 26 SvenSE_703
2435 00:00:01 Festival 3.1 OK 121 31 SvenSE_704
2436 00:00:01 Festival 3.1 OK 96 27 SvenSE_705
2437 00:00:00 Festival 3.1 OK 76 25 SvenSE_706
2438 00:00:01 Festival 3.1 OK 76 25 SvenSE_707
2439 00:00:01 Festival 3.1 OK 91 23 SvenSE_708
2440 00:00:00 Festival 3.1 OK 91 23 SvenSE_709
2441 00:00:01 Festival 3.1 OK 107 30 SvenSE_71
2442 00:00:01 Festival 3.1 OK 87 26 SvenSE_710
2443 00:00:01 Festival 3.1 OK 89 26 SvenSE_711
2444 00:00:01 Festival 3.1 OK 159 33 SvenSE_712
2445 00:00:00 Festival 3.1 OK 81 21 SvenSE_713
2446 00:00:01 Festival 3.1 OK 96 29 SvenSE_714
2447 00:00:01 Festival 3.1 OK 97 26 SvenSE_715
2448 00:00:00 Festival 3.1 OK 97 30 SvenSE_716
2449 00:00:01 Festival 3.1 OK 177 35 SvenSE_717
2450 00:00:01 Festival 3.1 OK 193 41 SvenSE_718
2451 00:00:01 Festival 3.1 OK 150 41 SvenSE_719
2452 00:00:00 Festival 3.1 OK 120 32 SvenSE_72
2453 00:00:01 Festival 3.1 OK 128 31 SvenSE_720
2454 00:00:00 Festival 3.1 OK 160 44 SvenSE_721
2455 00:00:01 Festival 3.1 OK 102 30 SvenSE_722
2456 00:00:01 Festival 3.1 OK 155 34 SvenSE_723
2457 00:00:01 Festival 3.1 OK 128 32 SvenSE_724
2458 00:00:01 Festival 3.1 OK 92 29 SvenSE_725
2459 00:00:01 Festival 3.1 OK 63 24 SvenSE_726
2460 00:00:00 Festival 3.1 OK 131 32 SvenSE_727
2461 00:00:01 Festival 3.1 OK 121 30 SvenSE_728
2462 00:00:01 Festival 3.1 OK 133 31 SvenSE_729
2463 00:00:00 Festival 3.1 OK 345 62 SvenSE_73
2464 00:00:01 Festival 3.1 OK 100 35 SvenSE_730
2465 00:00:01 Festival 3.1 OK 123 42 SvenSE_731
2466 00:00:01 Festival 3.1 OK 127 38 SvenSE_732
2467 00:00:00 Festival 3.1 OK 115 26 SvenSE_733
2468 00:00:01 Festival 3.1 OK 131 31 SvenSE_734
2469 00:00:01 Festival 3.1 OK 98 26 SvenSE_735
2470 00:00:01 Festival 3.1 OK 116 26 SvenSE_736
2471 00:00:01 Festival 3.1 OK 113 24 SvenSE_737
2472 00:00:01 Festival 3.1 OK 78 26 SvenSE_738
2473 00:00:01 Festival 3.1 OK 87 23 SvenSE_739
2474 00:00:00 Festival 3.1 OK 453 76 SvenSE_74
2475 00:00:01 Festival 3.1 OK 44 23 SvenSE_740
2476 00:00:01 Festival 3.1 OK 149 41 SvenSE_741
2477 00:00:00 Festival 3.1 OK 71 13 SvenSE_742
2478 00:00:01 Festival 3.1 OK 63 24 SvenSE_743
2479 00:03:46 Festival 3.1 OK 4164 370 SvenSE_744
2480 00:00:02 Festival 3.1 OK 248 47 SvenSE_745
2481 00:00:01 Festival 3.1 OK 169 47 SvenSE_746
2482 00:00:00 Festival 3.1 OK 130 43 SvenSE_747
2483 00:00:01 Festival 3.1 OK 128 32 SvenSE_748
2484 00:00:01 Festival 3.1 OK 113 28 SvenSE_749
2485 00:00:00 Festival 3.1 OK 61 10 SvenSE_75
2486 00:00:01 Festival 3.1 OK 107 28 SvenSE_750
2487 00:00:01 Festival 3.1 OK 89 28 SvenSE_751
2488 00:00:00 Festival 3.1 OK 100 32 SvenSE_752
2489 00:00:01 Festival 3.1 OK 98 20 SvenSE_753
2490 00:00:01 Festival 3.1 OK 84 37 SvenSE_754
2491 00:00:00 Festival 3.1 OK 77 35 SvenSE_755
2492 00:00:01 Festival 3.1 OK 94 47 SvenSE_756
2493 00:00:00 Festival 3.1 OK 90 26 SvenSE_757
2494 00:00:01 Festival 3.1 OK 63 25 SvenSE_758
2495 00:00:01 Festival 3.1 OK 90 24 SvenSE_759
2496 00:00:00 Festival 3.1 OK 43 9 SvenSE_76
2497 00:00:01 Festival 3.1 OK 114 48 SvenSE_760
2498 00:00:00 Festival 3.1 OK 114 36 SvenSE_761
2499 00:00:01 Festival 3.1 OK 94 26 SvenSE_762
2500 00:00:00 Festival 3.1 OK 63 24 SvenSE_763
2501 00:00:01 Festival 3.1 OK 89 24 SvenSE_764
2502 00:00:00 Festival 3.1 OK 98 41 SvenSE_765
2503 00:00:01 Festival 3.1 OK 189 53 SvenSE_766
2504 00:00:01 Festival 3.1 OK 96 24 SvenSE_767
2505 00:00:00 Festival 3.1 OK 123 29 SvenSE_768
2506 00:00:01 Festival 3.1 OK 124 38 SvenSE_769
2507 00:00:00 Festival 3.1 OK 39 9 SvenSE_77
2508 00:00:01 Festival 3.1 OK 176 46 SvenSE_770
2509 00:00:00 Festival 3.1 OK 146 49 SvenSE_771
2510 00:00:01 Festival 3.1 OK 146 46 SvenSE_772
2511 00:00:01 Festival 3.1 OK 147 47 SvenSE_773
2512 00:00:00 Festival 3.1 OK 181 73 SvenSE_774
2513 00:00:01 Festival 3.1 OK 82 23 SvenSE_775
2514 00:00:00 Festival 3.1 OK 81 24 SvenSE_776
2515 00:00:01 Festival 3.1 OK 200 44 SvenSE_777
2516 00:00:01 Festival 3.1 OK 91 30 SvenSE_778
2517 00:00:04 Festival 3.1 OK 200 47 SvenSE_779
2518 00:00:01 Festival 3.1 OK 43 15 SvenSE_78
2519 00:00:00 Festival 3.1 OK 173 45 SvenSE_780
2520 00:00:02 Festival 3.1 OK 208 48 SvenSE_781
2521 00:00:01 Festival 3.1 OK 195 46 SvenSE_782
2522 00:00:01 Festival 3.1 OK 182 43 SvenSE_783
2523 00:00:01 Festival 3.1 OK 103 24 SvenSE_784
2524 00:00:01 Festival 3.1 OK 114 24 SvenSE_785
2525 00:00:01 Festival 3.1 OK 118 22 SvenSE_786
2526 00:00:00 Festival 3.1 OK 143 33 SvenSE_787
2527 00:00:01 Festival 3.1 OK 107 30 SvenSE_788
2528 00:00:00 Festival 3.1 OK 98 26 SvenSE_789
2529 00:00:01 Festival 3.1 OK 107 22 SvenSE_79
2530 00:00:01 Festival 3.1 OK 77 16 SvenSE_790
2531 00:00:00 Festival 3.1 OK 60 19 SvenSE_791
2532 00:00:01 Festival 3.1 OK 62 17 SvenSE_792
2533 00:00:00 Festival 3.1 OK 120 25 SvenSE_793
2534 00:00:01 Festival 3.1 OK 66 19 SvenSE_794
2535 00:00:01 Festival 3.1 OK 142 36 SvenSE_795
2536 00:00:00 Festival 3.1 OK 74 23 SvenSE_796
2537 00:00:01 Festival 3.1 OK 69 19 SvenSE_797
2538 00:00:00 Festival 3.1 OK 283 50 SvenSE_798
2539 00:00:01 Festival 3.1 OK 155 46 SvenSE_799
2540 00:00:01 Festival 3.1 OK 1050 289 SvenSE_8
2541 00:00:01 Festival 3.1 OK 164 52 SvenSE_80
2542 00:00:01 Festival 3.1 OK 159 50 SvenSE_800
2543 00:00:01 Festival 3.1 OK 186 47 SvenSE_801
2544 00:00:01 Festival 3.1 OK 210 41 SvenSE_802
2545 00:00:00 Festival 3.1 OK 92 22 SvenSE_803
2546 00:00:01 Festival 3.1 OK 554 115 SvenSE_804
2547 00:00:01 Festival 3.1 OK 298 80 SvenSE_805
2548 00:00:00 Festival 3.1 OK 314 94 SvenSE_806
2549 00:00:01 Festival 3.1 OK 551 110 SvenSE_807
2550 00:00:01 Festival 3.1 OK 424 76 SvenSE_808
2551 00:00:00 Festival 3.1 OK 580 94 SvenSE_809
2552 00:00:01 Festival 3.1 OK 473 70 SvenSE_81
2553 00:00:01 Festival 3.1 OK 498 82 SvenSE_810
2554 00:00:00 Festival 3.1 OK 269 42 SvenSE_811
2555 00:00:01 Festival 3.1 OK 149 24 SvenSE_812
2556 00:00:00 Festival 3.1 OK 139 25 SvenSE_813
2557 00:00:01 Festival 3.1 OK 345 41 SvenSE_814
2558 00:00:00 Festival 3.1 OK 164 36 SvenSE_815
2559 00:00:01 Festival 3.1 OK 137 30 SvenSE_816
2560 00:00:01 Festival 3.1 OK 123 26 SvenSE_817
2561 00:00:00 Festival 3.1 OK 104 19 SvenSE_818
2562 00:00:01 Festival 3.1 OK 150 22 SvenSE_819
2563 00:00:03 Festival 3.1 OK 1333 318 SvenSE_82
2564 00:00:00 Festival 3.1 OK 74 22 SvenSE_820
2565 00:03:46 Festival 3.1 OK 1520 150 SvenSE_821
2566 00:00:04 Festival 3.1 OK 1002 80 SvenSE_822
2567 00:03:34 Festival 3.1 OK 4942 475 SvenSE_823
2568 00:00:05 Festival 3.1 OK 3335 785 SvenSE_824
2569 00:10:01 Festival 3.1 Time limit exceeded SvenSE_825
2570 00:00:08 Festival 3.1 OK 701 90 SvenSE_826
2571 00:01:07 Festival 3.1 OK 980 144 SvenSE_827
2572 00:04:49 Festival 3.1 OK 2020 208 SvenSE_828
2573 00:10:01 Festival 3.1 Time limit exceeded SvenSE_829
2574 00:00:01 Festival 3.1 OK 263 28 SvenSE_83
2575 00:00:15 Festival 3.1 OK 398 70 SvenSE_830
2576 00:00:02 Festival 3.1 OK 485 68 SvenSE_831
2577 00:03:43 Festival 3.1 OK 1526 188 SvenSE_832
2578 00:00:00 Festival 3.1 OK 194 28 SvenSE_833
2579 00:00:01 Festival 3.1 OK 155 28 SvenSE_834
2580 00:00:00 Festival 3.1 OK 237 28 SvenSE_835
2581 00:00:01 Festival 3.1 OK 109 22 SvenSE_836
2582 00:04:01 Festival 3.1 OK 5350 348 SvenSE_837
2583 00:00:01 Festival 3.1 OK 382 93 SvenSE_838
2584 00:00:01 Festival 3.1 OK 467 114 SvenSE_839
2585 00:00:01 Festival 3.1 OK 295 32 SvenSE_84
2586 00:00:50 Festival 3.1 OK 1177 195 SvenSE_840
2587 00:00:01 Festival 3.1 OK 641 166 SvenSE_841
2588 00:03:11 Festival 3.1 OK 2981 1146 SvenSE_842
2589 00:03:26 Festival 3.1 OK 2235 644 SvenSE_843
2590 00:00:04 Festival 3.1 OK 1860 357 SvenSE_844
2591 00:00:01 Festival 3.1 OK 232 38 SvenSE_845
2592 00:00:01 Festival 3.1 OK 213 42 SvenSE_846
2593 00:00:01 Festival 3.1 OK 281 70 SvenSE_847
2594 00:00:09 Festival 3.1 OK 364 54 SvenSE_848
2595 00:00:01 Festival 3.1 OK 120 40 SvenSE_849
2596 00:00:00 Festival 3.1 OK 279 34 SvenSE_85
2597 00:00:02 Festival 3.1 OK 661 118 SvenSE_850
2598 00:00:00 Festival 3.1 OK 394 66 SvenSE_851
2599 00:00:01 Festival 3.1 OK 230 44 SvenSE_852
2600 00:00:01 Festival 3.1 OK 121 24 SvenSE_853
2601 00:00:01 Festival 3.1 OK 340 62 SvenSE_854
2602 00:00:03 Festival 3.1 OK 524 62 SvenSE_855
2603 00:00:11 Festival 3.1 OK 306 66 SvenSE_856
2604 00:00:01 Festival 3.1 OK 233 50 SvenSE_857
2605 00:00:03 Festival 3.1 OK 258 45 SvenSE_858
2606 00:00:07 Festival 3.1 OK 532 78 SvenSE_859
2607 00:00:01 Festival 3.1 OK 431 36 SvenSE_86
2608 00:00:01 Festival 3.1 OK 759 152 SvenSE_860
2609 00:00:01 Festival 3.1 OK 584 117 SvenSE_861
2610 00:03:26 Festival 3.1 OK 1640 212 SvenSE_862
2611 00:03:00 Festival 3.1 OK 1880 320 SvenSE_863
2612 00:00:07 Festival 3.1 OK 629 88 SvenSE_864
2613 00:00:08 Festival 3.1 OK 714 60 SvenSE_865
2614 00:00:23 Festival 3.1 OK 663 76 SvenSE_866
2615 00:00:10 Festival 3.1 OK 980 204 SvenSE_867
2616 00:00:00 Festival 3.1 OK 136 28 SvenSE_868
2617 00:00:01 Festival 3.1 OK 120 40 SvenSE_869
2618 00:00:01 Festival 3.1 OK 103 12 SvenSE_87
2619 00:00:00 Festival 3.1 OK 161 31 SvenSE_870
2620 00:00:02 Festival 3.1 OK 1255 314 SvenSE_871
2621 00:00:01 Festival 3.1 OK 187 34 SvenSE_872
2622 00:00:01 Festival 3.1 OK 175 30 SvenSE_873
2623 00:00:17 Festival 3.1 OK 439 76 SvenSE_874
2624 00:00:01 Festival 3.1 OK 295 54 SvenSE_875
2625 00:00:01 Festival 3.1 OK 69 16 SvenSE_876
2626 00:00:00 Festival 3.1 OK 62 14 SvenSE_877
2627 00:00:10 Festival 3.1 OK 688 65 SvenSE_878
2628 00:10:01 Festival 3.1 Time limit exceeded SvenSE_879
2629 00:00:00 Festival 3.1 OK 148 16 SvenSE_88
2630 00:00:08 Festival 3.1 OK 2093 445 SvenSE_880
2631 00:00:03 Festival 3.1 OK 2475 651 SvenSE_881
2632 00:00:00 Festival 3.1 OK 363 124 SvenSE_882
2633 00:00:01 Festival 3.1 OK 373 126 SvenSE_883
2634 00:00:01 Festival 3.1 OK 104 15 SvenSE_884
2635 00:00:00 Festival 3.1 OK 144 17 SvenSE_885
2636 00:00:04 Festival 3.1 OK 334 51 SvenSE_886
2637 00:04:31 Festival 3.1 OK 962 109 SvenSE_887
2638 00:00:34 Festival 3.1 OK 538 45 SvenSE_888
2639 00:00:02 Festival 3.1 OK 436 47 SvenSE_889
2640 00:00:00 Festival 3.1 OK 86 12 SvenSE_89
2641 00:00:01 Festival 3.1 OK 234 33 SvenSE_890
2642 00:00:01 Festival 3.1 OK 253 38 SvenSE_891
2643 00:00:01 Festival 3.1 OK 222 37 SvenSE_892
2644 00:00:02 Festival 3.1 OK 208 43 SvenSE_893
2645 00:00:00 Festival 3.1 OK 77 24 SvenSE_894
2646 00:00:02 Festival 3.1 OK 470 102 SvenSE_895
2647 00:00:02 Festival 3.1 OK 867 130 SvenSE_896
2648 00:00:02 Festival 3.1 OK 429 99 SvenSE_897
2649 00:00:01 Festival 3.1 OK 281 72 SvenSE_898
2650 00:00:31 Festival 3.1 OK 493 59 SvenSE_899
2651 00:00:01 Festival 3.1 OK 472 51 SvenSE_9
2652 00:00:00 Festival 3.1 OK 122 22 SvenSE_90
2653 00:00:04 Festival 3.1 OK 365 46 SvenSE_900
2654 00:00:01 Festival 3.1 OK 346 24 SvenSE_901
2655 00:00:01 Festival 3.1 OK 78 14 SvenSE_902
2656 00:00:01 Festival 3.1 OK 244 40 SvenSE_903
2657 00:00:02 Festival 3.1 OK 75 25 SvenSE_904
2658 00:03:20 Festival 3.1 OK 1440 116 SvenSE_905
2659 00:00:01 Festival 3.1 OK 101 32 SvenSE_906
2660 00:00:04 Festival 3.1 OK 224 50 SvenSE_907
2661 00:00:01 Festival 3.1 OK 109 34 SvenSE_908
2662 00:00:00 Festival 3.1 OK 164 24 SvenSE_909
2663 00:00:01 Festival 3.1 OK 435 72 SvenSE_91
2664 00:07:49 Festival 3.1 OK 803 166 SvenSE_910
2665 00:00:03 Festival 3.1 OK 462 44 SvenSE_911
2666 00:00:02 Festival 3.1 OK 228 48 SvenSE_912
2667 00:00:04 Festival 3.1 OK 316 66 SvenSE_913
2668 00:00:00 Festival 3.1 OK 255 48 SvenSE_914
2669 00:00:01 Festival 3.1 OK 275 44 SvenSE_915
2670 00:00:02 Festival 3.1 OK 645 92 SvenSE_916
2671 00:00:01 Festival 3.1 OK 102 18 SvenSE_917
2672 00:00:01 Festival 3.1 OK 344 32 SvenSE_918
2673 00:00:08 Festival 3.1 OK 295 52 SvenSE_919
2674 00:00:00 Festival 3.1 OK 353 44 SvenSE_92
2675 00:00:56 Festival 3.1 OK 584 90 SvenSE_920
2676 00:03:24 Festival 3.1 OK 1090 112 SvenSE_921
2677 00:00:44 Festival 3.1 OK 410 68 SvenSE_922
2678 00:00:06 Festival 3.1 OK 275 58 SvenSE_923
2679 00:00:01 Festival 3.1 OK 140 30 SvenSE_924
2680 00:00:03 Festival 3.1 OK 214 54 SvenSE_925
2681 00:00:01 Festival 3.1 OK 293 53 SvenSE_926
2682 00:00:08 Festival 3.1 OK 709 154 SvenSE_927
2683 00:00:01 Festival 3.1 OK 113 23 SvenSE_928
2684 00:00:01 Festival 3.1 OK 187 33 SvenSE_929
2685 00:00:00 Festival 3.1 OK 203 47 SvenSE_93
2686 00:00:01 Festival 3.1 OK 875 214 SvenSE_930
2687 00:00:02 Festival 3.1 OK 333 55 SvenSE_931
2688 00:00:01 Festival 3.1 OK 1200 228 SvenSE_932
2689 00:00:01 Festival 3.1 OK 304 58 SvenSE_933
2690 00:00:00 Festival 3.1 OK 140 28 SvenSE_934
2691 00:00:01 Festival 3.1 OK 188 34 SvenSE_935
2692 00:00:01 Festival 3.1 OK 118 30 SvenSE_936
2693 00:00:01 Festival 3.1 OK 260 38 SvenSE_937
2694 00:00:00 Festival 3.1 OK 151 28 SvenSE_938
2695 00:00:01 Festival 3.1 OK 162 24 SvenSE_939
2696 00:00:01 Festival 3.1 OK 247 51 SvenSE_94
2697 00:00:01 Festival 3.1 OK 161 37 SvenSE_940
2698 00:00:01 Festival 3.1 OK 561 114 SvenSE_941
2699 00:00:02 Festival 3.1 OK 596 114 SvenSE_942
2700 00:00:01 Festival 3.1 OK 376 60 SvenSE_943
2701 00:00:01 Festival 3.1 OK 610 73 SvenSE_944
2702 00:00:01 Festival 3.1 OK 419 130 SvenSE_945
2703 00:00:01 Festival 3.1 OK 391 46 SvenSE_946
2704 00:00:11 Festival 3.1 OK 563 112 SvenSE_947
2705 00:00:20 Festival 3.1 OK 852 128 SvenSE_948
2706 00:00:08 Festival 3.1 OK 581 76 SvenSE_949
2707 00:00:00 Festival 3.1 OK 271 69 SvenSE_95
2708 00:00:01 Festival 3.1 OK 366 54 SvenSE_950
2709 00:00:04 Festival 3.1 OK 527 124 SvenSE_951
2710 00:00:01 Festival 3.1 OK 28 11 SvenSE_952
2711 00:00:01 Festival 3.1 OK 338 74 SvenSE_953
2712 00:00:01 Festival 3.1 OK 269 48 SvenSE_954
2713 00:00:01 Festival 3.1 OK 304 61 SvenSE_955
2714 00:00:02 Festival 3.1 OK 380 61 SvenSE_956
2715 00:00:17 Festival 3.1 OK 608 75 SvenSE_957
2716 00:01:13 Festival 3.1 OK 647 75 SvenSE_958
2717 00:00:04 Festival 3.1 OK 419 121 SvenSE_959
2718 00:00:01 Festival 3.1 OK 203 52 SvenSE_96
2719 00:00:01 Festival 3.1 OK 452 149 SvenSE_960
2720 00:00:01 Festival 3.1 OK 464 144 SvenSE_961
2721 00:00:00 Festival 3.1 OK 308 46 SvenSE_962
2722 00:00:01 Festival 3.1 OK 245 40 SvenSE_963
2723 00:00:04 Festival 3.1 OK 1054 92 SvenSE_964
2724 00:04:50 Festival 3.1 OK 1264 198 SvenSE_965
2725 00:10:01 Festival 3.1 Time limit exceeded SvenSE_966
2726 00:00:01 Festival 3.1 OK 772 165 SvenSE_967
2727 00:00:01 Festival 3.1 OK 216 56 SvenSE_968
2728 00:00:01 Festival 3.1 OK 331 52 SvenSE_969
2729 00:00:03 Festival 3.1 OK 225 48 SvenSE_97
2730 00:00:01 Festival 3.1 OK 288 56 SvenSE_970
2731 00:00:01 Festival 3.1 OK 241 48 SvenSE_971
2732 00:00:01 Festival 3.1 OK 250 57 SvenSE_972
2733 00:00:02 Festival 3.1 OK 261 46 SvenSE_973
2734 00:00:02 Festival 3.1 OK 529 124 SvenSE_974
2735 00:00:02 Festival 3.1 OK 575 88 SvenSE_975
2736 00:00:03 Festival 3.1 OK 377 84 SvenSE_976
2737 00:00:12 Festival 3.1 OK 799 80 SvenSE_977
2738 00:02:58 Festival 3.1 OK 1413 282 SvenSE_978
2739 00:01:01 Festival 3.1 OK 2101 204 SvenSE_979
2740 00:00:15 Festival 3.1 OK 195 46 SvenSE_98
2741 00:00:14 Festival 3.1 OK 600 128 SvenSE_980
2742 00:00:12 Festival 3.1 OK 627 118 SvenSE_981
2743 00:00:01 Festival 3.1 OK 411 48 SvenSE_982
2744 00:00:01 Festival 3.1 OK 191 44 SvenSE_983
2745 00:03:02 Festival 3.1 OK 2182 366 SvenSE_984
2746 00:03:18 Festival 3.1 OK 1619 190 SvenSE_985
2747 00:00:48 Festival 3.1 OK 1003 169 SvenSE_986
2748 00:00:02 Festival 3.1 OK 410 140 SvenSE_987
2749 00:03:21 Festival 3.1 OK 555 129 SvenSE_988
2750 00:03:26 Festival 3.1 OK 396 85 SvenSE_989
2751 00:00:09 Festival 3.1 OK 258 48 SvenSE_99
2752 00:00:02 Festival 3.1 OK 615 62 SvenSE_990
2753 00:00:01 Festival 3.1 OK 733 130 SvenSE_991
2754 00:10:01 Festival 3.1 Time limit exceeded SvenSE_992
2755 00:10:01 Festival 3.1 Time limit exceeded SvenSE_993
2756 00:00:00 Festival 3.1 OK 152 48 SvenSE_994
2757 00:00:02 Festival 3.1 OK 520 104 SvenSE_995
2758 00:00:00 Festival 3.1 OK 154 49 SvenSE_996
2759 00:00:01 Festival 3.1 OK 450 98 SvenSE_997
2760 00:00:01 Festival 3.1 OK 454 102 SvenSE_998
2761 00:00:04 Festival 3.1 OK 360 114 SvenSE_999
2762 00:00:00 Festival 3.1 OK 264 99 XSokoban1
2763 00:00:02 Festival 3.1 OK 1627 582 XSokoban10
2764 00:00:03 Festival 3.1 OK 951 267 XSokoban11
2765 00:00:00 Festival 3.1 OK 881 242 XSokoban12
2766 00:00:01 Festival 3.1 OK 842 266 XSokoban13
2767 00:00:01 Festival 3.1 OK 1156 283 XSokoban14
2768 00:00:05 Festival 3.1 OK 941 220 XSokoban15
2769 00:00:04 Festival 3.1 OK 974 318 XSokoban16
2770 00:00:01 Festival 3.1 OK 565 221 XSokoban17
2771 00:00:01 Festival 3.1 OK 1062 212 XSokoban18
2772 00:00:01 Festival 3.1 OK 1085 412 XSokoban19
2773 00:00:01 Festival 3.1 OK 563 147 XSokoban2
2774 00:00:02 Festival 3.1 OK 2161 546 XSokoban20
2775 00:00:00 Festival 3.1 OK 536 177 XSokoban21
2776 00:00:02 Festival 3.1 OK 1606 590 XSokoban22
2777 00:00:02 Festival 3.1 OK 1317 494 XSokoban23
2778 00:00:02 Festival 3.1 OK 1678 600 XSokoban24
2779 00:00:02 Festival 3.1 OK 1458 408 XSokoban25
2780 00:00:01 Festival 3.1 OK 627 229 XSokoban26
2781 00:00:01 Festival 3.1 OK 1446 383 XSokoban27
2782 00:00:01 Festival 3.1 OK 1013 336 XSokoban28
2783 00:03:21 Festival 3.1 OK 1211 302 XSokoban29
2784 00:00:01 Festival 3.1 OK 388 142 XSokoban3
2785 00:00:01 Festival 3.1 OK 1569 533 XSokoban30
2786 00:00:02 Festival 3.1 OK 952 346 XSokoban31
2787 00:00:01 Festival 3.1 OK 535 177 XSokoban32
2788 00:00:01 Festival 3.1 OK 1232 258 XSokoban33
2789 00:00:04 Festival 3.1 OK 1046 222 XSokoban34
2790 00:00:01 Festival 3.1 OK 1230 420 XSokoban35
2791 00:00:06 Festival 3.1 OK 1881 565 XSokoban36
2792 00:00:02 Festival 3.1 OK 1149 508 XSokoban37
2793 00:00:01 Festival 3.1 OK 410 117 XSokoban38
2794 00:00:01 Festival 3.1 OK 1892 726 XSokoban39
2795 00:00:01 Festival 3.1 OK 1003 383 XSokoban4
2796 00:00:12 Festival 3.1 OK 1483 366 XSokoban40
2797 00:00:02 Festival 3.1 OK 789 271 XSokoban41
2798 00:00:02 Festival 3.1 OK 1202 382 XSokoban42
2799 00:00:00 Festival 3.1 OK 634 156 XSokoban43
2800 00:00:02 Festival 3.1 OK 643 195 XSokoban44
2801 00:00:01 Festival 3.1 OK 977 334 XSokoban45
2802 00:00:00 Festival 3.1 OK 1095 295 XSokoban46
2803 00:00:01 Festival 3.1 OK 650 215 XSokoban47
2804 00:00:01 Festival 3.1 OK 897 248 XSokoban48
2805 00:00:01 Festival 3.1 OK 523 136 XSokoban49
2806 00:00:00 Festival 3.1 OK 465 159 XSokoban5
2807 00:00:01 Festival 3.1 OK 1228 442 XSokoban50
2808 00:00:01 Festival 3.1 OK 483 130 XSokoban51
2809 00:00:02 Festival 3.1 OK 2393 531 XSokoban52
2810 00:00:01 Festival 3.1 OK 681 240 XSokoban53
2811 00:00:01 Festival 3.1 OK 888 279 XSokoban54
2812 00:00:02 Festival 3.1 OK 712 234 XSokoban55
2813 00:00:01 Festival 3.1 OK 723 251 XSokoban56
2814 00:00:01 Festival 3.1 OK 783 261 XSokoban57
2815 00:00:01 Festival 3.1 OK 900 287 XSokoban58
2816 00:00:00 Festival 3.1 OK 712 256 XSokoban59
2817 00:00:01 Festival 3.1 OK 352 116 XSokoban6
2818 00:00:01 Festival 3.1 OK 503 162 XSokoban60
2819 00:00:01 Festival 3.1 OK 1059 297 XSokoban61
2820 00:00:01 Festival 3.1 OK 746 255 XSokoban62
2821 00:00:01 Festival 3.1 OK 1585 477 XSokoban63
2822 00:00:00 Festival 3.1 OK 1169 401 XSokoban64
2823 00:00:01 Festival 3.1 OK 767 227 XSokoban65
2824 00:00:02 Festival 3.1 OK 1440 415 XSokoban66
2825 00:00:01 Festival 3.1 OK 1155 435 XSokoban67
2826 00:00:01 Festival 3.1 OK 1399 367 XSokoban68
2827 00:00:01 Festival 3.1 OK 1585 535 XSokoban69
2828 00:00:01 Festival 3.1 OK 367 118 XSokoban7
2829 00:00:00 Festival 3.1 OK 1173 367 XSokoban70
2830 00:00:22 Festival 3.1 OK 1296 382 XSokoban71
2831 00:00:01 Festival 3.1 OK 1301 404 XSokoban72
2832 00:00:01 Festival 3.1 OK 1649 469 XSokoban73
2833 00:00:01 Festival 3.1 OK 830 270 XSokoban74
2834 00:00:04 Festival 3.1 OK 1533 359 XSokoban75
2835 00:00:02 Festival 3.1 OK 1056 364 XSokoban76
2836 00:00:03 Festival 3.1 OK 2419 436 XSokoban77
2837 00:00:01 Festival 3.1 OK 515 174 XSokoban78
2838 00:00:01 Festival 3.1 OK 568 208 XSokoban79
2839 00:00:01 Festival 3.1 OK 787 286 XSokoban8
2840 00:00:01 Festival 3.1 OK 659 263 XSokoban80
2841 00:00:02 Festival 3.1 OK 631 203 XSokoban81
2842 00:00:01 Festival 3.1 OK 480 201 XSokoban82
2843 00:00:01 Festival 3.1 OK 669 252 XSokoban83
2844 00:00:01 Festival 3.1 OK 535 189 XSokoban84
2845 00:00:01 Festival 3.1 OK 1825 395 XSokoban85
2846 00:00:01 Festival 3.1 OK 576 146 XSokoban86
2847 00:00:00 Festival 3.1 OK 1124 295 XSokoban87
2848 00:00:01 Festival 3.1 OK 1214 426 XSokoban88
2849 00:00:02 Festival 3.1 OK 1753 467 XSokoban89
2850 00:00:00 Festival 3.1 OK 670 255 XSokoban9
2851 00:00:02 Festival 3.1 OK 2204 560 XSokoban90

2851 28:19:51 Total OK: 2766 Failed: 85 1687264 318638

General Sokoban information

2023-01-23T22:04:36Z

Matthias Meger: /* Pushes parity */

== Moves parity ==

The parity of the number of moves of a solution depends on the position of the player when the level has been solved.

Example:

[[File:MoveParityExample1.png]]

In this level the move parity is always even when the level has been solved, no matter how the player is moved, since the player must always end at the position left to the box.

The reason for this is that the player can only move up, down, left and right:

[[File:MoveParityExampleWithCheckerboardOverlay.png]]

in the above picture, the squares are alternately colored.
With every move the player moves to a square of the other color, no matter how the player moves. 
This means all darker squares are reached with an odd number of moves and all brighter squares are reached with an even number of moves. 
Since the player start position is fixed for every level the move parity only depends on the end position of the player.

This information is sometimes useful, since for certain levels it may be helpful to now where the player ended.
For example Original level 12:

[[File:Original12.png]]

The best known move solution contains 601 moves.
Since the player starts on a darker square, he must end on a lighter square so that the total number of moves is odd. 
Since there is just one such square the player can end on when the level is solved, the last push of a solution having an odd number of moves is known. 

== Pushes parity ==

The number of pushes needed to solve a specific Sokoban level is always either odd or even.

This can be shown by alternately coloring the squares:

[[File:pushesParityDescriptionLevel.png]]

With every push the boxes reach a square of the other color, no matter in which direction the boxes are pushed. 
Adding walls to the level woudn't change this. 
A box on a darker colored square can reach a darker colored goal with an even number of pushes and a lighter colored square with an odd number of pushes. 

In this level one of the boxes must be pushed to a goal having a different color than the start position of the box. Hence, the total number of pushes needed to solve the level must be odd. 

This property of Sokoban solutions can be leveraged in a Sokoban solver. 
A solver that searches for a solution having the least number of pushes can increase the search depth by 2 each time no solution has been found for the current search depth when the parity of the solution is calculated first.

File:PushesParityDescriptionLevel.png

2023-01-23T21:45:14Z

Matthias Meger: