Pachi: State of the Art Open Source Go Program
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10108598" target="_blank" >RIV/00216208:11320/12:10108598 - isvavai.cz</a>
Result on the web
<a href="http://pasky.or.cz/go/pachi-tr.pdf" target="_blank" >http://pasky.or.cz/go/pachi-tr.pdf</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-31866-5_3" target="_blank" >10.1007/978-3-642-31866-5_3</a>
Alternative languages
Result language
angličtina
Original language name
Pachi: State of the Art Open Source Go Program
Original language description
We present a state of the art implementation of the Monte Carlo Tree Search algorithm for the game of Go. Our "Pachi" software is currently one of the strongest open source Go programs, competing at the top level with other programs and playing evenly against advanced human players. We describe our implementation and choice of published algorithms as well as some notable original improvements: an adaptive time control algorithm, dynamic komi, and usage of the criticality statistic. We also present new methods to achieve efficient scaling both in terms of multiple threads and multiple machines in a cluster.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Lecture Notes in Computer Science
ISSN
0302-9743
e-ISSN
—
Volume of the periodical
7168
Issue of the periodical within the volume
Winter
Country of publishing house
DE - GERMANY
Number of pages
15
Pages from-to
24-38
UT code for WoS article
—
EID of the result in the Scopus database
—