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.