Skip to main content
added 142 characters in body
Source Link
Jo King Mod
  • 47.3k
  • 24
  • 32

Game of Lives

In this , your goal is to create a GOL (Game of Life) pattern that creates the most live cells after \$n\$ steps. The twist is, you will be competing against 3 other patterns on the same playing field at the same time.

Here are the rules of the Game of Life, with a couple of additions:

  • Each player's starting living cells will be a specific colour.
  • Any live cell with less than 2 or 3 live neighbours will stay alive, otherwise they'll die
  • Note that 'neighbours' includes diagonaldiagonals, so there are 8 possible neighbours for a cell.
  • Any live cell with 2 or 3 live neighbours will live
  • Any live cell with more than 3 live neighbours will die
  • Any dead cell with exactly three neighbours will become a live cell with the colour of the most common neighbouring cell. If there areis no majority, it will become a neutral colour, which doesn'twon't count for further conversions.
  • 2 redsReds + 1 blueBlue = redRed
  • Red + blueBlue + greenGreen = Neutral
  • 2 neutralsNeutrals + redRed = Red
  • The playing field will be \$x\$ by \$x\$, where each quarter of the field is each player's starting configuration.
  • Cells outside the playing field will always be considered as dead, and cannot be resurrected.
  • Each starting configuration will be flipped and rotated so the right and bottom sides face the enemy.

For example, if your submission was:

Start corner

And you plotted them against one another, the starting configuration could be:

enter image description here

Note how the bottom right isn't symmetrical, but still has the correct sides facing inwards.

Your submission should be a \$x/2\$ by \$x/2\$ GOL pattern that assumes it is in the top left corner.

Rounds will be run until only one competitor remains or the whole pattern repeats, where the competitor with the most cells when the pattern repeats is the winner.

Sandbox:

  • I haven't decided yet what sizes the playing field should be (\$x\$), nor how long each game should run (\$n\$).
  • I was thinking about a 128 by 128 playing field, with 64 by 64 for each player. Is that too large or too small? For reference, the submission would be the size of: enter image description here with some gliders and stuff for reference
  • Currently the number of steps would be a random number between 3000 and 4000. Is that too many or too little? I haven't really got much reference.
  • I am working on a visual controller like the Formic Functions question
  • Overall winner? Check all combinations (way too much time as more submissions are added)? Tournament structure (multiple rounds per elimination)?

Game of Lives

In this , your goal is to create a GOL (Game of Life) pattern that creates the most live cells after \$n\$ steps. The twist is, you will be competing against 3 other patterns on the same playing field at the same time.

Here are the rules of the Game of Life, with a couple of additions:

  • Each player's starting living cells will be a specific colour.
  • Any live cell with less than 2 live neighbours will die
  • Note that 'neighbours' includes diagonal, so there are 8 possible neighbours for a cell.
  • Any live cell with 2 or 3 live neighbours will live
  • Any live cell with more than 3 live neighbours will die
  • Any dead cell with exactly three neighbours will become a live cell with the colour of the most common neighbouring cell. If there are no majority, it will become a neutral colour, which doesn't count for further conversions.
  • 2 reds + 1 blue = red
  • Red + blue + green = Neutral
  • 2 neutrals + red = Red
  • The playing field will be \$x\$ by \$x\$, where each quarter of the field is each player's starting configuration.
  • Cells outside the playing field will always be considered as dead, and cannot be resurrected.
  • Each starting configuration will be flipped and rotated so the right and bottom sides face the enemy.

For example, if your submission was:

Start corner

And you plotted them against one another, the starting configuration could be:

enter image description here

Note how the bottom right isn't symmetrical, but still has the correct sides facing inwards.

Your submission should be a \$x/2\$ by \$x/2\$ GOL pattern that assumes it is in the top left corner.

Sandbox:

  • I haven't decided yet what sizes the playing field should be (\$x\$), nor how long each game should run (\$n\$).
  • I was thinking about a 128 by 128 playing field, with 64 by 64 for each player. Is that too large or too small? For reference, the submission would be the size of: enter image description here with some gliders and stuff for reference
  • Currently the number of steps would be a random number between 3000 and 4000. Is that too many or too little? I haven't really got much reference.
  • I am working on a visual controller like the Formic Functions question

Game of Lives

