Gencols: Difference between revisions
m cat, formatting |
scrub the stub |
||
| Line 1: | Line 1: | ||
{{Software | |||
|name = gencols | |name = gencols | ||
|url = http://www.radicaleye.com/lifepage/gencols.txt | |url = http://www.radicaleye.com/lifepage/gencols.txt | ||
| Line 6: | Line 6: | ||
|platform = C | |platform = C | ||
}} | }} | ||
'''gencols''' is | '''gencols''' is an open source C program that enumerates and tests collisions and other [[pattern]] interactions in [[Conway's Game of Life|Life]], developed by [[Paul Callahan]] in {{year|1994}}. It works by generating interactions between pairs of patterns within a range of user-determined parameters, and filters the output for "interesting" objects (those with special properties). This includes, but is by no means limited to, collisions occurring between pairs of [[glider]]s. The program combines fast Life simulation code exploiting sparsity and bit parallelism with an enumerative search for collisions. It employs a sophisticated approach to choosing which collisions to enumerate, beyond the obvious approach of overlaying patterns at all sufficiently close translations from each other. For example, it eliminates almost all collisions that cannot be attained by patterns that are initially separated from each other. | ||
In {{year|2010}}, [[Paul Tooke]] modified gencols to work with [[isotropic non-totalistic]] rules.<ref name="post3254" /> | |||
==References== | ==References== | ||
| Line 20: | Line 22: | ||
==External links== | ==External links== | ||
* [https://github.com/conwaylife/gencols gencols on GitHub] | |||
* {{LinkForumThread|f=9|t=1284|title=gencols: techniques}} | * {{LinkForumThread|f=9|t=1284|title=gencols: techniques}} | ||
Revision as of 21:42, 29 December 2022
| gencols | |
| Homepage | Click here |
|---|---|
| Purpose | Search program to enumerate and test collisions and other pattern interactions |
| Created by | Paul Callahan |
| Platform | C |
gencols is an open source C program that enumerates and tests collisions and other pattern interactions in Life, developed by Paul Callahan in 1994. It works by generating interactions between pairs of patterns within a range of user-determined parameters, and filters the output for "interesting" objects (those with special properties). This includes, but is by no means limited to, collisions occurring between pairs of gliders. The program combines fast Life simulation code exploiting sparsity and bit parallelism with an enumerative search for collisions. It employs a sophisticated approach to choosing which collisions to enumerate, beyond the obvious approach of overlaying patterns at all sufficiently close translations from each other. For example, it eliminates almost all collisions that cannot be attained by patterns that are initially separated from each other.
In 2010, Paul Tooke modified gencols to work with isotropic non-totalistic rules.[1]
References
- ↑ Paul Tooke (August 23, 2010). Adapting Gencols (discussion thread) at the ConwayLife.com forums
External links
- gencols on GitHub
- gencols: techniques (discussion thread) at the ConwayLife.com forums