Update
This commit is contained in:
parent
2c518b91ca
commit
3816e78230
19 changed files with 1805 additions and 1802 deletions
|
@ -1,6 +1,6 @@
|
|||
# Langton's Ant
|
||||
|
||||
Langton's ant (also *virtual ant* or *vant*) is a simple [zero player](zero_player.md) [game](game.md) and [cellular automaton](cellular_automaton.md) simulating the behavior of an ant that behaves according to extremely simple rules but nevertheless builds a very complex structure. It is similar to [game of life](game_of_life.md). Langton's ant is **[Turing complete](turing_complete.md)** (it can be used to perform any computation that any other computer can).
|
||||
Langton's ant (also *virtual ant* or *vant*) is a [simple](minimalism.md) [zero player](zero_player.md) [game](game.md) and [cellular automaton](cellular_automaton.md) simulating the behavior of an ant that behaves according to very simple rules but nonetheless builds an impressively complex structure. It may be roughly likened to [game of life](game_of_life.md). Langton's ant is **[Turing complete](turing_complete.md)** (it can be used to carry out any computation that any other computer can).
|
||||
|
||||
**Rules**: in the basic version the ant is placed in a square grid where each square can be either white or black. Initially all squares are white. The ant can face north, west, south or east and operates in steps. In each step it does the following: if the square the ant is on is white (black), it turns the square to black (white), turns 90 degrees to the right (left) and moves one square forward.
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue