Selecting evaluation functions in opponent-model search

DOI10.1016/J.TCS.2005.09.049zbMATH Open1086.68120OpenAlexW2075391993MaRDI QIDQ817802FDOQ817802

Authors: H. H. L. M. Donkers, H. J. van den Herik, Jos W. H. M. Uiterwijk 

Publication date: 20 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.049

Recommendations

• Probabilistic opponent-model search
• Strategies anticipating a difference in search depth using opponent-model search
• scientific article; zbMATH DE number 269837
• scientific article; zbMATH DE number 2086386
• A Bayesian approach to relevance in game playing

zbMATH Keywords

searchBaoevaluation functionsopponent models

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Games involving graphs (91A43)

Cites Work

• Title not available (Why is that?)
• Games solved: Now and in the future
• Pruning algorithms for multi-model adversary search
• Strategies anticipating a difference in search depth using opponent-model search
• Probabilistic opponent-model search
• Selecting evaluation functions in opponent-model search

Cited In (7)

• Strategies anticipating a difference in search depth using opponent-model search
• Probabilistic opponent-model search
• Title not available (Why is that?)
• Limitations of learning in automata-based systems
• Logic and social cognition. The facts matter, and so do computational models
• The Use of Opposition for Decreasing Function Evaluations in Population-Based Search
• Selecting evaluation functions in opponent-model search

This page was built for publication: Selecting evaluation functions in opponent-model search

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