On variable dependencies and compressed pattern databases

Malte Helmert, Nathan R. Sturtevant, Ariel Felner

Research output: Contribution to conferencePaperpeer-review

1 Scopus citations


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’s Cube, and TopSpin. Min-compression is a generally applicable technique for augmenting pattern database heuristics that has led to marked experimental improvements in some settings, while being ineffective in others. We provide a theoretical explanation for these experimental phenomena by studying the interaction between the ranking function used to order abstract states in a pattern database, the compression scheme used to abstract states, and the dependencies between state variables in the problem representation.

Original languageEnglish
Number of pages5
StatePublished - 1 Jan 2017
Event10th Annual Symposium on Combinatorial Search, SoCS 2017 - Pittsburgh, United States
Duration: 16 Jun 201717 Jun 2017


Conference10th Annual Symposium on Combinatorial Search, SoCS 2017
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Computer Networks and Communications


Dive into the research topics of 'On variable dependencies and compressed pattern databases'. Together they form a unique fingerprint.

Cite this