Efficient Search Using Bitboard Models

This paper shows a way to speed up search by using an encoding at bit level to model a particular domain. A bitboard is an unsigned integer whose bits have been given an interpretation in the world of discourse. In models encoded in such a way, states will be described internally as a set of bitboard tuples, whilst operators which allow for transitions between states are essentially bitwise operations over elements belonging to that set. Given a 64-bit processor word, for each transition it would be theoretically possible to reach another state 64 times faster than with a normal encoding, fast transitions being one of the main issues for efficient search algorithms. We have analysed some other key issues related to efficient bitboard model design and formalised the concepts of well formed heuristics and bitboard guides. We have used this approach to solve instances of the maximum clique problem thus increasing the performance of one of the fastest algorithms known in the domain for op...

• Type: Conference
• Year: 2006
• Where: ICTAI
• Authors: Pablo San Segundo, Ramón Galán, Fernando Matía, Diego Rodríguez-Losada, Agustín Jiménez
• Keywords: Artificial Intelligence, Bitboard, Bitboard Tuples, Efficient Bitboard Model, ICTAI 2006