In this , your goal is to create a GOL (Game of Life) pattern that creates the most live cells after \$n\$ steps. The twist is, you will be competing against 3 other patterns on the same playing field at the same time.

Here are the rules of the Game of Life, with a couple of additions:

  • Each player's starting living cells will be a specific colour.
  • Any live cell with 2 or 3 live neighbours will stay alive, otherwise they'll die
  • Note that 'neighbours' includes diagonals, so there are 8 possible neighbours for a cell.
  • Any dead cell with exactly three neighbours will become a live cell with the colour of the most common neighbouring cell. If there is no majority, it will become a neutral colour, which won't count for further conversions.
  • 2 Reds + 1 Blue = Red
  • Red + Blue + Green = Neutral
  • 2 Neutrals + Red = Red
  • The playing field will be \$x\$ by \$x\$, where each quarter of the field is each player's starting configuration.
  • Cells outside the playing field will always be considered as dead, and cannot be resurrected.
  • Each starting configuration will be flipped and rotated so the right and bottom sides face the enemy.

For example, if your submission was:

Start corner

And you plotted them against one another, the starting configuration could be:

enter image description here

Note how the bottom right isn't symmetrical, but still has the correct sides facing inwards.

Your submission should be a \$x/2\$ by \$x/2\$ GOL pattern that assumes it is in the top left corner.

Rounds will be run until only one competitor remains or the whole pattern repeats, where the competitor with the most cells when the pattern repeats is the winner.

Sandbox:

  • I haven't decided yet what sizes the playing field should be (\$x\$), nor how long each game should run (\$n\$).
  • I was thinking about a 128 by 128 playing field, with 64 by 64 for each player. Is that too large or too small? For reference, the submission would be the size of: enter image description here with some gliders and stuff for reference. Is that too many or too little? I haven't really got much reference.
  • I am working on a visual controller like the Formic Functions question
  • Overall winner? Check all combinations (way too much time as more submissions are added)? Tournament structure (multiple rounds per elimination)?
changed to neutral colour
Source Link
Jo King Mod
  • 47.3k
  • 24
  • 32

Game of Lives

In this , your goal is to create a GOL (Game of Life) pattern that creates the most live cells after \$n\$ steps. The twist is, you will be competing against 3 other patterns on the same playing field at the same time.

Here are the rules of the Game of Life, with a couple of additions:

  • Each player's starting living cells will be a specific colour.
  • Any live cell with less than 2 live neighbours will die
  • Note that 'neighbours' includes diagonal, so there are 8 possible neighbours for a cell.
  • Any live cell with 2 or 3 live neighbours will live
  • Any live cell with more than 3 live neighbours will die
  • Any dead cell with exactly three neighbours will become a live cell with the colour of the most common neighbouring cell. If theythere are all different coloursno majority, then the cellit will be randomly picked from those coloursbecome a neutral colour, which doesn't count for further conversions.
  • 2 reds + 1 blue = red
  • Red + blue + green = Neutral
  • 2 neutrals + red = Red
  • The playing field will be \$x\$ by \$x\$, where each quarter of the field is each player's starting configuration.
  • Cells outside the playing field will always be considered as dead, and cannot be resurrected.
  • Each starting configuration will be flipped and rotated so the right and bottom sides face the enemy.

For example, if your submission was:

Start corner

And you plotted them against one another, the starting configuration could be:

enter image description here

Note how the bottom right isn't symmetrical, but still has the correct sides facing inwards.

Your submission should be a \$x/2\$ by \$x/2\$ GOL pattern that assumes it is in the top left corner.

Sandbox:

  • I haven't decided yet what sizes the playing field should be (\$x\$), nor how long each game should run (\$n\$).
  • I was thinking about a 128 by 128 playing field, with 64 by 64 for each player. Is that too large or too small? For reference, the submission would be the size of: enter image description here with some gliders and stuff for reference
  • Currently the number of steps would be a random number between 3000 and 4000. Is that too many or too little? I haven't really got much reference.
  • I am working on a visual controller like the Formic Functions question

Game of Lives

In this , your goal is to create a GOL (Game of Life) pattern that creates the most live cells after \$n\$ steps. The twist is, you will be competing against 3 other patterns on the same playing field at the same time.

