Disjoint pattern database heuristics
From MaRDI portal
Publication:5958199
DOI10.1016/S0004-3702(01)00092-3zbMath0992.68190WikidataQ126789310 ScholiaQ126789310MaRDI QIDQ5958199
Publication date: 3 March 2002
Published in: Artificial Intelligence (Search for Journal in Brave)
problem solvingheuristic searchfifteen puzzlesingle-agent searchsliding-tile puzzlesheuristic evaluation functionspattern databasesRubik's cubetwenty-four puzzle
Database theory (68P15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (17)
Duality in permutation state spaces and the dual search algorithm ⋮ On the abstraction method for the container relocation problem ⋮ Optimal Sokoban solving using pattern databases with specific domain knowledge ⋮ Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces ⋮ Learning heuristic functions for large state spaces ⋮ Inconsistent heuristics in theory and practice ⋮ Incremental beam search ⋮ Maximizing over multiple pattern databases speeds up heuristic search ⋮ Breadth-first heuristic search ⋮ Predicting optimal solution cost with conditional probabilities ⋮ New methods for proving the impossibility to solve problems through reduction of problem spaces ⋮ Finding optimal solutions to the graph partitioning problem with heuristic search ⋮ Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation ⋮ Fast Directed Model Checking Via Russian Doll Abstraction ⋮ Anytime pack search ⋮ Probably bounded suboptimal heuristic search ⋮ Heuristics as Markov chains
Cites Work
This page was built for publication: Disjoint pattern database heuristics
