Golly is a tool for the simulation of cellular automata. It is free open-source software written by Andrew Trevorrow and Tomas Rokicki;[4] it can be scripted using Lua[1] or Python. It includes a hashlife algorithm that can simulate the behavior of very large structured or repetitive patterns such as Paul Rendell's Life universal Turing machine,[5] and that is fast enough to simulate some patterns for 232 or more time units.[6] It also includes a large library of predefined patterns in Conway's Game of Life and other rules.[7]
Initial release | July 2005[1] |
---|---|
Stable release | v4.2
/ August 2022[1] |
Preview release | v4.3b1
/ 16 March 2024[2] |
Repository | sourceforge |
Written in | C++ (wxWidgets) |
Operating system | Linux, FreeBSD, OpenBSD, Windows, OS X, iOS, Android |
License | GNU GPLv2[3] |
Website | golly |