The grand challenge of computer Go: Monte Carlo tree search and extensions

Full Text: HtmlHtml  PDFPDF Buy this ArticleBuy this Article
Authors: Sylvain Gelly EPC TAO, INRIA Saclay & LRI, Orsay, France
Levente Kocsis MTA SZTAKI, Budapest, Hungary
Marc Schoenauer EPC TAO, INRIA Saclay & LRI, Orsay, France
Michèle Sebag EPC TAO, INRIA Saclay & LRI, Orsay, France
David Silver University College London, London, U.K.
Csaba Szepesvári University of Alberta, Edmonton, Canada
Olivier Teytaud EPC TAO, INRIA Saclay & LRI, Orsay, France
The grand challenge of computer Go: Monte Carlo tree search and extensions Published by ACM 2012 Article
  • Popular
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 128
· Downloads (12 Months): 630
· Downloads (cumulative): 1,455
· Citation Count: 0

Published in:
Cover Image
 
· Magazine
Communications of the ACM CACM Homepage archive
Volume 55 Issue 3, March 2012
Pages 106-113
ACM New York, NY, USA
table of contents doi>10.1145/2093548.2093574

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder