Investigating the limits of Monte-Carlo tree search methods in computer Go
From MaRDI portal
Recommendations
Cited in
(20)- Global and local game tree search
- Using deep convolutional neural networks in Monte Carlo tree search
- Optimal training for adversarial games
- On Semeai Detection in Monte-Carlo Go
- Efficiency of static knowledge bias in Monte-Carlo tree search
- Analyzing simulations in Monte-Carlo tree search for the game of Go
- Scalability and parallelization of Monte-Carlo tree search
- Score bounded Monte-Carlo tree search
- A Human-Computer Team Experiment for 9x9 Go
- Adaptive playouts for online learning of policies during Monte Carlo tree search
- An analysis for strength improvement of an MCTS-based program playing Chinese dark chess
- Goal threats, temperature, and Monte-Carlo Go
- Monte-Carlo Tree Search Solver
- A Fast Indexing Method for Monte-Carlo Go
- Remarks on history and presence of game tree search and research
- HISTORY AND TERRITORY HEURISTICS FOR MONTE CARLO GO
- PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
- MONTE CARLO GO CAPTURING TACTIC SEARCH
- AI 2005: Advances in Artificial Intelligence
- Computer Go: An AI oriented survey
This page was built for publication: Investigating the limits of Monte-Carlo tree search methods in computer Go
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947906)