Using Partitions and Superstrings for Lossless Compression of Pattern Databases

AAAI Publications, Twenty-Fifth AAAI Conference on Artificial Intelligence

Ethan L. Schreiber, Richard E. Korf

Last modified: 2011-08-04

Abstract

We present an algorithm for compressing pattern databases (PDBs) and a method for fast random access of these com-pressed PDBs. We demonstrate the effectiveness of our technique by compressing two 6-tile sliding-tile PDBs by a factor of 12 and a 7-tile sliding-tile PDB by a factor of 24.

Full Text: PDF