Arrow Research search
Back to SoCS

SoCS 2017

On Variable Dependencies and Compressed Pattern Databases

Conference Paper Short Papers Algorithms and Complexity · Artificial Intelligence · Automated Planning and Scheduling

Abstract

Pattern databases are among the strongest known heuristics for many classical search benchmarks such as sliding-tile puzzles, the 4-peg Towers of Hanoi puzzles, Rubik

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
International Symposium on Combinatorial Search
Archive span
2010-2024
Indexed papers
598
Paper id
254835638790570277
v2026.09.13