Sign inGet started
Dataset · Hugging Face

pavelslab-nyu/chess_puzzle_benchmark

Chess Puzzle Benchmark Chess puzzle evaluation sets at five difficulty tiers, B1 (easiest) through B5 (hardest). Each example is a chess game given in PGN move notation; the model must produce the next move(s). Two prompt variants The same puzzles are released in two forms that differ only in the prompt suffix: think/ — the prompt ends with a special <T> token. <T> is a reasoning trigger: it tells the model to think (produce a chain of reasoning) before… See the full description on the dataset page: https://huggingface.co/datasets/pavelslab-nyu/chess_puzzle_benchmark.

Author / organizationpavelslab-nyu
License (as declared)mit
Downloads908 (as reported by Hugging Face)
Likes0
Created7 June 2026
Last updated at source20 July 2026
chesspuzzlesreasoning
Embed this entry
<iframe src="https://silytics.si/embed/item/a975dd4f-10a1-4b99-8de9-fb34e6267148" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 5 days

908 now (-15 since 2026-10-16). Counts as reported by the source, snapshotted daily by Silytics.

Connected in the knowledge graph

Explore this entry in the graph

Related papers

More from pavelslab-nyu

Silytics shows public metadata from Hugging Face and links to the original. Information may be incomplete or out of date. Last refreshed 20 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.