Pruning algorithms for multi-model adversary search

DOI10.1016/S0004-3702(97)00074-XMaRDI QIDQ1128651zbMATH OpenFDO

Authors David Carmel, S. Markovitch

Publication date 13 August 1998

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0004-3702(97)00074-X

zbMATH Keywords

adversary searchopponent modelingpruning

Mathematics Subject Classification ID

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

Recommendations

• Multi-player alpha-beta pruning
• Multi-cut -pruning in game-tree search
• scientific article; zbMATH DE number 4162309
• Probabilistic opponent-model search
• Strategies anticipating a difference in search depth using opponent-model search

Cites work

• An analysis of alpha-beta pruning
• Depth-first iterative-deepening: An optimal admissible tree search
• scientific article; zbMATH DE number 4162309 (Why is no real title available?)
• scientific article; zbMATH DE number 48544 (Why is no real title available?)
• scientific article; zbMATH DE number 67443 (Why is no real title available?)
• scientific article; zbMATH DE number 3063363 (Why is no real title available?)
• Multi-player alpha-beta pruning

Cited in

(9)

• Limitations of learning in automata-based systems
• Strategies anticipating a difference in search depth using opponent-model search
• Multi-cut -pruning in game-tree search
• Probabilistic opponent-model search
• Special issue: Heuristic search and computer game playing
• Modeling emotions and reason in agent-based systems
• Automatic move pruning for single-agent search
• Multi-player alpha-beta pruning
• Selecting evaluation functions in opponent-model search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1128651)