Corpus ID: 2935600

KnightCap: A chess program that learns by combining TD( ) with minimax search

@inproceedings{Baxter1997KnightCapAC,
  title={KnightCap: A chess program that learns by combining TD( ) with minimax search},
  author={J. Baxter and A. Tridgell and Lex Weaver},
  booktitle={ICML 1997},
  year={1997}
}

J. Baxter, A. Tridgell, Lex Weaver

Published in ICML 1997

Computer Science

In this paper we present TDLeaf( ), a variation on the TD( ) algorithm that enables it to be used in conjunction with minimax search. We p resent some experiments in which our chess program, “KnightCap,” used TDL eaf( ) to learn its evaluation function while playing on the Free Ineternet Chess Server (FICS, fics.onenet.net). It improved from a 1650 rating to a 2100 rating in just 308 games and 3 days of play. We discuss some of the reasons for this success and also the relationship between our… CONTINUE READING

cs.anu.edu.au

Save to Library

Create Alert

Cite

Launch Research Feed