We propose an approach for developing efficient search algorithms through genetic
programming. Focusing on the game of chess we evolve entire game-tree search algorithms …

The application of computational intelligence techniques within the vast domain of games
has been increasing at a breathtaking speed. Over the past several years my research …

For fifty years, computer chess has pursued an original goal of Artificial Intelligence, to
produce a chess-engine to compete at the highest level. The goal has arguably been …

In chess, in order to determine the status of chess players and their ranks in classification,
World Chess Federation awards players with titles-provided that they fulfill certain criteria …

We provide two methodologies in the area of computation theory to solve optimal strategies
for games such as Watermelon chess and Go. From experimental results, we find relevance …

Introduction: Quantifying signals in large, sparse datasets is challenging, as noise and
redundant features often obscure informative patterns. Chess middlegames, with their …

ON FORWARD PRUNING IN GAME-TREE SEARCH LIM YEW JIN Page 1 ON FORWARD
PRUNING IN GAME-TREE SEARCH LIM YEW JIN (B.Math., University of Waterloo) A THESIS …

6-man chess solved Page 1 6-man chess solved Article Accepted Version Haworth, GM (2005)
6-man chess solved. ICGA Journal, 28 (3). p. 153. ISSN 1389-6911 Available at https://centaur.reading.ac.uk/4522 …

The chess endgame is increasingly being seen through the lens of, and therefore effectively
defined by, a data 'model'of itself. It is vital that such models are clearly faithful to the reality …

The most popular endgame tables (EGTs) documenting 'DTM'Depth to Mate in chess
endgames are those of Eugene Nalimov but these do not recognise the FIDE 50-move rule …