A cellular automata consists of a regular grid of cells, each in one of a finite number of states, such as "On" and "Off". The most popular is the Conway's ...
A cellular automata consists of a regular grid of cells, each in one of a finite number of states, such as "On" and "Off". The most popular is the Conway's Game of Life automata. 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. Every cell interacts with its eight neighbors, which are the cells that are directly horizontally, vertically, or diagonally adjacent. In the Donnelly Algorithm every position of the grid represents a cell of a certain specie. You will be able to observe how the initial chaos, in which the cells of the species are mixed, it gives step to a form of organization in which the cells of the same species form wide groups. They move, stretch and contract while they try to survive.If the program is left running during a time one of the species passes to be dominant, being able to make disappear to the other species. * Watch how the cells go from chaos to order in Donnelly Algorithm * Draw the cells using your finger and see how they grow and die during the time. * Choose one of the included patterns like the Glider spaceship and see its behavior * Speed up or speed down the Donnelly Algorithm by touching the right or left side of the screen
Size: 498.91 KB
Price: 0,00 €
Day of release: 0000-00-0