Unifying single-agent and two-player search

DOI10.1016/S0020-0255(01)00134-7zbMath1002.68781OpenAlexW2086585961MaRDI QIDQ1602466

Aske Plaat, A. Junghanns, Jonathan Schaeffer

Publication date: 23 June 2002

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(01)00134-7

zbMATH Keywords

heuristic search

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Linear-space best-first search
• Depth-first iterative-deepening: An optimal admissible tree search
• Conspiracy numbers for min-max search
• A Bayesian approach to relevance in game playing
• Pathology on game trees revisited, and an alternative to minimaxing
• On the nature of pathology in game searching
• \(\text{BIDA}^*\): An improved perimeter search algorithm
• Real-time heuristic search
• A study of complexity transitions on the asymmetric traveling salesman problem
• Best-first fixed-depth minimax algorithms
• Performance of linear-space search algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: Unifying single-agent and two-player search