Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information
DOI10.1016/j.artint.2014.08.002zbMath1405.68328OpenAlexW2112361867MaRDI QIDQ464622
Edward J. Powley, Daniel Whitehouse, Peter I. Cowling
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
uncertaintygame tree searchmachine learninghidden informationinformation reuseMonte Carlo Tree Search (MCTS)
Learning and adaptive systems in artificial intelligence (68T05) Games in extensive form (91A18) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Decision theory for games (91A35)
Uses Software
Cites Work
- Unnamed Item
- Multi-player alpha-beta pruning
- Depth-first iterative-deepening: An optimal admissible tree search
- Search in games with incomplete information: a case study using Bridge card play
- An analysis of alpha-beta pruning
- Proof-number search
- Computational Experiments with the RAVE Heuristic
- Enhancements for Multi-Player Monte-Carlo Tree Search
- Checkers Is Solved
- Monte-Carlo Tree Search Solver
- An Analysis of UCT in Multi-player Games
- PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication: Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information
