1995/03/31 by Aviezri S. Fraenkel, Fraenkel, Aviezri S.
Computer Science · #05-02 #90D46 #Artificial Intelligence in Games #Combinatorics (math.CO) #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.math/9503222
openalex publication_date 1995/03/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Aim: Present a systematic development of part of the theory of combinatorial games from the ground up. Approach: Computational complexity. Combinatorial games are completely determined; the questions of interest are efficiencies of strategies. Methodology: Divide and conquer. Ascend from Nim to chess in small strides at a gradient that's not too steep. Presentation: Informal; examples of games sampled from various strategic viewing points along scenic mountain trails, which illustrate the theory.