CiteULike is a free online bibliography manager. Register and you can start organising your references online.

KnightCap: a chess program that learns by combining TD(λ) with game-tree search Export

In Proc. 15th International Conf. on Machine Learning (1998), pp. 28-36.

Citation Format

[Posts]

View FullText article


bsilverthorn's tags for this article

chess game_playing minimax_search reinforcement_learning temporal_difference

X Reviews [Write a review of this article]

X Notes for this article

bsilverthorn has 1 private note and 0 public notes for this article. If you are bsilverthorn then you can log in to see the private note.

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X Abstract

In this paper we present TDLeaf(), a variation on the TD() algorithm that enables it to be used in conjunction with minimax search. We present some experiments in which our chess program, "KnightCap," used TDLeaf() 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...


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.