Research Challenges in Combinatorial Search

I provide a personal view of some of the major research challenges in the area of combinatorial search. These include solving and playing games with chance, hidden information, and multiple players, optimally solving larger instances of well-known single-agent toy problems, applying search techniques to more realistic problem domains, analyzing the time complexity of heuristic search algorithms, and capitalizing on advances in computing hardware, such as very large external memories and multi-core processors.

[1]  Richard E. Korf,et al.  A Hybrid Recursive Multi-Way Number Partitioning Algorithm , 2011, IJCAI.

[2]  Kenji Yamaguchi,et al.  Complete Solution of the Eight-Puzzle , 1995 .

[3]  D. J. Kleitman,et al.  Elementary Problems: E2564-E2569 , 1975 .

[4]  M. Zeldin.  Heuristics! , 2010 .

[5]  Malte Helmert,et al.  Landmark Heuristics for the Pancake Problem , 2010, SOCS.

[6]  Ariel Felner,et al.  Predicting the Performance of IDA* using Conditional Distributions , 2014, J. Artif. Intell. Res..

[7]  Ira Pohl,et al.  The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving , 1973, IJCAI.

[8]  Richard E. Korf,et al.  Disjoint pattern database heuristics , 2002, Artif. Intell..

[9]  Murray Campbell,et al.  Deep Blue , 2002, Artif. Intell..

[10]  Richard E. Korf,et al.  Finding Optimal Solutions to Rubik's Cube Using Pattern Databases , 1997, AAAI/IAAI.

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

[12]  F. R. A. Hopgood,et al.  Machine Intelligence 3 , 1969, The Mathematical Gazette.

[13]  Jonathan Schaeffer,et al.  Checkers Is Solved , 2007, Science.

[14]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[15]  Richard E. Korf,et al.  Linear-time disk-based implicit graph search , 2008, JACM.

[16]  Richard E. Korf,et al.  Large-Scale Parallel Breadth-First Search , 2005, AAAI.

[17]  Eric A. Hansen,et al.  Structured Duplicate Detection in External-Memory Graph Search , 2004, AAAI.

[18]  Larry S. Davis,et al.  Pattern Databases , 1979, Data Base Design Techniques II.

[19]  Jürg Nievergelt,et al.  The parallel search bench ZRAM and its applications , 1999, Ann. Oper. Res..

[20]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..