3 ms·
You can also program your own quick copy in C# http://www.primaryobjects.com/CMS/Article106.aspx http://www.primaryobjects.com/CMS/Article106.aspx
by dreepers10 16y ago
You can also program your own quick copy in C# http://www.primaryobjects.com/CMS/Article106.aspx http://www.primaryobjects.com/CMS/Article106.aspx
- eru 16y agoAt this size, you may need a hash-life to see it run at any speed. That's not as quick to write as a naive algorithm--but of course still doable.
- lisper 16y agoYou will DEFINITELY need hashlife. In fact, one of the indications of the complexity of this pattern is how slowly it runs even in hashlife. It's instructive to compare the speed at which gemini runs with the speed at which the demo patterns that come with Golly run. At maximum speed, Golly routinely cranks out so many generations that it requires exponential notation to display the number. Gemini by comparison runs very slowly even at maximum speed. This fact alone makes it interesting. It is not easy to design a pattern that Golly can't optimize the bejesus out of (try it).