Sciweavers

ICGA
2006
312views Optimization» more  ICGA 2006»
16 years 9 months ago
New Approximate Strategies for Playing Sum Games based on Subgame Types
In this work we investigate the potential of combining AI tree-search algorithms with the algorithms of combinatorial game theory to provide more efficient strategies for playing s...
Manal Zaky, Cherif Salama, Salma Ghoneim
ICGA
2006
161views Optimization» more  ICGA 2006»
14 years 9 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
128views Optimization» more  ICGA 2006»
14 years 9 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
2006
97views Optimization» more  ICGA 2006»
14 years 9 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
Optimization
Top of PageReset Settings