Gencols: Difference between revisions

From LifeWiki
Jump to navigation Jump to search
Confocal (talk | contribs)
m simplify
Confocal (talk | contribs)
post135352
Line 11: Line 11:
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.


In {{year|2010}}, [[Paul Tooke]] modified gencols to work with [[isotropic non-totalistic]] rules.<ref name="post3254" />
In {{year|2010}}, [[Paul Tooke]] modified gencols to work with [[isotropic non-totalistic]] rules.<ref name="post3254" /><ref name="post135352" />


==References==
==References==
Line 21: Line 21:
|author = Paul Tooke
|author = Paul Tooke
|date  = August 23, 2010
|date  = August 23, 2010
}}</ref>
<ref name="post135352">{{LinkForumThread
|format = ref
|p      = 135352
|title  = Re: Script request thread
|author = Matthias Merzenich
|date  = August 28, 2021
}}</ref>
}}</ref>
</references>
</references>

Revision as of 07:16, 26 March 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

  1. ↑ Paul Tooke (August 23, 2010). Adapting Gencols (discussion thread) at the ConwayLife.com forums
  2. ↑ Matthias Merzenich (August 28, 2021). Re: Script request thread (discussion thread) at the ConwayLife.com forums