A Bayesian approach to relevance in game playing
DOI10.1016/S0004-3702(97)00059-3zbMATH Open0904.68075OpenAlexW2028295039MaRDI QIDQ1127355FDOQ1127355
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
Recommendations
- The Bayesian search game
- Bayesian learning in repeated games
- scientific article
- Bayesian exploration: incentivizing exploration in Bayesian games
- Bayesian learning in repeated games of incomplete information
- The possibility of Bayesian learning in repeated games
- Bayesian learning in repeated normal form games
- A Bayesian hierarchical model for inferring player strategy types in a number guessing game
- Non-parametric Bayesian inference of strategies in repeated games
utilityBayesian modeldecision theorygame theorygraphical modelrelevancegame treesdirected searchevaluation functiongame tree searchcomputer chessrational searchcomputer game playingcomputer Othellometareasoningutility guided search
Cites Work
- Title not available (Why is that?)
- The Complexity of Enumeration and Reliability Problems
- Title not available (Why is that?)
- Monte-Carlo approximation algorithms for enumeration problems
- Conspiracy numbers for min-max search
- Time bounds for selection
- Best-first minimax search
- Title not available (Why is that?)
- Expected time bounds for selection
- Pathology on game trees revisited, and an alternative to minimaxing
- Experiments With Some Programs That Search Game Trees
- A world-championship-level Othello program
- Game tree searching by min/max approximation
- A pattern classification approach to evaluation function learning
- On the Regularity of a General Method of Summation
Cited In (16)
- The effect of mobility on minimaxing of game trees with random leaf values
- Cross-layer security design for encrypted CPS based on modified security signalling game
- Unifying single-agent and two-player search
- A pattern classification approach to evaluation function learning
- Algorithms – ESA 2004
- Partial order bounding: A new approach to evaluation in game tree search
- Error propagation in game trees
- Probability-based game tree pruning
- Experimental Analysis of the Probability Method
- On Monte-Carlo tree search for deterministic games with alternate moves and complete information
- Improving heuristic mini-max search by supervised learning
- A Game Tree Search by Probability Method
- A Skat Player Based on Monte-Carlo Simulation
- Bargaining with limited computation: Deliberation equilibrium
- Qualitative simulation of temporal concurrent processes using time interval Petri nets
- Selecting evaluation functions in opponent-model search
This page was built for publication: A Bayesian approach to relevance in game playing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127355)
