Research Challenges in Combinatorial Search

AAAI 2012 pp. 2129-2133

doi:10.1609/AAAI.V26I1.8444 /aaai/2012/korf2012aaai-research/

Abstract

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.

PDF AAAI Semantic Scholar

Cite

Text

Korf. "Research Challenges in Combinatorial Search." AAAI Conference on Artificial Intelligence, 2012. doi:10.1609/AAAI.V26I1.8444

Markdown

[Korf. "Research Challenges in Combinatorial Search." AAAI Conference on Artificial Intelligence, 2012.](https://mlanthology.org/aaai/2012/korf2012aaai-research/) doi:10.1609/AAAI.V26I1.8444

BibTeX

@inproceedings{korf2012aaai-research,
  title     = {{Research Challenges in Combinatorial Search}},
  author    = {Korf, Richard E.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2012},
  pages     = {2129-2133},
  doi       = {10.1609/AAAI.V26I1.8444},
  url       = {https://mlanthology.org/aaai/2012/korf2012aaai-research/}
}