Optimal Sokoban solving using pattern databases with specific domain knowledge

DOI10.1016/J.ARTINT.2015.05.011zbMath1346.68180OpenAlexW812344646MaRDI QIDQ899157

Luciana S. Buriol, Marcus Ritt, André G. C. Pereira

Publication date: 21 December 2015

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2015.05.011

zbMATH Keywords

heuristic searchpattern databasesingle-agent searchSokoban\(\operatorname{A}^\ast\)domain-dependent knowledge

Mathematics Subject Classification ID

Database theory (68P15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

\textsc{Pull} and \textsc{PushPull} are PSPACE-complete ⋮ Landmark-based approaches for goal recognition as planning

Uses Software

• Blossom V

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Blossom V: A new implementation of a minimum cost perfect matching algorithm
• Depth-first iterative-deepening: An optimal admissible tree search
• Landmark-enhanced abstraction heuristics
• Maximizing over multiple pattern databases speeds up heuristic search
• Implicit Abstraction Heuristics
• Sokoban: Enhancing general single-agent search methods using domain knowledge
• Disjoint pattern database heuristics

This page was built for publication: Optimal Sokoban solving using pattern databases with specific domain knowledge