Sciweavers

ICGA
2006
97views Optimization» more  ICGA 2006»
13 years 4 months ago
Computer Analysis of World Chess Champions
Who is the best chess player of all time? Chess players are often interested in this question that has never been answered authoritatively, because it requires comparison between c...
Matej Guid, Ivan Bratko
ICGA
2006
128views Optimization» more  ICGA 2006»
13 years 4 months ago
Never-Ending Moves in Bao
Bao is a member of the large family of mancala games. It is generally considered to be the most complex mancala game with respect to the number of game rules (Townshend, 1986; De ...
Tom Kronenburg, H. H. L. M. Donkers, Alex J. de Vo...
ICGA
2008
113views Optimization» more  ICGA 2008»
13 years 4 months ago
Move Generation with Perfect Hash Functions
We present two new perfect hashing schemes that can be used for efficient bitboard move generation for sliding pieces in chess-like board games without the need to use rotated bit...
Trevor I. Fenner, Mark Levene
ICGA
2008
123views Optimization» more  ICGA 2008»
13 years 4 months ago
A Survey of NP-Complete Puzzles
Single-player games (often called puzzles) have received considerable attention from the scientific community. Consequently, interesting insights into some puzzles, and into the a...
Graham Kendall, Andrew J. Parkes, Kristian Spoerer
ICGA
2008
208views Optimization» more  ICGA 2008»
13 years 4 months ago
Cross-Entropy for Monte-Carlo Tree Search
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
Guillaume Chaslot, Mark H. M. Winands, Istvan Szit...
ICGA
2008
100views Optimization» more  ICGA 2008»
13 years 4 months ago
Learning the Piece Values for Three Chess Variants
A set of experiments for learning the values of chess pieces is described for the popular chess variants Crazyhouse Chess, Suicide Chess, and Atomic Chess. We follow an establishe...
Sacha Droste, Johannes Fürnkranz
ICGA
1993
145views Optimization» more  ICGA 1993»
13 years 5 months ago
Genetic Programming of Minimal Neural Nets Using Occam's Razor
A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each networ...
Byoung-Tak Zhang, Heinz Mühlenbein
ICGA
1993
140views Optimization» more  ICGA 1993»
13 years 5 months ago
Expected Allele Coverage and the Role of Mutation in Genetic Algorithms
It is part of the traditional lore of genetic algorithms that low mutation rates lead to efficient search of the solution space, while high mutation rates result in diffusion of s...
David M. Tate, Alice E. Smith