MONTE CARLO GO CAPTURING TACTIC SEARCH

Peigang Zhang () and Keh-Hsun Chen ()
Additional contact information
Peigang Zhang: Department of Computer Science, University of North Carolina, Charlotte, Charlotte, NC 28223, USA
Keh-Hsun Chen: Department of Computer Science, University of North Carolina, Charlotte, Charlotte, NC 28223, USA

New Mathematics and Natural Computation (NMNC), 2008, vol. 04, issue 03, 359-367

Abstract: This paper is an extended version of the authors' paper12presented at JCIS 2007. Standard Monte Carlo UCT tree search algorithm is modified and extended to provide an efficient Go capturing problem solver. Experimental results show that this method outperforms traditional tree search methods to solve capturing problems in Go.

Keywords: Computer Go; Monte Carlo tree search; UCT; Go capturing problems (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S1793005708001136
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:nmncxx:v:04:y:2008:i:03:n:s1793005708001136

Ordering information: This journal article can be ordered from

DOI: 10.1142/S1793005708001136

Access Statistics for this article

New Mathematics and Natural Computation (NMNC) is currently edited by Paul P Wang

More articles in New Mathematics and Natural Computation (NMNC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().