Update
This commit is contained in:
parent
b3106e1ec8
commit
a5acdddb82
16 changed files with 1921 additions and 1672 deletions
|
@ -1,6 +1,6 @@
|
|||
# Langton's Ant
|
||||
|
||||
Langton's ant 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 [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).
|
||||
|
||||
**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.
|
||||
|
||||
|
@ -151,7 +151,9 @@ int main(void)
|
|||
|
||||
## See Also
|
||||
|
||||
- [Resnick's termite](resnicks_termite.md)
|
||||
- [game of life](game_of_life.md)
|
||||
- [turmite](turmite.md)
|
||||
- [rule 110](rule_110.md)
|
||||
- [cellular automaton](cellular_automaton.md)
|
||||
- [cellular automaton](cellular_automaton.md)
|
||||
- [turtle graphics](turtle_graphics.md)
|
Loading…
Add table
Add a link
Reference in a new issue