SolverStatistics-Pereira-ThinkingRabbit-XSokoban-Push-Optimal
From Sokoban Wiki
(Difference between revisions)
Briandamgaard (Talk | contribs)
(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…')
(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…')
Current revision as of 15:32, 20 November 2016
Improved Heuristic and Tie-Breaking for Optimally Solving Sokoban
Authors: André G.Pereira, Robert Holte, Jonathan Schaeffer, Luciana S.Buriol, Marcus Ritt
URL retrieved 2016-11-20: www.ijcai.org/Proceedings/16/Papers/100.pdf
- Program
- Pereira et al.
- RAM
- -
- Computer
- AMD FX-8150 CPU @ 3.6 GHz, 32 GiB RAM.
- Solving method
- Push-optimal solutions
- Time limit
- 3600 seconds = 1 hour
- Nodes limit
- 20 million (never reached)
Push-optimal solved levels:
1 2 3 4 5 6 7 9 17 21 33 38 43 48 51 53 55 57 60 65 73 78 79 80 81 82 83 84
Total: 28
