{"paper":{"title":"Scenic trails ascending from sea-level Nim to alpine chess","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aviezri S. Fraenkel","submitted_at":"1995-03-31T00:00:00Z","abstract_excerpt":"Aim: Present a systematic development of part of the theory of combinatorial games from the ground up.\n  Approach: Computational complexity. Combinatorial games are completely determined; the questions of interest are efficiencies of strategies.\n  Methodology: Divide and conquer. Ascend from Nim to chess in small strides at a gradient that's not too steep.\n  Presentation: Informal; examples of games sampled from various strategic viewing points along scenic mountain trails, which illustrate the theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9503222","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}