局部UCT算法在围棋死活题上的性能测试

摘要

为了探索UCT算法在局部搜索中的可靠性,文中在改写Fuego的全局UCT搜索算法的基础上,实现了封闭域局部UCT搜索算法,并在64个标准的围棋死活题上进行了测试.初步结果表明,虽然有一小部分死活问题(11个,约17％)还不能正确求解,但封闭域局部UCT算法基本能够较快地(十几秒内)求解出大部分围棋死活测试问题.文中测试对如何改进大棋盘上的UCT算法性能有指导意义.%In order to explore over the reliability of the UCT algorithm in local search, after modifying Fuego's implementation of the global UCT search algorithm, this paper implemented a closed-region local UCT search algorithm and tested it by 64 standard tsume go problems. It presents results show that local UCT search could solve most tsume go problems within reasonable time (about 15 seconds); while a small portion of tsume go problems (11 problems, about 17%) cannot be solved correctly. It tests guidance on how to improve the UCT algorithm performance on the big board.