Corpus ID: 11698010

All-Moves-As-First Heuristics in Monte-Carlo Go

@inproceedings{Helmbold2009AllMovesAsFirstHI,
  title={All-Moves-As-First Heuristics in Monte-Carlo Go},
  author={D. Helmbold and Aleatha Parker-Wood},
  booktitle={IC-AI},
  year={2009}
}
  • D. Helmbold, Aleatha Parker-Wood
  • Published in IC-AI 2009
  • Computer Science
  • We present and explore the effectiveness of sev- eral variations on the All-Moves-As-First (AMAF) heuristic in Monte-Carlo Go. [...] Key Result Updates even more aggressive than AMAF can be even more beneficial.Expand Abstract
    54 Citations

    Figures and Topics from this paper.

    Monte-Carlo Tree Search for
    • 30
    • PDF
    Monte-Carlo Tree Search for Poly-Y
    Learning non-random moves for playing Othello: Improving Monte Carlo Tree Search
    • 18
    • PDF
    A Survey of Monte Carlo Tree Search Methods
    • 1,656
    • PDF
    Monte-Carlo Search Algorithms
    Convex Regularization in Monte-Carlo Tree Search
    Reducing variance in MCTS using bootstrap method

    References

    SHOWING 1-9 OF 9 REFERENCES
    Bandit Based Monte-Carlo Planning
    • 2,270
    • PDF
    Monte Carlo Go
    • Bernd Brügmann Max-Planck
    • 1993
    • 130
    • PDF
    Computer Go: A Grand Challenge to AI
    • 21
    Finite-time Analysis of the Multiarmed Bandit Problem
    • 4,222
    • PDF
    Combining online and offline knowledge in UCT
    • 514
    • PDF
    Independent study quarterly reports
    • http://users.soe.ucsc.edu/ ̃charlie/projects/SlugGo/,
    • 2008
    Independent study quarterly reports. http://users.soe.ucsc.edu/˜charlie/projects/SlugGo
    • Independent study quarterly reports. http://users.soe.ucsc.edu/˜charlie/projects/SlugGo
    • 2008
    Library of effective go routines (libEGO)
    • Library of effective go routines (libEGO)
    • 2009