Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information
From MaRDI portal
(Redirected from Publication:464622)
Recommendations
Cites work
- An Analysis of UCT in Multi-player Games
- An analysis of alpha-beta pruning
- Checkers is solved
- Computational experiments with the RAVE heuristic
- Depth-first iterative-deepening: An optimal admissible tree search
- Enhancements for multi-player Monte-Carlo tree search
- Finite-time analysis of the multiarmed bandit problem
- GIB: Imperfect information in a computationally challenging game
- Monte-Carlo Tree Search Solver
- Multi-player alpha-beta pruning
- PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
- Proof-number search
- Search in games with incomplete information: a case study using Bridge card play
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)