I'd like to start by sharing my own idea for a game:
I was watching a game of Go when I came up with the idea for this game, so there are similarities to that. You may also note that this is playable on a Go board with only minimal modification needed (which is, by the way, marking one side of each piece so that you can distinguish between the current and previous generation by flipping pieces over). Include considerations like that, too, if they are applicable.The game is played on a 19x19 grid, with 2 players.
Both players get a single type of piece/cell of their color.
Each turn, each player is able to place 1 piece on any empty space.
After a piece is placed, the CA advances one generation. The CA being used is:Code: Select all
@RULE Wafers @TABLE n_states:3 neighborhood:Moore symmetries:permute var a={1,2} var b={0,1,2} var bb=b var bc=b var bd=b var be=b var c={0,1} var d={0,2} b,1,1,1,1,2,2,2,2,b b,a,a,a,a,bb,bc,bd,be,a @COLORS 0 0 0 0 1 0 0 255 2 255 0 0
The game ends when there are no empty spaces remaining.Both states follow B45678/S012345678 when they only interact with themselves.
A cell is replaced by another if the number of neighbors of the other cell state is >=4.
If the number of neighbors of one type = the number of neighbors of the other type = 4, the cell will remain as is.
The player who has more cells/pieces of their type on the board wins.