Pruning algorithms for multi-model adversary search

DOI10.1016/S0004-3702(97)00074-XzbMath0896.68033MaRDI QIDQ1128651

David Carmel, Shaul Markovitch

Publication date: 13 August 1998

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

pruningopponent modelingadversary search

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Related Items (6)

Modeling emotions and reason in agent-based systems ⋮ Limitations of learning in automata-based systems ⋮ Strategies anticipating a difference in search depth using opponent-model search ⋮ Probabilistic opponent-model search ⋮ Special issue: Heuristic search and computer game playing ⋮ Selecting evaluation functions in opponent-model search

Cites Work

• Multi-player alpha-beta pruning
• Depth-first iterative-deepening: An optimal admissible tree search
• An analysis of alpha-beta pruning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pruning algorithms for multi-model adversary search