The Game of Life, also known simply as 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.
Here, each generation a cell C is alive or dead. So, in the next generation, each cell is dead or alive depending on count on neighbours N.
| Now | Neighbours | Next |
|---|---|---|
| 1 | 0,1 | 0 -> Lonely |
| 1 | 4,5,6,7,8 | 0 -> Overcrowded |
| 1 | 2,3 | 1 -> Lives |
| 0 | 3 | 1 -> It takes three to give birth |
| 0 | 0,1,2,4,5,6,7,8 | 0 -> Barren |
- Open the Online Code Editor
Rust : https://play.rust-lang.org/
Go : https://play.golang.org/
Scala : https://scastie.scala-lang.org/
Tips: Use code from seng20_21_HW2/code/Solution.scala directory - Copy paste the Code in the editor.
- Run the code to get the matrix of next generation and compare it with the expected output present in the comments.
Ashish Rajpurohit
Jayesh C Jakkani
Katta Rishabh
Keertikumar Malagund
Sathwik Kalvakuntla