miércoles, 15 de abril de 2015
The Game of Life
Conway's Game of Life
From Wikipedia, the free encyclopedia
The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970.[1]
The "game" 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 or, for advanced players, by creating patterns with particular properties.
[1] Gardner, Martin (October 1970). Mathematical Games – The fantastic combinations of John Conway's new solitaire game "life". Scientific American 223. pp. 120–123. ISBN 0-89454-001-7.
domingo, 3 de octubre de 2010
viernes, 26 de septiembre de 2008
domingo, 24 de febrero de 2008
Sink
Introduction
Cellular automaton consist of an infinite number of cells, which have a finite number of states. These states change depending on the state of their neighbours. Each cell has the same rule for updating.
Sink
In this program, the cells can have two states: 0 or 1. This state depends on the state of their neighbours and the place where the cell is.
These are the default update rules:
. If both the cell and path are 1, and the cell has eight neighbours, the cell becomes 0.
. If the cell is 1, path is 0 and the cell has more than three neighbours, the cell changes to 0.
. If both the cell and path are 0, and the cell has more than three neighbours, the cell changes to 1.
. If the cell is 0, path is 1 and the cell has more than two neighbours, the cell becomes 1.
The user can change all the parameters of the program in the configuration menu.
Download:
Sink for Windows - sink_Windows.zip --> To execute the program simply unzip the package, go to sinkwindows/sink/bin/Debug and double click on sink.exe
Sing for Linux - sink_Linux.tar.gz --> To execute the program extract all files from the package, go sink/sink/bin/Debug and execute this command: "mono sink.exe"
Cellular automaton consist of an infinite number of cells, which have a finite number of states. These states change depending on the state of their neighbours. Each cell has the same rule for updating.
Sink
In this program, the cells can have two states: 0 or 1. This state depends on the state of their neighbours and the place where the cell is.
These are the default update rules:
. If both the cell and path are 1, and the cell has eight neighbours, the cell becomes 0.
. If the cell is 1, path is 0 and the cell has more than three neighbours, the cell changes to 0.
. If both the cell and path are 0, and the cell has more than three neighbours, the cell changes to 1.
. If the cell is 0, path is 1 and the cell has more than two neighbours, the cell becomes 1.
The user can change all the parameters of the program in the configuration menu.
Download:
Sink for Windows - sink_Windows.zip --> To execute the program simply unzip the package, go to sinkwindows/sink/bin/Debug and double click on sink.exe
Sing for Linux - sink_Linux.tar.gz --> To execute the program extract all files from the package, go sink/sink/bin/Debug and execute this command: "mono sink.exe"
Suscribirse a:
Entradas (Atom)
