Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information
DOI10.1016/J.ARTINT.2014.08.002zbMATH Open1405.68328OpenAlexW2112361867MaRDI QIDQ464622FDOQ464622
Authors: Edward J. Powley, Peter I. Cowling, Daniel Whitehouse 
Publication date: 27 October 2014
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2014.08.002
Recommendations
machine learninguncertaintyhidden informationgame tree searchinformation reuseMonte Carlo Tree Search (MCTS)
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Decision theory for games (91A35) Games in extensive form (91A18)
Cites Work
- GIB: Imperfect information in a computationally challenging game
- Finite-time analysis of the multiarmed bandit problem
- Checkers is solved
- An analysis of alpha-beta pruning
- Proof-number search
- Monte-Carlo Tree Search Solver
- PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
- Depth-first iterative-deepening: An optimal admissible tree search
- An Analysis of UCT in Multi-player Games
- Search in games with incomplete information: a case study using Bridge card play
- Computational experiments with the RAVE heuristic
- Enhancements for multi-player Monte-Carlo tree search
- Multi-player alpha-beta pruning
Cited In (1)
Uses Software
This page was built for publication: Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464622)
