Search found 14 matches
- August 25th, 2016, 9:27 pm
- Forum: Scripts
- Topic: RLE problems
- Replies: 2
- Views: 3099
Re: RLE problems
Now it works, sorry to disturb. Perhaps Golly was just re-opening a bad .rle file and ignoring the more recent corrected version.
- August 25th, 2016, 9:17 pm
- Forum: Scripts
- Topic: RLE problems
- Replies: 2
- Views: 3099
Re: RLE problems
The above rle displays correctly in LifeViewer but not in Golly.
Possible problem in converting from unix to windows text file format?
Possible problem in converting from unix to windows text file format?
- August 25th, 2016, 9:13 pm
- Forum: Scripts
- Topic: RLE problems
- Replies: 2
- Views: 3099
RLE problems
From a standalone Fortran program I'm trying to write an rle file. But what I end up with displays wrongly in Golly, each line is offset two cells to the right from the line above, so for some reason Golly is misplacing all my line ends. Help, please. A typical rle is: x = 2048, y = 2048, rule = B3/...
- August 6th, 2016, 10:05 pm
- Forum: Scripts
- Topic: Golly could be faster?
- Replies: 9
- Views: 7756
Re: Golly could be faster?
Confirmed that 6.0 seconds for 20,000 generations of this problem is possible in standalone Fortran (without multi-threading). As against 38 seconds for Golly hash hyperspeed on same computer. Adding in search for transients "queen bee" and "switch engine" at every generation increases this to a ple...
- August 3rd, 2016, 4:32 pm
- Forum: Scripts
- Topic: Golly could be faster?
- Replies: 9
- Views: 7756
Re: Golly could be faster?
My standalone still isn't working - it's an annoying feature of the way that the compiler optimises fortran that a program that runs perfectly with debugging in place immediately misbehaves when debugging is switched off. I've confirmed the extreme misbehaviour of Quicklife for this problem, and gre...
- August 2nd, 2016, 8:00 pm
- Forum: Scripts
- Topic: Golly could be faster?
- Replies: 9
- Views: 7756
Re: Golly could be faster?
Something strange is going on at 2048x2048 with QuickLife in a bounded grid. @mollwollfumble As you can see from the above results, if you must use a bounded grid then you can get reasonable performance from Golly if you use HashLife. But if you want to run lots of trials then you should switch to ...
- July 28th, 2016, 10:54 pm
- Forum: Scripts
- Topic: Golly could be faster?
- Replies: 9
- Views: 7756
Re: Golly could be faster?
Use HashLife and don't use a bounded grid. EDIT: Note that a bounded grid is not Golly's "default setting". The default rules in all algos don't specify a bounded grid. For the particular problem mentioned (2048x2048 toroidal grid) it would be easy -- or relatively easy at least -- to get an algori...
- July 27th, 2016, 9:24 pm
- Forum: Scripts
- Topic: Golly could be faster?
- Replies: 9
- Views: 7756
Golly could be faster?
Am new here. First time I ran Golly I thought "cripes that's fast", and it is, but not always. Golly (with default settings) handles "ash" extremely badly. I just wrote a 37 line standalone Fortran program, with no optimisation at all apart from the O3 compiler tag. On my old 32-bit computer it runs...
- July 27th, 2016, 7:38 pm
- Forum: General Discussion
- Topic: Thread for basic questions
- Replies: 4788
- Views: 1226159
Re: Thread for basic questions
House is pretty close. x = 5, y = 12, rule = LifeHistory 2A.2A$A3.A$.3A7$2D.2D$D3.D$.3D! Yes, it makes an exact copy of itself with buffer space around, but that first copy doesn't live long enough without stabilisation (such as a block train) so doesn't quite qualify. Any other small grandfather p...
- July 24th, 2016, 11:45 pm
- Forum: General Discussion
- Topic: Thread for basic questions
- Replies: 4788
- Views: 1226159
Re: Thread for basic questions
Switch Engine and Queen Bee are two small patterns that have finite lifetime but make copies of themselves that live long enough to make another copy of the original.
Are there others like that?
Are there others like that?
- July 21st, 2016, 6:56 pm
- Forum: Patterns
- Topic: Thread for your unsure discoveries
- Replies: 3235
- Views: 1489095
Re: Thread for your unsure discoveries
To find out, write a script that generates all symmetrical patterns, or all symmetrical polyominoes, that fit inside 5x7, and runs them all to see when they stabilize, and keeps track of the longest-running one. Well, since I already pretty much had the code to try this... Turns out that pattern is...
- July 21st, 2016, 1:28 am
- Forum: Patterns
- Topic: Thread for your unsure discoveries
- Replies: 3235
- Views: 1489095
Re: Thread for your unsure discoveries
On the android ap "The game of life" there is a beautiful Methuselah called "coeur" by "Joshua". I don't see it on lifewiki. Is it a variant of some other Methuselah? It's symmetric, fits in a 7*5 bounding box, is connected, and contains 15 cells. I don't know how many steps it runs for, but it pro...
- July 20th, 2016, 7:09 pm
- Forum: Patterns
- Topic: Thread for your unsure discoveries
- Replies: 3235
- Views: 1489095
Re: Thread for your unsure discoveries
On the android ap "The game of life" there is a beautiful Methuselah called "coeur" by "Joshua". I don't see it on lifewiki. Is it a variant of some other Methuselah? It's symmetric, fits in a 7*5 bounding box, is connected, and contains 15 cells. I don't know how many steps it runs for, but it prod...
- July 18th, 2016, 8:15 pm
- Forum: General Discussion
- Topic: Thread for basic questions
- Replies: 4788
- Views: 1226159
Re: Thread for basic questions
Hi, I'm a newby, although I've been a fan since the 70s when Martin Gardner published the first article about it in Scientific American. An equation recently appeared in http://www.scientificamerican.com/article/new-equation-tallies-odds-of-life-beginning1/ It occurred to me that this equation could...