KnightCap: A chess program that learns by combining TD(lambda) with game-tree search

Computer Science – Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages

Scientific paper

In this paper we present TDLeaf(lambda), a variation on the TD(lambda) algorithm that enables it to be used in conjunction with game-tree search. We present some experiments in which our chess program ``KnightCap'' used TDLeaf(lambda) to learn its evaluation function while playing on the Free Internet Chess Server (FICS, fics.onenet.net). The main success we report is that KnightCap improved from a 1650 rating to a 2150 rating in just 308 games and 3 days of play. As a reference, a rating of 1650 corresponds to about level B human play (on a scale from E (1000) to A (1800)), while 2150 is human master level. We discuss some of the reasons for this success, principle among them being the use of on-line, rather than self-play.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

KnightCap: A chess program that learns by combining TD(lambda) with game-tree search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with KnightCap: A chess program that learns by combining TD(lambda) with game-tree search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and KnightCap: A chess program that learns by combining TD(lambda) with game-tree search will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-252797

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.