Well neither did I. So I may have needed the 21 GB, and for all I knew it may have not been enough
It would have been quite frustrating for the run to have to terminate due to running out of array space. Then I'd need to start it all over again with a bigger array. Now do you see why I used 21 GB?
That's the maximum I had available without closing a lot of running programs. I have 32 GB total.
Yeah but it's such a big array that there might not be room for it to be reallocated contiguously.
I do dynamic buffer resizing in my regex engine. Doubles every time it needs to expand.
Anyway I didn't want to introduce potential bugs in my program by over-complicating it with pruning or reallocation. Since I didn't know the result ahead of time, I'd have nothing to compare against.
Trapped at step 12899744968 at position 12851850258 (max visited: 12950157910; max examined: 12951523532)
@dzaima @Mego seems like they are supported: "The final rule, Larger than Life, relies on large neighborhoods; these are supported by Golly 3.0 (up to range 500)." source. you might have to fiddle a bit though
The problem I am trying to solve is this
I have have large collection of list of strings.
There are more than 500 collections. Each collection contains 1 or more strings (up to 1000)
Many of these strings contain common phrases
The Goal - minimize the database size.
Database structure
Eac...
@ASCII-only if i'm reading that correctly, that's only for neighbor count rules though
2 hours later…
Anonymous
13:47
@EriktheOutgolfer What do you mean? It looks fine to me
Anonymous
@ASCII-only Scroll up - bolded rules are supported, non-bolded are not. That page is a roadmap. While the core functionality may be in Golly for large neighborhoods, it does not support custom rules using them.
Idea for an esolang: Markdown:
> comment
[array](indexing)
> assignment:
[name][1]
[1]: 42
> addition:
plus *plus*
> subtraction:
minus _minus_
> string:
`text`
It will launch as the most frequently used programming language on SE!
The Challenge
Given an integer input x where 1 <= x <= 255, return the results of powers of two that when summed give x.
Examples
Given the input:
86
Your program should output:
64 16 4 2
Input:
240
Output:
128 64 32 16
Input:
1
Output:
1
Input:
64
Output:
64
Scoring
T...
The problem I am trying to solve is this
I have have large collection of list of strings.
There are more than 500 collections. Each collection contains 1 or more strings (up to 1000)
Many of these strings contain common phrases
The Goal - minimize the database size.
Database structure
Eac...
The Challenge
Given an integer input x where 1 <= x <= 255, return the results of powers of two that when summed give x.
Examples
Given the input:
86
Your program should output:
64 16 4 2
Input:
240
Output:
128 64 32 16
Input:
1
Output:
1
Input:
64
Output:
64
Scoring
T...
How does this Programming Puzzles & Code Golf work?
Just curious because I don't really know what this is and I want to fined out...
