Sciweavers

Share
ML
2000
ACM
126views Machine Learning» more  ML 2000»
8 years 6 months ago
Learning to Play Chess Using Temporal Differences
In this paper we present TDLEAF( ), a variation on the TD( ) algorithm that enables it to be used in conjunction with game-tree search. We present some experiments in which our che...
Jonathan Baxter, Andrew Tridgell, Lex Weaver
CORR
2004
Springer
95views Education» more  CORR 2004»
8 years 6 months ago
A New Approach to Draw Detection by Move Repetition in Computer Chess Programming
: We will try to tackle both the theoretical and practical aspects of a very important problem in chess programming as stated in the title of this article
Vladan Vuckovic, Djordje Vidanovic
CIG
2005
IEEE
8 years 11 months ago
Further Evolution of a Self-Learning Chess Program
Previous research on the use of coevolution to improve a baseline chess program demonstrated a performance rating of 2550 against Pocket Fritz 2.0 (PF2). A series of 12 games (6 wh...
David B. Fogel, Timothy J. Hays, Sarah L. Hahn, Ja...
books