Optimal Sokoban solving using pattern databases with specific domain knowledge
DOI10.1016/J.ARTINT.2015.05.011zbMATH Open1346.68180OpenAlexW812344646MaRDI QIDQ899157FDOQ899157
Luciana Buriol, Marcus Ritt, André G. 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
Recommendations
heuristic searchSokoban\(\operatorname{A}^\ast\)domain-dependent knowledgepattern databasesingle-agent search
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Database theory (68P15)
Cites Work
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sokoban: Enhancing general single-agent search methods using domain knowledge
- Title not available (Why is that?)
- Depth-first iterative-deepening: An optimal admissible tree search
- Title not available (Why is that?)
- Disjoint pattern database heuristics
- Title not available (Why is that?)
- Maximizing over multiple pattern databases speeds up heuristic search
- Title not available (Why is that?)
- Title not available (Why is that?)
- Implicit Abstraction Heuristics
- Title not available (Why is that?)
- Landmark-enhanced abstraction heuristics
Cited In (4)
Uses Software
This page was built for publication: Optimal Sokoban solving using pattern databases with specific domain knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899157)