AAAI Publications, Twenty-Fourth International Conference on Automated Planning and Scheduling

Font Size: 
Symbolic and Explicit Search Hybrid through Perfect Hash Functions — A Case Study in Connect Four
Stefan Edelkamp, Peter Kissmann, Martha Rohte

Last modified: 2014-05-10

Abstract


This work combines recent advances in AI planning under memory limitation, namely bitvector and symbolic search. Bitvector search assumes a bijective mapping between state and memory addresses, while symbolic search compactly represents state sets. The memory requirements vary with the structure of the problem to be solved. The integration of the two algorithms into one hybrid algorithm for strongly solving general games initiates a BDD-based solving algorithm, which consists of a forward computation of the reachable state set, possibly followed by a layered backward retrograde analysis. If the main memory becomes exhausted, it switches to explicit-state two-bit retrograde search. We use the classical game of Connect Four as a case study, and solve some instances of the problem space-efficiently with the proposed hybrid search algorithm.

Keywords


Game Playing, Symbolic Search, Memory-Limited Search, Bitvector Search

Full Text: PDF