TDLeaf(lambda): Combining Temporal Difference Learning with Game-Tree Search

Details TDLeaf(lambda): Combining Temporal Difference Learning with Game-Tree Search TDLeaf(lambda): Combining Temporal Difference Learning with Game-Tree Search

1999-01-05

arxiv.org/abs/cs/9901001v1

Australian Journal of Intelligent Information Processing Systems, ISSN 1321-2133, Vol. 5 No. 1, Autumn 1998, pages 39-43

Computer Science

Learning

5 pages. Also in Proceedings of the Ninth Australian Conference on Neural Networks (ACNN'98), Brisbane QLD, February 1998, pag

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 minimax search. We present some experiments in both chess and backgammon which demonstrate its utility and provide comparisons with TD(lambda) and another less radical variant, TD-directed(lambda). In particular, our chess program, ``KnightCap,'' used TDLeaf(lambda) to learn its evaluation function while playing on the Free Internet Chess Server (FICS, fics.onenet.net). It improved from a 1650 rating to a 2100 rating in just 308 games. We discuss some of the reasons for this success and the relationship between our results and Tesauro's results in backgammon.

Affiliated with

Also associated with

No associations

Rating

TDLeaf(lambda): Combining Temporal Difference Learning 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 TDLeaf(lambda): Combining Temporal Difference Learning with Game-Tree Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and TDLeaf(lambda): Combining Temporal Difference Learning with Game-Tree Search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-217540