Strategies anticipating a difference in search depth using opponent-model search
From MaRDI portal
Publication:1589507
DOI10.1016/S0304-3975(00)00077-3zbMath0954.68059OpenAlexW2035901005MaRDI QIDQ1589507
H. Jaap van den Herik, Hiroyuki Iida, Jos W. H. M. Uiterwijk, XinBo Gao
Publication date: 12 December 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00077-3
Related Items (3)
Computer shogi ⋮ Strategies anticipating a difference in search depth using opponent-model search ⋮ Selecting evaluation functions in opponent-model search
Cites Work
- Game tree searching by min/max approximation
- Pruning algorithms for multi-model adversary search
- Some methods of controlling the tree search in chess programs
- An analysis of alpha-beta pruning
- The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
- Strategies anticipating a difference in search depth using opponent-model search
- Best-first fixed-depth minimax algorithms
This page was built for publication: Strategies anticipating a difference in search depth using opponent-model search