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

Simple item page
dc.creatorBaxter, Jonathan
dc.creatorTridgell, Andrew
dc.creatorWeaver, Lex
dc.date1999-01-05
dc.date.accessioned2026-07-07T08:18:06Z
dc.date.available2026-07-07T08:18:06Z
dc.descriptionIn 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.
dc.description5 pages. Also in Proceedings of the Ninth Australian Conference on Neural Networks (ACNN'98), Brisbane QLD, February 1998, pages 168-172
dc.identifierhttps://arxiv.org/abs/cs/9901001
dc.identifierhttp://arxiv.org/abs/cs/9901001
dc.identifierAustralian Journal of Intelligent Information Processing Systems, ISSN 1321-2133, Vol. 5 No. 1, Autumn 1998, pages 39-43
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134319
dc.subjectMachine Learning
dc.subjectArtificial Intelligence
dc.subjectI.2.6
dc.titleTDLeaf(lambda): Combining Temporal Difference Learning with Game-Tree Search
dc.typetext

Files

Collections

arXiv