Game of Life

[Death_Source]

Hey lol it's me again.

I'm sure you've heard at least once of the Game of Life, made by mathematician John Conway (RIP, died from Covid last year). It revolves around 3 rules that define the actions of dead and alive cells throughout a grid. Based on the start pattern, the actions of these cells is determined by the rules and can evolve into complex shapes, and with proper time and effort, can be coded into functioning systems. The rules are as follow:

1. Any alive cell with less than 2 alive neighbors must die.
2. Any alive cell with more than 3 alive neighbors must also die.
3. Any empty cell with exactly 3 alive neighbors will become an alive cell.

Using Skript, i coded these 3 rules into 2 functions, and with a little bit of work here and there got the exact same result given by the Game of Life. I included a video and the code for the functions below. 

function neighbors1(l: location) :: boolean:

    return true if (size of (all blocks in radius 1.5 of {_l} where [input = black concrete])) != 2 or 3

 

function neighbors2(l: location) :: boolean:

    return true if (size of (all blocks in radius 1.5 of {_l} where [input = black concrete])) = 3

P.S., Floofsy =  I think we can all agree?

[_Tarna_]

lol that looks cool for some reason. Try it again but with more starting blocks. 

[Death_Source]

32 minutes ago, _Tarna_ said:

lol that looks cool for some reason. Try it again but with more starting blocks. 

I did, many times  it's all the same principles in the end. 

https://playgameoflife.com

[CoolProgrammer]

3 hours ago, Death_Source said:

Hey lol it's me again.

I'm sure you've heard at least once of the Game of Life, made by mathematician John Conway (RIP, died from Covid last year). It revolves around 3 rules that define the actions of dead and alive cells throughout a grid. Based on the start pattern, the actions of these cells is determined by the rules and can evolve into complex shapes, and with proper time and effort, can be coded into functioning systems. The rules are as follow:

1. Any alive cell with less than 2 alive neighbors must die.
2. Any alive cell with more than 3 alive neighbors must also die.
3. Any empty cell with exactly 3 alive neighbors will become an alive cell.

Using Skript, i coded these 3 rules into 2 functions, and with a little bit of work here and there got the exact same result given by the Game of Life. I included a video and the code for the functions below. 

function neighbors1(l: location) :: boolean:

    return true if (size of (all blocks in radius 1.5 of {_l} where [input = black concrete])) != 2 or 3

 

function neighbors2(l: location) :: boolean:

    return true if (size of (all blocks in radius 1.5 of {_l} where [input = black concrete])) = 3

 

P.S., Floofsy =  I think we can all agree?

This looks cooler than the ice cubes I stored in my basement.

[Death_Source]

1 minute ago, CoolProgrammer said:

This looks cooler than the ice cubes I stored in my basement.

even cooler than the babies i store in my basement?

[Weeeoooooo]

oo thats cool and i agree about the last thing

[AgentGamerPro]

On 5/30/2021 at 6:47 PM, Death_Source said:

Hey lol it's me again.

I'm sure you've heard at least once of the Game of Life, made by mathematician John Conway (RIP, died from Covid last year). It revolves around 3 rules that define the actions of dead and alive cells throughout a grid. Based on the start pattern, the actions of these cells is determined by the rules and can evolve into complex shapes, and with proper time and effort, can be coded into functioning systems. The rules are as follow:

1. Any alive cell with less than 2 alive neighbors must die.
2. Any alive cell with more than 3 alive neighbors must also die.
3. Any empty cell with exactly 3 alive neighbors will become an alive cell.

Using Skript, i coded these 3 rules into 2 functions, and with a little bit of work here and there got the exact same result given by the Game of Life. I included a video and the code for the functions below. 

function neighbors1(l: location) :: boolean:

    return true if (size of (all blocks in radius 1.5 of {_l} where [input = black concrete])) != 2 or 3

 

function neighbors2(l: location) :: boolean:

    return true if (size of (all blocks in radius 1.5 of {_l} where [input = black concrete])) = 3

 

P.S., Floofsy =  I think we can all agree?

Is this a server? Please tell me this is a server