{"id":7416,"date":"2022-09-16T08:30:00","date_gmt":"2022-09-16T06:30:00","guid":{"rendered":"https:\/\/adntro.com\/?p=7416"},"modified":"2025-02-27T09:10:22","modified_gmt":"2025-02-27T08:10:22","slug":"conway","status":"publish","type":"post","link":"https:\/\/adntro.com\/en\/blog\/corporate-news\/conway\/","title":{"rendered":"Conway. The Game of Life"},"content":{"rendered":"

Game of Life Explanation<\/h2>\n\n\n\n

The Game of Life is a cellular automata developed by mathematician John Horton Conway<\/b> in 1969. He named it after his wife, Heidi, had died earlier that year. The game consists of a grid of squares.<\/p>\n\n\n\n

Each cell contains either a single number representing its life value or zero, indicating death. At each turn, every cell checks itself against three neighboring cells. If the sum of those numbers exceeds some threshold value, the cell dies; otherwise, it lives on.<\/p>\n\n\n\n

Conway discovered that certain patterns emerge over time. For instance, if we start with an empty field, the cells eventually form a pattern like this:<\/p>\n\n\n

\n
\"Conway's<\/figure>\n<\/div>\n\n\n

This is called the \"glider<\/b>,\" and it moves around the board without stopping. Because the glider never stops moving, it consumes no space. However, once it reaches the edge of the board, it bounces off into infinity.<\/p>\n\n\n\n

The Game of Life can be played on a square grid of any size. But most people play on a rectangular grid.  <\/p>\n\n\n\n

Rules<\/h2>\n\n\n\n

The universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, live or dead (or populated and unpopulated, respectively). Every cell interacts with its eight, which are the cells that are horizontally, vertically, or diagonally adjacent.<\/p>\n\n\n\n

The rules, can be condensed into the following:<\/p>\n\n\n\n

    \n
  1. Any live cell with two or three live neighbours survives.<\/li>\n\n\n\n
  2. Any dead cell with three live neighbours becomes a live cell.<\/li>\n\n\n\n
  3. All other live cells die in the next generation. Similarly, all other dead cells stay dead.<\/li>\n<\/ol>\n\n\n\n
    <\/div>\n\n\n\n

    A new generation begins when all cells have been updated once<\/b>. This means that the next generation starts from scratch, with no memory of what happened in previous generations.<\/p>\n\n\n\n

    A new generation starts when all cells have been updated once.<\/strong>. This means that the next generation starts from scratch, with no memory of what happened in previous generations.<\/p>\n\n\n

    \n
    \"The<\/figure>\n<\/div>\n\n\n

    Starting and Stopping<\/h2>\n\n\n\n

    You can start evolution by clicking on the Start Evolution button. This starts the process of generating random mutations and recombinations. After some time, the algorithm stops and displays the current state of the population. To continue, click on the Evo button again.<\/p>\n\n\n\n

    To stop evolution, click on the Stop button. If you want to restart evolution, simply click on the Start Evolution button again.<\/p>\n\n\n\n

    The Conway Game and ADNTRO<\/h2>\n\n\n\n

    The idea of Conway is that it is a universal Turing machine.<\/strong>so you can reproduce anything within the game. This is very important because it allows us to recreate the world inside the game. But Conway's idea became so famous partly due to the fact that each movement is a unit of time and this was interesting for programmers to use clock cycles while programming.<\/p>\n\n\n\n

    \n