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
We address the problem of predicting moves in the board game of Go. We use the relative frequencies of local board patterns observed in game records to generate a ranked list of moves, and then apply the maximum entropy method (MEM) to the list to re-rank the moves. Move prediction is the task of selecting a small number of promising moves from all legal moves, and move prediction output can be used to improve the efficiency of the game tree search. The MEM enables us to make use of multipledoi:10.1109/cig.2007.368097 dblp:conf/cig/ArakiYTT07 fatcat:fn3qqthmfjcoxct4mew7jeqmeu