Gencols: Difference between revisions
post135352 |
m links/formatting |
||
| Line 7: | Line 7: | ||
|platform = C | |platform = C | ||
}} | }} | ||
'''gencols''' is an open source C program that enumerates and tests | '''gencols''' is an open source C program that enumerates and tests [[collision]]s and other [[pattern]] interactions in [[Conway's Game of Life|Life]], developed by [[Paul Callahan]] in {{year|1994}}. | ||
The program 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. | The program 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. | ||
| Line 16: | Line 16: | ||
<references> | <references> | ||
<ref name="post3254">{{LinkForumThread | <ref name="post3254">{{LinkForumThread | ||
|format = ref | |||
|p = 3254 | |p = 3254 | ||
|title = Adapting Gencols | |title = Adapting Gencols | ||
|author = Paul Tooke | |author = Paul Tooke | ||
Latest revision as of 01:36, 14 April 2023
|
This article is a stub. You can help LifeWiki by expanding it. missing examples of use, when to use this software tool vs. when to use something else |
| 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.
The program 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][2]
References
- ↑ Paul Tooke (August 23, 2010). Adapting Gencols (discussion thread) at the ConwayLife.com forums
- ↑ Matthias Merzenich (August 28, 2021). Re: Script request thread (discussion thread) at the ConwayLife.com forums
External links
- Program to search for collisions in Conway's Life (description) at Paul Callahan's Page of Conway's Life Miscellany
- gencols on GitHub
- gencols: techniques (discussion thread) at the ConwayLife.com forums