The phenomenon of diminishing returns for additional search effort has been observed by several researchers. We study experimentally additional factors which influence the behavio...
We experimented a simple yet powerful optimization for Monte-Carlo Go tree search. It consists in dealing appropriately with strings that have two liberties. The heuristic is cont...
In 1989, an effort to solve the game of checkers began. It was naïve because of the daunting size of the search space, 5×1020 positions, and because of computer capabilities of ...
In this paper it will be explained how to use bitboards for move generation in shogi. In chess, bitboards have been used in most strong programs because of the easy representation...
This article presents a new real-time heuristic search method for planning problems with distinct stages. Our multistage nested rollout algorithm allows the user to apply separate...
Abstract. Move patterns are an essential method to incorporate domain knowledge into Go-playing programs. This paper presents a new Bayesian technique for supervised learning of su...