I implemented the Tromp-Taylor rules (https://en.wikibooks.org/wiki/Computer_Go/Tromp-Taylor_Rules) which have "A turn is either a pass; or a move that doesn't repeat an earlier grid coloring." Since it doesn't consider whose turn it is to move in whether a grid coloring is repeated, it won't allow suicide.

The prohibition on matching any earlier state of the board makes playing the game significantly more complex in reality, but not in terms of how many bits it takes to describe the rules.

Have you considered defining the complexity in terms of the number of bits required to implement the game, and not just the ruleset? Go requires a potentially very large list of past board states.

The amount of memory used in the execution of the program doesn't seem as important, and biases against games played on larger boards for no real reason. At the extreme end, you'd say that Conway's Game of Life takes infinite memory and is thus of infinite complexity because it occurs on an unbounded board, yet, the actual rules are very small and simple to implement.