Probabilistic opponent-model search
From MaRDI portal
Publication:1602464
DOI10.1016/S0020-0255(01)00133-5zbMath1002.68780OpenAlexW2052549760MaRDI QIDQ1602464
Jos W. H. M. Uiterwijk, H. H. L. M. Donkers, H. Jaap van den Herik
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)00133-5
Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Experimental studies (91A90)
Related Items
Learning to bid in bridge, A Survey of Opponent Modeling in Adversarial Domains, Selecting evaluation functions in opponent-model search
Cites Work
- Unnamed Item
- Unnamed Item
- The *-minimax search procedure for trees containing chance nodes
- Pruning algorithms for multi-model adversary search
- An analysis of alpha-beta pruning
- The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
- Experiments with the M & N tree-searching program
- Experiments With Some Programs That Search Game Trees