A Bayesian approach to relevance in game playing

DOI10.1016/S0004-3702(97)00059-3zbMath0904.68075OpenAlexW2028295039MaRDI QIDQ1127355

Warren D. Smith, Eric B. Baum

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)00059-3

zbMATH Keywords

utilityrelevancegame theorydecision theoryBayesian modelmetareasoninggame tree searchcomputer chessevaluation functiongraphical modelgame treesdirected searchrational searchcomputer game playingcomputer Othelloutility guided search

Mathematics Subject Classification ID

Searching and sorting (68P10) Game theory (91A99) General topics in artificial intelligence (68T01)

Related Items (7)

Partial order bounding: A new approach to evaluation in game tree search ⋮ The effect of mobility on minimaxing of game trees with random leaf values ⋮ Improving heuristic mini-max search by supervised learning ⋮ Bargaining with limited computation: Deliberation equilibrium ⋮ On Monte-Carlo tree search for deterministic games with alternate moves and complete information ⋮ Unifying single-agent and two-player search ⋮ Qualitative simulation of temporal concurrent processes using time interval Petri nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A world-championship-level Othello program
• Game tree searching by min/max approximation
• Conspiracy numbers for min-max search
• A pattern classification approach to evaluation function learning
• Time bounds for selection
• Pathology on game trees revisited, and an alternative to minimaxing
• Best-first minimax search
• Monte-Carlo approximation algorithms for enumeration problems
• The Complexity of Enumeration and Reliability Problems
• Expected time bounds for selection
• Experiments With Some Programs That Search Game Trees
• On the Regularity of a General Method of Summation

This page was built for publication: A Bayesian approach to relevance in game playing