ConwayLife.com

drc wrote:Also, you should probably update to the latest apgsearch, cause you submitted 3 hauls with incorrect names

if (c == 118) {
    c = 110;
}

Catagolue wrote: x = 16, y = 16, rule = B34aj/S2-a35v
booobbbbbbbbbobb$
oobboobooobboobo$
bbbbobbbbbbooobb$
boboboboooobbbbb$
bbbbboooboobobob$
bbbooobbbobobooo$
bboobbbobbbbooob$
obbbbbboboooobob$
boobbobooboooooo$
obobooooooobbooo$
oooobbobbobbbboo$
oooobboboboboobo$
oboooobooooboboo$
bobooooobboooobo$
bobboboobooobbob$
obobobbobbobobob!

calcyman wrote:

drc wrote:
which seems to save Saku's rule:

https://catagolue.appspot.com/census/b3 ... 5v/C1/xp17

calcyman wrote:Erm... why is this called z_LINEAR rather than zz_LINEAR?

https://catagolue.appspot.com/object/z_ ... 3678s34678

This has the worrying implication that +0.*i is actually forked from an older (buggier) version of apgsearch instead of the latest version.

A for awesome wrote:

calcyman wrote:Erm... why is this called z_LINEAR rather than zz_LINEAR?

https://catagolue.appspot.com/object/z_ ... 3678s34678

This has the worrying implication that +0.*i is actually forked from an older (buggier) version of apgsearch instead of the latest version.

I'm sorry about that. I had no idea that there was any bug in the infinite-growth detection; I tried to paste all changes between 1.x from 0.x when I made +0.2Ni, but it appears I missed something. What is the bug, anyway?

def powerlyse(stepsize, numsteps, ruletype):
    if ruletype:
        g.setalgo("HashLife")
    else:
        g.setalgo("RuleLoader")
    g.setbase(2)
    g.setstep(stepsize)

    poplist = [0]*numsteps

    poplist[0] = int(g.getpop())

    pointlist = []

    for i in xrange(1, numsteps, 1):

        g.step()
        poplist[i] = int(g.getpop()) + poplist[i-1]

        if (i % 50 == 0):

            g.fit()
            g.update()

        if (i > numsteps/2):

            pointlist.append((math.log(i),math.log(poplist[i]+1.0)))

    power = regress(pointlist)

    if (power < 1.10):
        return "unidentified"
    elif (power < 1.65):
        return "zz_REPLICATOR"
    elif (power < 2.05):
        return "zz_LINEAR"
    elif (power < 2.8):
        return "zz_EXPLOSIVE"
    else:
        return "zz_QUADRATIC"

drc wrote:Catagolue has become completely unusable. Everytime I put it on in the background while watching youtube, it freezes my entire computer for no reason.

drc wrote:I censused a really long rule, so now the format is off.

drc wrote:Catagolue has become completely unusable. Everytime I put it on in the background while watching youtube, it freezes my entire computer for no reason.

calcyman wrote:How much memory do you have, and what's your operating system? It seems fine on my laptop (both Windows 7 and Kali Linux) with 6 gigabytes of memory. (Basically my laptop only came with 2 gigabytes, which was horribly insufficient even for banal tasks, so I disassembled it and inserted an extra 4-gigabyte memory card.)

David wrote:My computer has 4 cores and 8 threads, so I've inputed -p 8. Is it wrong? It runs too slow.

Add: How can I dismiss the process manually?

• SSE2 (like apgnano)
• AVX2 (which is theoretically twice as fast, but only exists on modern CPUs)
• GPU

David wrote:apgnano doesn't work when I enter my payosha256 key.

drc wrote:Apgnano has slowed down from 1400 to 400 in a day. What happened?

calcyman wrote:Yesterday evening at 19:44, Catagolue celebrated its first anniversary.

At this point it had 50002 billion objects in the b3s23/C1 census. I was hoping to pass the 50 * 10^12 object mark within the first year of operation, and we succeeded by the narrowest of margins.

I've implemented an AVX2 Life algorithm which is about 25% faster than the SSE counterpart, by the way, and the assembly code is generated by a Python script instead of being hardcoded into the C++ source. Using a suitable Boolean circuit minimisation algorithm (such as Quine-McCluskey), this could be extended to allow support for arbitrary outer-totalistic rules whilst being marginally faster than even apgnano.

Apple Bottom wrote:Congratulations, that's awesome news!

Can't wait to try out that new, faster algorithm, either. I take it that's gonna land in the gitlab repo soon?

• The 5 inputs are the state of the centre cell together with the 4 bits of the neighbour count written in binary (note: the central cell is included in the neighbour count).
• The 1 output should be the next state of the centre cell.
• The circuit can consist of AND, OR, XOR and AND-NOT gates.
• The circuit must have a width <= 7 (although I might be able to increase this to 10 if necessary).

drc wrote:Is there any way to optimise apgsearch? It uses 25% of cpu, and it does 1400/sec at most. I've seen people upload hauls of 40000000 in a matter of minutes?