From Nim to Go

DOI10.1016/S0167-5060(08)70700-3zbMath0445.90104OpenAlexW225257848MaRDI QIDQ3890456

Aviezri S. Fraenkel

Publication date: 1980

Published in: Combinatorial Mathematics, Optimal Designs and Their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70700-3

zbMATH Keywords

chessNimfinite gamesGogames of increasing complexitytwo-player full information games

Mathematics Subject Classification ID

Game theory (91A99) 2-person games (91A05)

Related Items

Remarks on strategies in combinatorial games, Complexity of problems in games, graphs and algebraic equations