
- MOVE ORDERING VS HEAVY PLAYOUTS: WHERE SHOULD HEURISTICS BE APPLIED IN MONTE CARLO GO?
- HEURISTICS IN MONTE CARLO GO Peter Drake
- Investigating the Effects of Playout Strength in Monte-Carlo Seth Pellegrino, Peter Drake
- Implementing an opening book in computer Go Jessica Mullins1
- THE LAST-GOOD-REPLY POLICY FOR MONTE-CARLO GO Peter Drake1
- Introduction The classical Asian game of Go is considered a grand
- Computer Go: Enhancing Monte Carlo Tree Search with RAVE Walt Javins, Peter Drake, Yung-Pin Chen LEWIS & CLARK COLLEGE, PORTLAND, OREGON
- The Beta Distribution in the UCB Algorithm Applied to Monte-Carlo Go
- The Proximity Heuristic in Monte Carlo Go Peter Drake, Andrew Pouliot, Niku Schreiner, and Bjorn Vanberg
- TCIAIG-2010-0048 1 Abstract--The dominant paradigm for programs playing the
- Localizing Search Using Covariance Jason Galbraith, Seth Pellegrino, Peter Drake
- Using Human Knowledge to Improve Opening Strategy in Computer Go
- ResultsParallel MCTS Algorithms Root Parallelization
- 154 ICGA Journal LOCALIZING SEARCH IN MONTE-CARLO GO USING STATISTICAL
- The Proximity Heuristic and an Opening Book in Monte Carlo Go Peter Drake, Andrew Pouliot, Niku Schreiner, and Bjorn Vanberg
- PATTERN MATCHING IN THE GAME OF GO Peter Drake1
- Decision Trees for Local Search in Monte Carlo Go Bennett Lohre '12, Samuel Dodson '13, Nick Sylvester '13 and Professor Peter Drake
- A Linear Classifier Outperforms UCT in 9x9 Go N. Sylvester, B. Lohre, S. Dodson, and P. Drake