Optimal Sokoban solving using pattern databases with specific domain knowledge

, &
Artificial Intelligence 227 (C):52-70 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2015.05.011

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,126

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Sokoban: Enhancing general single-agent search methods using domain knowledge.Andreas Junghanns & Jonathan Schaeffer - 2001 - Artificial Intelligence 129 (1-2):219-251.
Solving infinite-domain CSPs using the patchwork property.Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak & George Osipov - 2023 - Artificial Intelligence 317 (C):103880.
Maximizing over multiple pattern databases speeds up heuristic search.Robert C. Holte, Ariel Felner, Jack Newton, Ram Meshulam & David Furcy - 2006 - Artificial Intelligence 170 (16-17):1123-1136.
Optimal problem-solving search: All-or-none solutions.Herbert A. Simon & Joseph B. Kadane - 1975 - Artificial Intelligence 6 (3):235-247.
Geometry theorem proving by decomposition of quasi-algebraic sets: An application of the ritt-wu principle.Hai-Ping Ko - 1988 - Artificial Intelligence 37 (1-3):95-122.
Andre Valente: Legal Knowledge Engineering; A Modelling Approach.Pepijn R. S. Visser - 1999 - Artificial Intelligence and Law 7 (4):367-375.
An organization of knowledge for problem solving and language comprehension.Chuck Rieger - 1976 - Artificial Intelligence 7 (2):89-127.
Finding optimal derivation strategies in redundant knowledge bases.Russell Greiner - 1991 - Artificial Intelligence 50 (1):95-115.
Solving factored MDPs using non-homogeneous partitions.Kee-Eung Kim & Thomas Dean - 2003 - Artificial Intelligence 147 (1-2):225-251.
Optimal compression of propositional Horn knowledge bases: complexity and approximation.Peter L. Hammer & Alexander Kogan - 1993 - Artificial Intelligence 64 (1):131-145.

Analytics

Added to PP
2020-12-22

Downloads
10 (#1,552,248)

6 months
1 (#1,598,278)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.
Disjoint pattern database heuristics.Richard E. Korf & Ariel Felner - 2002 - Artificial Intelligence 134 (1-2):9-22.
Landmark-enhanced abstraction heuristics.Carmel Domshlak, Michael Katz & Sagi Lefler - 2012 - Artificial Intelligence 189 (C):48-68.

Add more references