103
click to vote
ICGA
14 years 12 months ago
2007 
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...
ICGA
14 years 12 months ago
2007 
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...
ICGA
14 years 12 months ago
2007  ICGA
14 years 12 months ago
2007 
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 ...
ICGA
14 years 12 months ago
2007 
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...
|
Optimization