ICGA
2007
14 years 20 days ago
2007
The phenomenon of diminishing returns for additional search effort has been observed by several researchers. We study experimentally additional factors which influence the behavio...
ICGA
2007
14 years 20 days 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...
ICGA
2007
14 years 20 days 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
2007
14 years 20 days 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
2007
14 years 20 days ago
2007
ICGA
2007
14 years 20 days ago
2007
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...
ICGA
2007
14 years 20 days ago
2007
ICGA
2007
14 years 20 days 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
2006
14 years 22 days ago
2006
In this note, the psychology of aesthetics is briefly discussed and the feasibility of a discrete computational aesthetics model for chess isjustified.
ICGA
2006
14 years 22 days ago
2006
The element of luck permeates every aspect of the game of poker. Random stochastic outcomes introduce a large amount of noise that can make it very difficult to distinguish a good...