×

Monte Carlo go capturing tactic search. (English) Zbl 1152.91310

Summary: This paper is an extended version of the authors’ paper 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.

MSC:

91A05 2-person games
65C05 Monte Carlo methods
68W99 Algorithms in computer science
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DOI: 10.1016/0004-3702(94)90004-3 · Zbl 0801.90145 · doi:10.1016/0004-3702(94)90004-3
[2] T. Cazenave, Computers and Games 2000, LNCS 2063 (Hamamatsu, 2000) pp. 39–54.
[3] Chen K., ICGA Journal 24 pp 203–
[4] Chen K., ICGA Journal 29 pp 183–
[5] DOI: 10.1016/S0020-0255(99)00083-3 · doi:10.1016/S0020-0255(99)00083-3
[6] DOI: 10.1016/0004-3702(75)90019-3 · Zbl 0358.68143 · doi:10.1016/0004-3702(75)90019-3
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.