Here are the rules of the Game of Life, with a couple of additions:

  • Each player's starting living cells will be a specific colour.
  • Any live cell with less than 2 live neighbours will die
  • Any live cell with 2 or 3 live neighbours will live
  • Any live cell with more than 3 live neighbours will die
  • Any dead cell with exactly three neighbours will become a live cell with the colour of the most common neighbouring cell. If they are all different colours, then the cell will be randomly picked from those colours.
  • The playing field will be \$x\$ by \$x\$, where each quarter of the field is each player's starting configuration.
  • Cells outside the playing field will always be considered as dead, and cannot be resurrected.
  • Each starting configuration will be flipped and rotated so the right and bottom sides face the enemy.

For example, if your submission was:

Start corner

And you plotted them against one another, the starting configuration could be:

enter image description here

Note how the bottom right isn't symmetrical, but still has the correct sides facing inwards.

Your submission should be a \$x/2\$ by \$x/2\$ GOL pattern that assumes it is in the top left corner.

Sandbox:

  • I haven't decided yet what sizes the playing field should be (\$x\$), nor how long each game should run (\$n\$).
  • I was thinking about a 128 by 128 playing field, with 64 by 64 for each player. Is that too large or too small? For reference, the submission would be the size of: enter image description here with some gliders and stuff for reference
  • Currently the number of steps would be a random number between 3000 and 4000. Is that too many or too little? I haven't really got much reference.
  • I am working on a visual controller like the Formic Functions question

Game of Lives

In this , your goal is to create a GOL (Game of Life) pattern that creates the most live cells after \$n\$ steps. The twist is, you will be competing against 3 other patterns on the same playing field at the same time.

Here are the rules of the Game of Life, with a couple of additions:

  • Each player's starting living cells will be a specific colour.
  • Any live cell with less than 2 live neighbours will die
  • Note that 'neighbours' includes diagonal, so there are 8 possible neighbours for a cell.
  • Any live cell with 2 or 3 live neighbours will live
  • Any live cell with more than 3 live neighbours will die
  • Any dead cell with exactly three neighbours will become a live cell with the colour of the most common neighbouring cell. If there are no majority, it will become a neutral colour, which doesn't count for further conversions.
  • 2 reds + 1 blue = red
  • Red + blue + green = Neutral
  • 2 neutrals + red = Red
  • The playing field will be \$x\$ by \$x\$, where each quarter of the field is each player's starting configuration.
  • Cells outside the playing field will always be considered as dead, and cannot be resurrected.
  • Each starting configuration will be flipped and rotated so the right and bottom sides face the enemy.

For example, if your submission was:

Start corner

And you plotted them against one another, the starting configuration could be:

enter image description here

Note how the bottom right isn't symmetrical, but still has the correct sides facing inwards.

Your submission should be a \$x/2\$ by \$x/2\$ GOL pattern that assumes it is in the top left corner.

Sandbox:

  • I haven't decided yet what sizes the playing field should be (\$x\$), nor how long each game should run (\$n\$).
  • I was thinking about a 128 by 128 playing field, with 64 by 64 for each player. Is that too large or too small? For reference, the submission would be the size of: enter image description here with some gliders and stuff for reference
  • Currently the number of steps would be a random number between 3000 and 4000. Is that too many or too little? I haven't really got much reference.
  • I am working on a visual controller like the Formic Functions question
fixed stuff
Source Link
Jo King Mod
  • 47.3k
  • 24
  • 32

Game of Lives

In this , your goal is to create a GOL (Game of Life) pattern that creates the most live cells after \$n\$ steps. The twist is, you will be competing against 3 other patterns on the same playing field at the same time.

Here are the rules of the Game of Life, with a couple of additions:

  • Each player's starting living cells will be a specific colour.
  • Any live cell with less than 2 live neighbours will die
  • Any live cell with 2 or 3 live neighbours will live
  • Any live cell with more than 3 live neighbours will die
  • Any dead cell with exactly three neighbours will become a live cell with the colour of the most common neighbouring cell. If they are all different colours, then the cell will be randomly picked from those colours.
  • The playing field will be \$x\$ by \$x\$, where each quarter of the field is each player's starting configuration.
  • Cells outside the playing field will always be considered as dead, and cannot be resurrected.
  • Each starting configuration will be flipped and rotated so the right and bottom sides face the enemy.

For example, if your submission was:

Start corner

And you plotted them against one another, the starting configuration could be:

