http://sokobano.de/wiki/index.php?action=history&feed=atom&title=SolverStatistics-Pereira-ThinkingRabbit-XSokoban-Push-Optimal
SolverStatistics-Pereira-ThinkingRabbit-XSokoban-Push-Optimal - Revision history
2026-04-17T17:49:52Z
Revision history for this page on the wiki
MediaWiki 1.43.6
http://sokobano.de/wiki/index.php?title=SolverStatistics-Pereira-ThinkingRabbit-XSokoban-Push-Optimal&diff=5469&oldid=prev
Briandamgaard: Created page with 'Improved Heuristic and Tie-Breaking for Optimally Solving Sokoban Authors: André G.Pereira, Robert Holte, Jonathan Schaeffer, Luciana S.Buriol, Marcus Ritt URL retrieved 20…'
2016-11-20T15:32:16Z
<p>Created page with 'Improved Heuristic and Tie-Breaking for Optimally Solving Sokoban Authors: André G.Pereira, Robert Holte, Jonathan Schaeffer, Luciana S.Buriol, Marcus Ritt URL retrieved 20…'</p>
<p><b>New page</b></p><div>Improved Heuristic and Tie-Breaking for Optimally Solving Sokoban<br />
<br />
Authors:<br />
André G.Pereira, <br />
Robert Holte, <br />
Jonathan Schaeffer,<br />
Luciana S.Buriol, <br />
Marcus Ritt<br />
<br />
URL retrieved 2016-11-20:<br />
www.ijcai.org/Proceedings/16/Papers/100.pdf<br />
<br />
;Program: Pereira et al.<br />
;RAM: -<br />
;Computer: AMD FX-8150 CPU @ 3.6 GHz, 32 GiB RAM. <br />
;Solving method: Push-optimal solutions<br />
;Time limit: 3600 seconds = 1 hour<br />
;Nodes limit: 20 million (never reached)<br />
<br />
Push-optimal solved levels:<br />
<br />
1<br />
2 <br />
3 <br />
4 <br />
5 <br />
6 <br />
7 <br />
9 <br />
17<br />
21<br />
33<br />
38<br />
43<br />
48<br />
51<br />
53<br />
55<br />
57<br />
60<br />
65<br />
73<br />
78<br />
79<br />
80<br />
81<br />
82<br />
83<br />
84 <br />
<br />
Total: 28</div>
Briandamgaard