Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ICGA
2007
80views Optimization» more  ICGA 2007»
11 years 6 months ago
Factors Affecting Diminishing Returns for Searching Deeper
The phenomenon of diminishing returns for additional search effort has been observed by several researchers. We study experimentally additional factors which influence the behavio...
Matej Guid, Ivan Bratko
ICGA
2007
89views Optimization» more  ICGA 2007»
11 years 6 months ago
Playing the Right Atari
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...
Tristan Cazenave
ICGA
2007
90views Optimization» more  ICGA 2007»
11 years 6 months ago
Game Over: Black to Play and Draw in Checkers
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 ...
Jonathan Schaeffer
ICGA
2007
102views Optimization» more  ICGA 2007»
11 years 6 months ago
Using Bitboards for Move Generation in Shogi
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...
Reijer Grimbergen
ICGA
2007
85views Optimization» more  ICGA 2007»
11 years 6 months ago
Searching Solitaire in Real Time
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...
Ronald Bjarnason, Prasad Tadepalli, Alan Fern
ICGA
2007
77views Optimization» more  ICGA 2007»
11 years 6 months ago
Fanorona is a Draw
Maarten P. D. Schadd, Mark H. M. Winands, Maurice ...
ICGA
2007
157views Optimization» more  ICGA 2007»
11 years 6 months ago
Computing "Elo Ratings" of Move Patterns in the Game of Go
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...
Rémi Coulom
ICGA
2006
161views Optimization» more  ICGA 2006»
11 years 6 months ago
Is Aesthetics Computable?
In this note, the psychology of aesthetics is briefly discussed and the feasibility of a discrete computational aesthetics model for chess isjustified.
Azlan Iqbal
ICGA
2006
83views Optimization» more  ICGA 2006»
11 years 6 months ago
A Tool for the Direct Assessment of Poker Decisions
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...
Darse Billings, Morgan Kan
books