Direction-Optimizing Breadth-First Search with External Memory Storage

While computing resources have continued to grow, methods for building and using large heuristics have not seen significant advances in recent years. We have observed that directionoptimizing breadth-first search, developed for and used broadly in the Graph 500 competition, can also be applied for building heuristics. But, the algorithm cannot run efficiently using external memory – when the heuristics being built are larger than RAM. This paper shows how to modify directionoptimizing breadth-first search to build externalmemory heuristics. We show that the new approach is not effective in state spaces with low asymptotic branching factors, but in other domains we are able to achieve up to a 3x reducing in runtime when building an external-memory heuristic. The approach is then used to build a 2.6TiB Rubik’s Cube heuristic with 5.8 trillion entries, the largest pattern database heuristic ever built.

[1]  Marco Aiello,et al.  AAAI Conference on Artificial Intelligence , 2011, AAAI Conference on Artificial Intelligence.

[2]  Richard E. Korf,et al.  Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem , 2007, IJCAI.

[3]  Richard E. Korf Minimizing Disk I/O in Two-Bit Breadth-First Search , 2008, AAAI.

[4]  Christian Borgelt,et al.  Computational Intelligence , 2016, Texts in Computer Science.

[5]  Frank Ruskey,et al.  Ranking and unranking permutations in linear time , 2001, Inf. Process. Lett..

[6]  Richard E. Korf,et al.  Time complexity of iterative-deepening-A* , 2001, Artif. Intell..

[7]  Mark H. M. Winands,et al.  Best Reply Search for Multiplayer Games , 2011, IEEE Transactions on Computational Intelligence and AI in Games.

[8]  Richard E. Korf,et al.  Best-First Frontier Search with Delayed Duplicate Detection , 2004, AAAI.

[9]  Jose M. Such,et al.  International Joint Conference on Artificial Intelligence (IJCAI) , 2016 .

[10]  David A. Patterson,et al.  Direction-optimizing Breadth-First Search , 2012, 2012 International Conference for High Performance Computing, Networking, Storage and Analysis.

[11]  J. van Leeuwen,et al.  Computers and Games , 1999, Lecture Notes in Computer Science.

[12]  Graham Kendall,et al.  Editorial: IEEE Transactions on Computational Intelligence and AI in Games , 2015, IEEE Trans. Comput. Intell. AI Games.