enter image description hereenter image description here

Note how the bottom right isn't symmetrical, but still has the correct sides facing inwards.

Your submission should be a \$x/2\$ by \$x/2\$ GOL pattern that assumes it is in the top left corner.

Sandbox:

  • I haven't decided yet what sizes the playing field should be (\$x\$), nor how long each game should run (\$n\$).
  • I was thinking about a 100128 by 100128 playing field, with 5064 by 5064 for each player. Is that too large or too small? For reference, the submission would be the size of: enter image description hereenter image description here with some gliders and stuff for reference
  • Currently the number of steps would be a random number between 3000 and 4000. Is that too many or too little? I haven't really got much reference.
  • I am working on a visual controller like the Formic Functions question

Game of Lives

In this , your goal is to create a GOL (Game of Life) pattern that creates the most live cells after \$n\$ steps. The twist is, you will be competing against 3 other patterns on the same playing field at the same time.

Here are the rules of the Game of Life, with a couple of additions:

  • Each player's starting living cells will be a specific colour.
  • Any live cell with less than 2 live neighbours will die
  • Any live cell with 2 or 3 live neighbours will live
  • Any live cell with more than 3 live neighbours will die
  • Any dead cell with exactly three neighbours will become a live cell with the colour of the most common neighbouring cell. If they are all different colours, then the cell will be randomly picked from those colours.
  • The playing field will be \$x\$ by \$x\$, where each quarter of the field is each player's starting configuration.
  • Cells outside the playing field will always be considered as dead, and cannot be resurrected.
  • Each starting configuration will be flipped and rotated so the right and bottom sides face the enemy.

For example, if your submission was:

Start corner

And you plotted them against one another, the starting configuration could be:

enter image description here

Note how the bottom right isn't symmetrical, but still has the correct sides facing inwards.

Your submission should be a \$x/2\$ by \$x/2\$ GOL pattern that assumes it is in the top left corner.

Sandbox:

  • I haven't decided yet what sizes the playing field should be (\$x\$), nor how long each game should run (\$n\$).
  • I was thinking about a 100 by 100 playing field, with 50 by 50 for each player. Is that too large or too small? For reference, the submission would be the size of: enter image description here
  • Currently the number of steps would be a random number between 3000 and 4000. Is that too many or too little? I haven't really got much reference.
  • I am working on a visual controller like the Formic Functions question

Game of Lives

In this , your goal is to create a GOL (Game of Life) pattern that creates the most live cells after \$n\$ steps. The twist is, you will be competing against 3 other patterns on the same playing field at the same time.

Here are the rules of the Game of Life, with a couple of additions:

  • Each player's starting living cells will be a specific colour.
  • Any live cell with less than 2 live neighbours will die
  • Any live cell with 2 or 3 live neighbours will live
  • Any live cell with more than 3 live neighbours will die
  • Any dead cell with exactly three neighbours will become a live cell with the colour of the most common neighbouring cell. If they are all different colours, then the cell will be randomly picked from those colours.
  • The playing field will be \$x\$ by \$x\$, where each quarter of the field is each player's starting configuration.
  • Cells outside the playing field will always be considered as dead, and cannot be resurrected.
  • Each starting configuration will be flipped and rotated so the right and bottom sides face the enemy.

For example, if your submission was:

Start corner

And you plotted them against one another, the starting configuration could be:

enter image description here

Note how the bottom right isn't symmetrical, but still has the correct sides facing inwards.

Your submission should be a \$x/2\$ by \$x/2\$ GOL pattern that assumes it is in the top left corner.

Sandbox:

  • I haven't decided yet what sizes the playing field should be (\$x\$), nor how long each game should run (\$n\$).
  • I was thinking about a 128 by 128 playing field, with 64 by 64 for each player. Is that too large or too small? For reference, the submission would be the size of: enter image description here with some gliders and stuff for reference
  • Currently the number of steps would be a random number between 3000 and 4000. Is that too many or too little? I haven't really got much reference.
  • I am working on a visual controller like the Formic Functions question
edited body
Source Link
Jo King Mod
  • 47.3k
  • 24
  • 32
Loading
changed to 50 by 50
Source Link
Jo King Mod
  • 47.3k
  • 24
  • 32
Loading
Source Link
Jo King Mod
  • 47.3k
  • 24
  • 32
Loading