A universal ruleset
Berlekamp Memorial Workshop on Combinatorial Games October 21, 2019 - October 22, 2019
Location: SLMath: Eisenbud Auditorium
Tags/Keywords
combinatorial game theory
Konane
5-Santos
We present a combinatorial ruleset which has a position in each equivalence class of short normal-play games (acyclic games with finite ranks and out-degrees). One could think of this as a CGT analogy of a universal Turing machine: one ruleset encodes it all.
5-Santos
H.264 Video | 948_27653_8057_5-Santos.mp4 |
Please report video problems to itsupport@slmath.org.
See more of our Streaming videos on our main VMath Videos page.