Disjoint pattern database heuristics

DOI10.1016/S0004-3702(01)00092-3zbMath0992.68190WikidataQ126789310 ScholiaQ126789310MaRDI QIDQ5958199

Richard E. Korf, Ariel Felner

Publication date: 3 March 2002

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

zbMATH Keywords

problem solving; heuristic search; fifteen puzzle; single-agent search; sliding-tile puzzles; heuristic evaluation functions; pattern databases; Rubik's cube; twenty-four puzzle

Mathematics Subject Classification ID

68P15: Database theory

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

Related Items

Fast Directed Model Checking Via Russian Doll Abstraction, On the abstraction method for the container relocation problem, Learning heuristic functions for large state spaces, Inconsistent heuristics in theory and practice, New methods for proving the impossibility to solve problems through reduction of problem spaces, Optimal Sokoban solving using pattern databases with specific domain knowledge, Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces, Predicting optimal solution cost with conditional probabilities, Anytime pack search, Probably bounded suboptimal heuristic search, Heuristics as Markov chains, Duality in permutation state spaces and the dual search algorithm, Incremental beam search, Maximizing over multiple pattern databases speeds up heuristic search, Breadth-first heuristic search, Finding optimal solutions to the graph partitioning problem with heuristic search, Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation

Cites Work

• Unnamed Item
• Unnamed Item
• Depth-first iterative-deepening: An optimal admissible tree search
• Time complexity of iterative-deepening-\(A^{*}\)