Golly (program)
Tool for simulating cellular automata
From Wikipedia, the free encyclopedia
Golly is a tool for the simulation of cellular automata. It is free open-source software written by Andrew Trevorrow and Tomas Rokicki;[3] 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,[4] and that is fast enough to simulate some patterns for 232 or more time units.[5] It also includes a large library of predefined patterns in Conway's Game of Life and other rules.[6]
| Golly | |
|---|---|
Screenshot of Golly | |
| Initial release | July 2005[1] |
| Stable release | v5.0
/ October 2025[1] |
| Preview release | v5.0b1
|
| Written in | C++ (wxWidgets) |
| Operating system | Linux, FreeBSD, OpenBSD, Windows, OS X, iOS, Android |
| License | GNU GPLv2[2] |
| Website | golly |
| Repository | sourceforge |