Methods › Reinforcement Learning › Board Game Models › TD-Gammon

TD-Gammon

introduced 1992 4 papers tagged archive 2025-07-28

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

TD-Gammon is a game-learning architecture for playing backgammon. It involves the use of a TD(λ) learning algorithm and a feedforward neural network.

Credit: Temporal Difference Learning and TD-Gammon

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: TD-V2A; TD-VAD; TD-DPO.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 4 · with a code link: 0 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 4 tagged papers has a Syntology run on record

Page 1 of 1: papers 1 to 4 of 4, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

5 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Reinforcement Learning (RL)2
Hierarchical Reinforcement Learning1
Model Predictive Control1
Reinforcement Learning1
reinforcement-learning1

Usage over time archive 2025-07-28

Papers per year tagged with TD-Gammon: 2016 to 2025, peak 1 1 0 2016: 1 paper 2016 2017: 0 papers 2017 2018: 0 papers 2018 2019: 0 papers 2019 2020: 0 papers 2020 2021: 1 paper 2021 2022: 0 papers 2022 2023: 0 papers 2023 2024: 1 paper 2024 2025: 1 paper 2025
Papers per year the archive tags with this method, by the paper's archive date (4 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Board Game Models

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections