Improved Heuristic and Tie-Breaking for Optimally Solving Sokoban

IJCAI, pp. 662-668, 2016.

Cited by: 2|Bibtex|Views49
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com

Abstract:

We present a novel admissible pattern database heuristic (D) and tie-breaking rule (L) for Sokoban, allowing us to increase the number of optimally solved standard Sokoban instances from 20 to 28 and the number of proved optimal solutions from 25 to 32 compared to previous methods. The previously best heuristic for Sokoban (I) used the id...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments