Langton's Ant cellular automaton implemented in libGDX. The rules of Langton's ant is as follows:
- The world is made up of a grid of cells
- A cell can either be on or off
- If the ant is on an on cell it turns it off and turns left
- If the ant is off an on cell it turns it on and turns right
Interesting Videos:
- Langton's Ant - Numberphile
- Langton's Ant (extra footage) - Numberphile
- Langton's Ant (the 104 steps) - Numberphile
- Coding "Langton's Ant" Cellular Automaton in C++/ SFML
Some useful Links:
Watch/star to follow along with progress!
MIT License
Copyright (c) 2019 Matthew 'siD' Van der Bijl
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.