Minimizing disk I/O in two-bit breadth-first search

Authors:
Richard E. Korf
Affiliations:
Computer Science Department, University of California, Los Angeles, Los Angeles, CA
Venue:
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Year:
2008

Citing 8
Cited 6

On the diameter of the pancake network

Journal of Algorithms
Frontier search

Journal of the ACM (JACM)
Twenty-six moves suffice for Rubik's cube

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
A comparative analysis of parallel disk-based Methods for enumerating implicit graphs

Proceedings of the 2007 international workshop on Parallel symbolic computation
Large-scale parallel breadth-first search

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Compressed pattern databases

Journal of Artificial Intelligence Research
Recent progress in heuristic search: a case study of the four-peg towers of Hanoi problem

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Delayed duplicate detection: extended abstract

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Linear-time disk-based implicit graph search

Journal of the ACM (JACM)
Perfect hashing for state spaces in BDD representation

KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Strongly solving fox-and-geese on multi-core CPU

KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence
On average and highest number of flips in pancake sorting

Theoretical Computer Science
External memory breadth-first search with delayed duplicate detection on the GPU

MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Minimizing writes in parallel external memory search

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a breadth-first search algorithm, two-bit breadth-first search (TBBFS), which requires only two bits for each state in the problem space. TBBFS can be parallelized in several ways, and can store its data on magnetic disk. Using TBBFS, we perform complete breadth-first searches of the original pancake problem with 14 and 15 pancakes, and the burned pancake problem with 11 and 12 pancakes, determining the diameter of these problem spaces for the first time. We also performed a complete breadth-first search of the subspace of Rubik's Cube determined by the edge cubies.