A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Common fate graph patterns in Monte Carlo Tree Search for computer go
2014
2014 IEEE Conference on Computational Intelligence and Games
In Monte Carlo Tree Search often extra knowledge in form of patterns is used to guide the search and improve the playouts. Shape patterns, which are frequently used in Computer Go, do not describe tactical situations well, so that this knowledge has to be added manually. This is a tedious process which cannot be avoided as it leads to big improvements in playing strength. The common fate graph, which is a special graphical representation of the board, provides an alternative which handles
doi:10.1109/cig.2014.6932863
dblp:conf/cig/GrafP14
fatcat:47g4oolatncspfsh3ta5vzhdl4