Monte Carlo Go Capturing Tactic Search
This paper is an extended version of the authors' paper12 presented 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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 04 (2008)
Issue (Month): 03 ()
|Contact details of provider:|| Web page: http://www.worldscinet.com/nmnc/nmnc.shtml|
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:wsi:nmncxx:v:04:y:2008:i:03:p:359-367. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim)
If references are entirely missing, you can add them using this form.