Tomoyuki Kaneko

Enhancements in Monte Carlo tree search algorithms for biased game trees

2015

Monte Carlo tree search (MCTS) algorithms have been applied to various domains and achieved remarkable success. However, it is relatively unclear what game properties enhance or degrade the performance of MCTS, while the largeness of …

RankNet for evaluation functions of the game of Go

2019 · ICGA Journal

In this paper, we present a new algorithm for learning evaluation functions of the game of Go. Recently AlphaGo Zero and AlphaZero have shown that accurate evaluation functions can be constructed by using deep neural …

Application of Deep-RL with Sample-Efficient Method in Mini-games of StarCraft II

2019

Recently, a key challenge of deep reinforcement learning (Deep-RL) is to handle a large amount of samples and learning time in domains with large state and action space. To remedy these problems, we focus on …