A game project to practice Solidity smartcontract programming.
The Game of Life is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It is a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves. It is Turing complete and can simulate a universal constructor or any other Turing machine.
-
Any living cell with two or three living neighbours survives.
-
Any dead cell with three living neighbours becomes a living cell.
-
All other living cells die in the next generation. Similarly, all other dead cells stay dead.
Rinkeby Testnet Network: 0xA973bEd86C1152Dbbc1873F3D2B25b79566f52D4
