# My rules of Go, on arbitrary directed graphs

These are rules for the game of Go that elegantly generalize the game to arbitrary directed graphs, made by my sibling and I. (This post probably won't be interesting unless you're Go player and/or a mathematician.)

Our ruleset uses stone scoring because it's super simple and clear what that means. It uses divide-and-choose for komi because the first move is more valuable on some graphs than others. It uses a novel divide-and-choose method to address (super)ko. An ordinary superko rule would be well-defined here too.

## The rules

INTRO: Go is a class of infinite combinatorial games^{1} between two players, one for each finite^{2} directed graph and [...]