DF-PN in Go: An Application to the One-Eye Problem
DF-PN in Go: An Application to the One-Eye Problem
复制标题
Go 中的 DF-PN：解决独眼问题的应用
DOI：
10.1007/978-0-387-35706-5_9
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
Martin Müller
中科院分区：
文献类型：
--
作者：
Akihiro Kishimoto;Martin Müller
基于证明数和反证数概念的搜索算法在许多游戏中被证明是有效的。本文对深度优先的证明数搜索算法df-pn进行了改进，并将其应用于围棋。我们开发了一个求解器forone-eye问题，一个特殊的情况下，封闭的tsume-Go [生与死]的问题。我们的研究结果表明，这种方法是非常有前途的。
Search algorithms based on the notion of proof and disproof numbers have been shown to be effective in many games. In this paper, we modify the depth-first proof-number search algorithm df-pn, in order to apply it to the game of Go. We develop a solver forone-eye problems, a special case of enclosed tsume-Go [life and death] problems. Our results show that this approach is very promising.