The Last-Good-Reply Policy for Monte-Carlo Go
Peter D. Drake · ICGA Journal · 2009
The dominant paradigm for computer-Go players is Monte-Carlo Tree Search (MCTS). This algorithm builds a search tree by playing many simulated games (playouts ). Each playout consists of a sequence of moves within the tree followed by many moves beyo