pocket-mind/tiny-verified-puzzles

Tiny Verified Puzzles 2,000 small puzzles in five families, each with a ground-truth answer that is computed by brute force or dynamic programming rather than written by hand (or by a model). family what it asks how the answer is verified knights_knaves who is a knight (2^n assignments checked; only puzzles with exactly one solution are kept) exhaustive search cipher decrypt a Caesar or Vigenere text inverse of the encryption weekday day of week after N days… See the full description on the dataset page: https://huggingface.co/datasets/pocket-mind/tiny-verified-puzzles.

<iframe src="https://silytics.si/embed/item/57ddd5ce-c753-40d0-8684-d0e3b2a7d450" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

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