2b:null 2c:["$","title",null,{"children":"Etudes - Game of Life | Sami Safadi | Observable"}] 31:T600,# Etudes - Game of Life [https://openlibrary.org/books/OL4546158M/Etudes_for_Programmers](https://openlibrary.org/books/OL4546158M/Etudes_for_Programmers) LIFE is a multicellular communal organism that inhabits the deserts of Flatland. The desert is organized in a square array with each square capable of holding one LIFE cell. LIFE generations mark the passage of time, each generation bringing births and deaths to the LIFE community. To follow the history of such a community, place LIFE cells into their initial positions in the desert. Count the passing generations by observing these rules. 1. The immediate neighbors of a cell are those cells occupying the eight horizontally, vertically, and diagonally adjacent cells. 2. If a LIFE cell has fewer than two immediate neighbors, it dies of loneliness. If a LIFE cell has more than three immediate neighbors, it dies of overcrowding. 3. If an empty square has exactly three LIFE cells as immediate neighbors, a new cell is born in the square. 4. Births and deaths all take place exactly at the change of generations. Thus a dying cell may help birth a new one, but a newborn cell may not resurrect a dying cell, nor may one dying cell stave off death for another by lowering the local population density. ## Statement of the Theme Write a program that simulates a LIFE community. The input should be the initial positions of the community’s cells, and the output an aerial view of the community at each generation. ## Instructions Changing the slider will trigger a reset.32:[] 2f:{"id":"4fa8b76b40af0d19","slug":"game-of-life","title":"Etudes - Game of Life","thumbnail":"27768c618e17ec4bce0a91242ca1bb00b6ff1c98368bf5dad401ffbd2237784c","access_level":"public","create_time":"$D2022-01-31T23:17:52.883Z","update_time":"$D2022-02-01T03:47:14.033Z","view_time":null,"first_public_time":"$D2022-02-01T02:15:23.501Z","fork":true,"stars":1,"starred":false,"owner":{"type":"team","id":"1d804b626bd08da7","login":"samisaf","name":"Sami Safadi","avatar_url":"https://avatars-next.observableusercontent.com/a2adb3491825954cb8c600a2e043624c461158aa29ae90abb5d3fab14240f3de","tier":"starter_2024"},"version":325,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"a139fe285b2a1eaf","login":"samisaf","name":"Sami Safadi","avatar_url":"https://avatars-next.observableusercontent.com/a2adb3491825954cb8c600a2e043624c461158aa29ae90abb5d3fab14240f3de","tier":null}],"members":[{"type":"individual","id":"a139fe285b2a1eaf","login":"samisaf","name":"Sami Safadi","avatar_url":"https://avatars-next.observableusercontent.com/a2adb3491825954cb8c600a2e043624c461158aa29ae90abb5d3fab14240f3de","tier":null,"role":"editor"},{"type":"team","id":"1d804b626bd08da7","login":"samisaf","name":"Sami Safadi","avatar_url":"https://avatars-next.observableusercontent.com/a2adb3491825954cb8c600a2e043624c461158aa29ae90abb5d3fab14240f3de","tier":"starter_2024","role":"viewer"}],"comments":[],"custom_thumbnail":false,"trashed":false,"subscribed":null,"forks":1,"collection":null,"type":"notebook","body":{"title":"Etudes - Game of Life","cells":[{"id":0,"value":"$31","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":286,"value":"viewof N = Inputs.range([10, 200], {step: 1, value: 70})","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":310,"value":"viewof alivePercentOnStart = Inputs.range([0.0, 1.0], {step: 0.05, value: 0.5})","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":5,"value":"p5(sketch => {\n sketch.setup = function() {\n G.world = createRandomWorld(N, alivePercentOnStart)\n sketch.createCanvas(G.size, G.size)\n sketch.frameRate(G.framerate)\n sketch.background(\"black\")\n };\n sketch.draw = function() {\n for (let r = 0; r < N; r++)\n for (let c = 0; c < N; c++){\n let blockColor = G.world[r][c]? \"white\" : \"black\"\n let blockSize = G.size / N\n sketch.fill(blockColor)\n sketch.rect(r*blockSize, c*blockSize, blockSize, blockSize) \n }\n G.world = getNextWorld(G.world)\n }\n})","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":205,"value":"G = Object({size:500, framerate: 5, LIFE: true, DEATH: false, world: null})","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":79,"value":"function createWorld(n=10, getCellValue=_=> G.DEATH){\n let result = Array(n)\n for (let i=0; i Math.random() < percent? G.LIFE : G.DEATH\n return createWorld(n, chance)\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":97,"value":"function getNumAliveAdjacentCells(world, r, c){\n let n = world.length\n let result = 0\n for (let i of [r-1, r, r+1]) // Adjacent rows\n for (let j of [c-1, c, c+1]){ // Adjacent columns\n if (i>=0 && j>=0 && i 3) newWorld[r][c] = G.DEATH // an overcrowded cell dies\n else throw(Error(\"Unexpected condition\"))\n }\n return newWorld\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":2,"value":"import {p5} from \"@tmcw/p5\"","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W32","stdlib":"1","titling":"auto"}} 30:"$2f:body"