Solver Statistics
From Sokoban Wiki
(→Solver Statistics: new results for Master Head) |
(New Sokolution website) |
||
(184 intermediate revisions not shown) | |||
Line 1: | Line 1: | ||
- | Sokoban | + | A Sokoban solver program is a program that <u>''tries to''</u> 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.<br /> | |
For copyrights, credits and redistribution of these statistics, please read the disclaimer. | 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 | ||
+ | |- | ||
+ | |<span class="plainlinks">[https://festival-solver.site/ Festival]</span> || 3.1 || Yaron Shoham || 64bit || 8 threads || <span class="plainlinks">[https://festival-solver.site/ Festival 3.1]</span> || <span class="plainlinks">[https://festival-solver.site/ Website with papers about the solver]</span> | ||
+ | |- | ||
+ | |<span class="plainlinks">[http://sokolution.infinityfreeapp.com/ Sokolution]</span> || 6.33 || Florent Diedler || 64bit || all threads || no || <span class="plainlinks">[[Sokoban solver "scribbles" by Florent Diedler about the Sokolution solver | Sokoban solver "scribbles" by Florent Diedler]]</span> | ||
+ | |- | ||
+ | |<span class="plainlinks">[https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]</span> || 7.4 || Ken'ichiro Takahashi (takaken) || 64bit || 2 threads || no || <span class="plainlinks">[https://computerpuzzle.net/puzzle/sokoban/ver731/index.html Description of the used algorithms]</span> | ||
+ | |- | ||
+ | |<span class="plainlinks">[https://festival-solver.site/curry/ Curry]</span> || 0.3 || Yaron Shoham || 64bit || 1 thread || <span class="plainlinks">[https://festival-solver.site/curry/ Curry 0.3] || <span class="plainlinks">[https://festival-solver.site/curry/ Website with paper about the solver]</span> | ||
+ | |- | ||
+ | |<span class="plainlinks">[https://sourceforge.net/projects/sokobanyasc/files/sokobanyasc/ YASS]</span> || 2.151 || Brian Damgaard || 32bit || 1 thread || <span class="plainlinks">[https://sourceforge.net/projects/sokobanyasc/files/sokobanyasc/ YASS 2.151]</span> || <span class="plainlinks">[[Sokoban solver "scribbles" by Brian Damgaard about the YASS solver | Sokoban solver "scribbles" by Brian Damgaard]]</span> | ||
+ | |- | ||
+ | |<span class="plainlinks">[https://www.sokoban-online.de/ JSoko]</span> || 2.04 || Matthias Meger || 64bit || 1 thread || <span class="plainlinks">[https://sourceforge.net/projects/jsokoapplet/files/JSoko/Version%202.03/ JSoko 2.04]</span> || [[Solver | Solver information]] | ||
+ | |- | ||
+ | |<span class="plainlinks">[https://webdocs.cs.ualberta.ca/~games/Sokoban/program.html Rolling Stone]</span> || 1.0 || Andreas Junghanns || 32bit || 1 thread || <span class="plainlinks">[https://webdocs.cs.ualberta.ca/~games/Sokoban/Src/ RS] || <span class="plainlinks">[https://scholar.google.com/scholar?hl=de&as_sdt=0%2C5&q=rolling+stone+sokoban&btnG= Rolling Stone papers]</span> | ||
+ | |} | ||
+ | |||
+ | Contact: SokobanoWiki@gmail.com | ||
== XSokoban Test Suite == | == XSokoban Test Suite == | ||
Line 21: | Line 48: | ||
{| class="soko-table" | {| class="soko-table" | ||
|- | |- | ||
- | ! colspan=" | + | ! colspan="11" | Sokoban Solver Statistics - XSokoban Test Suite - Solved Levels |
<!-- Header --> | <!-- Header --> | ||
Line 28: | Line 55: | ||
| width="160" | Author | | width="160" | Author | ||
| width=" 70" | Levels | | width=" 70" | Levels | ||
- | | width= " | + | | width= "90" | <span class="plainlinks">[https://www.researchgate.net/publication/2305703_Pushing_the_Limits_New_Developments_in_Single-Agent_Search Rolling Stone]</span> |
- | + | | width= "80" | <span class="plainlinks">[https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]</span> | |
- | | width= "80" | <span class="plainlinks">[ | + | |
| width=" 80" | <span class="plainlinks">[https://sourceforge.net/projects/sokobanyasc/ YASS]</span> | | width=" 80" | <span class="plainlinks">[https://sourceforge.net/projects/sokobanyasc/ YASS]</span> | ||
| width=" 80" | [[JSoko Solver | JSoko]] | | width=" 80" | [[JSoko Solver | JSoko]] | ||
- | | width=" 80" | <span class="plainlinks">[http:// | + | | width=" 80" | <span class="plainlinks">[http://sokolution.infinityfreeapp.com/ Sokolution ]</span> |
+ | | width=" 80" | <span class="plainlinks">[https://festival-solver.site/curry/ Curry ]</span> | ||
+ | | width=" 80" | <span class="plainlinks">[https://festival-solver.site/ Festival ]</span> | ||
- | <!-- ---------------------------------------------------------------------------------------------- --> | + | <!-- -------------------------------------------------------------------------------------------------------- --> |
- | <!-- XSokoban. "Collection, author, levels, | + | <!-- XSokoban. "Collection, author, levels, Rolling Stone, Takaken, YASS, JSoko, Sokolution, Festival" --> |
- | <!-- ---------------------------------------------------------------------------------------------- --> | + | <!-- -------------------------------------------------------------------------------------------------------- --> |
|- align="right" | |- align="right" | ||
- | | align="left" bgcolor="#f1efe5" | [ | + | | align="left" bgcolor="#f1efe5" | <span class="plainlinks">[https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/ XSokoban]</span> |
| align="left" | Thinking Rabbit, ... | | align="left" | Thinking Rabbit, ... | ||
| 90 | | 90 | ||
- | | <span class="plainlinks">[https://webdocs.cs.ualberta.ca/~games/Sokoban/program.html | + | | <span class="plainlinks">[https://webdocs.cs.ualberta.ca/~games/Sokoban/program.html 59*]</span> |
- | | | + | | <span class="plainlinks">[https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Takaken%20-%20XSokoban.html '''90''']</span> |
- | + | | <span class="plainlinks">[https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/YASS%20-%20XSokoban.html 89]</span> | |
- | | [ | + | |
| [[SolverStatistics-jsoko-ThinkingRabbit-XSokoban | 67 ]] | | [[SolverStatistics-jsoko-ThinkingRabbit-XSokoban | 67 ]] | ||
- | | [ | + | | <span class="plainlinks">[https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Sokolution%20-%20XSokoban.html '''90''']</span> |
+ | | <span class="plainlinks">[https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Curry%20-%20XSokoban.html '''90''']</span> | ||
+ | | <span class="plainlinks">[https://sokoban-solver-statistics.sourceforge.io/statistics/XSokoban/Festival%20-%20XSokoban.html '''90''']</span> | ||
|} | |} | ||
+ | |||
+ | *) 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" | {| class="soko-table" | ||
Line 60: | Line 91: | ||
| width="160" | Author | | width="160" | Author | ||
| width=" 70" | Levels | | width=" 70" | Levels | ||
- | | width=" 80" | <span class="plainlinks">[https://www.researchgate.net/publication/2305703_Pushing_the_Limits_New_Developments_in_Single-Agent_Search | + | | width=" 80" | <span class="plainlinks">[https://www.researchgate.net/publication/2305703_Pushing_the_Limits_New_Developments_in_Single-Agent_Search Rolling Stone]</span> |
| width=" 80" | <span class="plainlinks">[http://www.ijcai.org/Abstract/16/100 Pereira et al.]</span> | | width=" 80" | <span class="plainlinks">[http://www.ijcai.org/Abstract/16/100 Pereira et al.]</span> | ||
| width=" 80" | <span class="plainlinks">[http://sourceforge.net/projects/jsokoapplet/ JSoko]</span> | | width=" 80" | <span class="plainlinks">[http://sourceforge.net/projects/jsokoapplet/ JSoko]</span> | ||
- | | width=" 80" | <span class="plainlinks">[http:// | + | | width=" 80" | <span class="plainlinks">[http://sokolution.infinityfreeapp.com/ Sokolution ]</span> |
<!-- -------------------------------------------------------------------------------------------- --> | <!-- -------------------------------------------------------------------------------------------- --> | ||
Line 73: | Line 104: | ||
| [[SolverStatistics-Pereira-ThinkingRabbit-XSokoban-Push-Optimal | 28 ]] | | [[SolverStatistics-Pereira-ThinkingRabbit-XSokoban-Push-Optimal | 28 ]] | ||
| <span class="plainlinks">[https://www.sokoban-online.de/jsoko/solver-statistics/ 31 ]</span> | | <span class="plainlinks">[https://www.sokoban-online.de/jsoko/solver-statistics/ 31 ]</span> | ||
- | | [[SolverStatistics-Sokolutionv4.0-ThinkingRabbit-XSokoban-Push-Optimal | ''' | + | | [[SolverStatistics-Sokolutionv4.0-ThinkingRabbit-XSokoban-Push-Optimal | '''59''' ]] |
|} | |} | ||
+ | |||
+ | The statistic shows that Sokolution is by far the best solver when searching for push optimal solutions. | ||
== Large Test Suite == | == Large Test Suite == | ||
Line 81: | Line 114: | ||
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. | 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 | + | 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" | {| class="soko-table" | ||
|- | |- | ||
- | ! colspan=" | + | ! colspan="6" | Sokoban Solver Statistics - Large Test Suite - Solved levels |
<!-- Header --> | <!-- Header --> | ||
|- bgcolor="#f1efe5" align="center" | |- bgcolor="#f1efe5" align="center" | ||
- | | width="115" align="left" | | + | | width="115" align="left" | |
- | | width=" | + | | width=" 70" | Levels |
- | | width=" | + | | width= "80" | <span class="plainlinks">[https://festival-solver.site/ Festival ]</span> |
- | | width=" 80" | | + | | width=" 80" | <span class="plainlinks">[http://sokolution.infinityfreeapp.com/ Sokolution]</span> |
- | | width= "80" | <span class="plainlinks">[ | + | | width=" 80" | <span class="plainlinks">[https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]</span> |
| width=" 80" | <span class="plainlinks">[https://sourceforge.net/projects/sokobanyasc/ YASS]</span> | | width=" 80" | <span class="plainlinks">[https://sourceforge.net/projects/sokobanyasc/ YASS]</span> | ||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
|- bgcolor="#f1efe5" align="right" | |- bgcolor="#f1efe5" align="right" | ||
- | | align="left" | Total | + | | align="left" | Total levels |
- | + | ||
| 3272 <!-- Total levels --> | | 3272 <!-- Total levels --> | ||
- | | | + | | '''3205''' <!-- Festival --> |
- | | | + | | 3172 <!-- Sokolution --> |
- | | | + | | 2953 <!-- Takaken --> |
- | | | + | | 2891 <!-- YASS --> |
- | + | ||
|} | |} | ||
- | + | '''[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]. | |
- | The statistics shows the results for the leading Sokoban solvers for various level | + | == 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" | {| class="soko-table" | ||
|- | |- | ||
- | ! colspan=" | + | ! colspan="6" | Sokoban Solver Statistics - Open Test Suite - Solved levels |
<!-- Header --> | <!-- Header --> | ||
|- bgcolor="#f1efe5" align="center" | |- bgcolor="#f1efe5" align="center" | ||
- | | width="115" align="left" | | + | | width="115" align="left" | |
- | | width=" | + | | width=" 70" | Levels |
- | | width=" | + | | width= "80" | <span class="plainlinks">[https://festival-solver.site/ Festival]</span> |
- | | width=" 80" | | + | | width=" 80" | <span class="plainlinks">[http://sokolution.infinityfreeapp.com/ Sokolution]</span> |
- | | width= "80" | <span class="plainlinks">[ | + | | width=" 80" | <span class="plainlinks">[https://computerpuzzle.net/english/sokoban/ver740/index.html Takaken]</span> |
| width=" 80" | <span class="plainlinks">[https://sourceforge.net/projects/sokobanyasc/ YASS]</span> | | width=" 80" | <span class="plainlinks">[https://sourceforge.net/projects/sokobanyasc/ YASS]</span> | ||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
|- bgcolor="#f1efe5" align="right" | |- bgcolor="#f1efe5" align="right" | ||
- | | align="left" | Total | + | | align="left" | Total levels |
- | | | + | | 10773 <!-- Total levels --> |
- | + | | '''9950''' <!-- Festival --> | |
- | | | + | | 9694 <!-- Sokolution --> |
- | | | + | | 8919 <!-- Takaken --> |
- | | | + | | 8485 <!-- YASS --> |
- | | | + | |
- | + | ||
|} | |} | ||
+ | |||
+ | '''[https://sokoban-solver-statistics.sourceforge.io/statistics/OpenTestSuite/ Click here to see the detailed results for the Open Test Suite].''' | ||
== GroupEffort Test Suite == | == GroupEffort Test Suite == | ||
- | The only reason for benchmarking the GroupEffort test suite is to | + | 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. | 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. | ||
Line 781: | Line 182: | ||
{| class="soko-table" | {| class="soko-table" | ||
|- | |- | ||
- | ! colspan=" | + | ! colspan="8" | Sokoban Solver Statistics - GroupEffort Test Suite - Solved Levels |
<!-- -------------------------------------------------------------------------------------------- --> | <!-- -------------------------------------------------------------------------------------------- --> | ||
Line 789: | Line 190: | ||
| width = "115" align="left" | Collection | | width = "115" align="left" | Collection | ||
| width = "80" | Levels | | width = "80" | Levels | ||
- | | width = "80" | [https://baldur.iti.kit.edu/theses/SokobanPortfolio.pdf GroupEffort] | + | | width = "80" | <span class="plainlinks">[https://baldur.iti.kit.edu/theses/SokobanPortfolio.pdf GroupEffort]</span> |
- | | width = "80" | [ | + | | width = "80" | <span class="plainlinks">[https://festival-solver.site/ Festival]</span> |
- | | width = "80" | [http://www.ic-net.or.jp/home/takaken/e/soko/index.html Takaken] | + | | width = "80" | <span class="plainlinks">[http://sokolution.infinityfreeapp.com/ Sokolution]</span> |
- | | width = "80" | [https://sourceforge.net/projects/jsokoapplet/ JSoko] | + | | width = "80" | <span class="plainlinks">[http://www.ic-net.or.jp/home/takaken/e/soko/index.html Takaken]</span> |
- | | width = "80" | [https://sourceforge.net/projects/sokobanyasc/ YASS] | + | | width = "80" | <span class="plainlinks">[https://sourceforge.net/projects/jsokoapplet/ JSoko]</span> |
+ | | width = "80" | <span class="plainlinks">[https://sourceforge.net/projects/sokobanyasc/ YASS]</span> | ||
<!-- -------------------------------------------------------------------------------------------- --> | <!-- -------------------------------------------------------------------------------------------- --> | ||
Line 802: | Line 204: | ||
| 200 | | 200 | ||
| 196 (a)(c) | | 196 (a)(c) | ||
+ | | [[SolverStatistics-Festival-GroupEffort-Small-Set | '''200''' (b) ]] | ||
| [[SolverStatistics-Sokolution-GroupEffort-Small-Set | '''200''' (a) ]] | | [[SolverStatistics-Sokolution-GroupEffort-Small-Set | '''200''' (a) ]] | ||
| [[SolverStatistics-Takaken-GroupEffort-Small-Set | 192 (b) ]] | | [[SolverStatistics-Takaken-GroupEffort-Small-Set | 192 (b) ]] | ||
Line 814: | Line 217: | ||
| 2851 | | 2851 | ||
| 1566 (a)(c) | | 1566 (a)(c) | ||
- | | [[SolverStatistics- | + | | [[SolverStatistics-Festival-GroupEffort-Large-Set | '''2766''' (b) ]] |
+ | | [[SolverStatistics-Sokolution-GroupEffort-Large-Set | 2471 (a) ]] | ||
| [[SolverStatistics-Takaken-GroupEffort-Large-Set | 2462 (b) ]] | | [[SolverStatistics-Takaken-GroupEffort-Large-Set | 2462 (b) ]] | ||
| [[SolverStatistics-JSoko-GroupEffort-Large-Set | 2165 (b) ]] | | [[SolverStatistics-JSoko-GroupEffort-Large-Set | 2165 (b) ]] | ||
Line 826: | Line 230: | ||
| 3051 <!-- Total levels --> | | 3051 <!-- Total levels --> | ||
| 1762 <!-- Group Effort --> | | 1762 <!-- Group Effort --> | ||
- | | ''' | + | | '''2966''' <!-- Festival --> |
+ | | 2671 <!-- Sokolution --> | ||
| 2654 <!-- Takaken --> | | 2654 <!-- Takaken --> | ||
| 2345 <!-- JSoko --> | | 2345 <!-- JSoko --> | ||
| 2471 <!-- YASS --> | | 2471 <!-- YASS --> | ||
- | |||
|} | |} | ||
Line 897: | Line 301: | ||
E-mail: yoshio@asahi.email.ne.jp | E-mail: yoshio@asahi.email.ne.jp | ||
Web Site: http://www.ne.jp/asahi/ai/yoshio/sokoban/index.html | Web Site: http://www.ne.jp/asahi/ai/yoshio/sokoban/index.html | ||
- | |||
- | |||
- | |||
- | |||
- | |||
<br> | <br> | ||
JSoko | JSoko | ||
Copyright (C) by Matthias Meger | Copyright (C) by Matthias Meger | ||
- | E-mail: JSoko@ | + | E-mail: JSoko@mail.de |
- | Web site: | + | Web site: https://www.sokoban-online.de |
<br> | <br> | ||
Sokoban Automatic Solver (aka Takaken solver) | Sokoban Automatic Solver (aka Takaken solver) | ||
Copyright (C) 2002 - 200X Ken'ichiro Takahashi (aka takaken) | Copyright (C) 2002 - 200X Ken'ichiro Takahashi (aka takaken) | ||
E-mail: takaken@ic-net.or.jp | E-mail: takaken@ic-net.or.jp | ||
- | Web site: | + | Web site: https://computerpuzzle.net/english/sokoban/ver740/index.html |
<br> | <br> | ||
YASS - Yet Another Sokoban Solver and Optimizer - For Small Levels | YASS - Yet Another Sokoban Solver and Optimizer - For Small Levels | ||
Copyright (C) 2007 by Brian Damgaard | Copyright (C) 2007 by Brian Damgaard | ||
- | + | Web site: https://sourceforge.net/projects/sokobanyasc/ | |
- | Web site: | + | |
<br> | <br> | ||
Sokoban YASC | Sokoban YASC | ||
- | Copyright (C) 2001- | + | Copyright (C) 2001-2020 by Brian Damgaard |
- | + | ||
Web Site: https://sourceforge.net/projects/sokobanyasc/ | Web Site: https://sourceforge.net/projects/sokobanyasc/ | ||
<br> | <br> | ||
Line 941: | Line 338: | ||
Copyright (C) 2016-2019 by Florent DIEDLER | Copyright (C) 2016-2019 by Florent DIEDLER | ||
E-mail: fdiedler2000@gmail.com | E-mail: fdiedler2000@gmail.com | ||
- | Web site: http:// | + | Web site: http://sokolution.infinityfreeapp.com/ |
+ | <br> | ||
+ | Festival | ||
+ | Copyright (C) 2020 by Yaron Shoham | ||
+ | Web site: https://festival-solver.site/ | ||
<br> | <br> | ||
Trademarks | Trademarks | ||
Line 952: | Line 353: | ||
======= | ======= | ||
<br> | <br> | ||
- | E-mail: | + | E-mail: sokobanowiki@gmail.com |
Current revision as of 18:40, 8 October 2024
A Sokoban solver program is a program that tries to solve Sokoban levels. There are several solver programs available. (See 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 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.
Contents |
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.
Solver | Version | Author | Architecture | CPU usage | Source code available | More info |
---|---|---|---|---|---|---|
Festival | 3.1 | Yaron Shoham | 64bit | 8 threads | Festival 3.1 | Website with papers about the solver |
Sokolution | 6.33 | Florent Diedler | 64bit | all threads | no | Sokoban solver "scribbles" by Florent Diedler |
Takaken | 7.4 | Ken'ichiro Takahashi (takaken) | 64bit | 2 threads | no | Description of the used algorithms |
Curry | 0.3 | Yaron Shoham | 64bit | 1 thread | Curry 0.3 | Website with paper about the solver |
YASS | 2.151 | Brian Damgaard | 32bit | 1 thread | YASS 2.151 | Sokoban solver "scribbles" by Brian Damgaard |
JSoko | 2.04 | Matthias Meger | 64bit | 1 thread | JSoko 2.04 | Solver information |
Rolling Stone | 1.0 | Andreas Junghanns | 32bit | 1 thread | RS | 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.
Sokoban Solver Statistics - XSokoban Test Suite - Solved Levels | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|
Collection | Author | Levels | Rolling Stone | Takaken | YASS | JSoko | Sokolution | Curry | Festival | |
XSokoban | Thinking Rabbit, ... | 90 | 59* | 90 | 89 | 67 | 90 | 90 | 90 |
- ) 59 solved puzzles according to paper Sokoban Enhancing general single-agent search methods using domain knowledge
Sokoban Solver Statistics - XSokoban Test Suite - Push-optimal Solutions | ||||||
---|---|---|---|---|---|---|
Collection | Author | Levels | Rolling Stone | Pereira et al. | JSoko | Sokolution |
XSokoban | Thinking Rabbit, ... | 90 | 6 | 28 | 31 | 59 |
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.
Sokoban Solver Statistics - Large Test Suite - Solved levels | |||||
---|---|---|---|---|---|
Levels | Festival | Sokolution | Takaken | YASS | |
Total levels | 3272 | 3205 | 3172 | 2953 | 2891 |
Click here to see the detailed results for the Large Test Suite.
Download the entire test suite here or the individual level sets from 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.
Sokoban Solver Statistics - Open Test Suite - Solved levels | |||||
---|---|---|---|---|---|
Levels | Festival | Sokolution | Takaken | YASS | |
Total levels | 10773 | 9950 | 9694 | 8919 | 8485 |
Click here to see the detailed results for the Open 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.
Sokoban Solver Statistics - GroupEffort Test Suite - Solved Levels | |||||||
---|---|---|---|---|---|---|---|
Collection | Levels | GroupEffort | Festival | Sokolution | Takaken | JSoko | YASS |
Small Set | 200 | 196 (a)(c) | 200 (b) | 200 (a) | 192 (b) | 180 (b) | 191 (b) |
Large Set | 2851 | 1566 (a)(c) | 2766 (b) | 2471 (a) | 2462 (b) | 2165 (b) | 2260 (b) |
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://www.sokoban-online.de
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