Luveelvoom's scripts and ideas

[synperiplanar]

1. What tools exist for Life that do not exist for INT but would be useful in INT?

a multiple-spark search program shouldn't be too hard, i'm thinking just a list of sparks and a pattern to run through like hotdogPi's script but with multiple sparks. should ideally be a Golly Python script.

[LuveelVoom]

1. What tools exist for Life that do not exist for INT but would be useful in INT?

a multiple-spark search program shouldn't be too hard, i'm thinking just a list of sparks and a pattern to run through like hotdogPi's script but with multiple sparks. should ideally be a Golly Python script.

Can you elaborate some more? I think M. I. Wright may have already made a program like this

[synperiplanar]

Can you elaborate some more? I think M. I. Wright may have already made a program like this

what do you need elaboration on? i'm going to sleep but you can PM me or DM me on Discord and i'll wake up the next morning (hopefully)

[LuveelVoom]

weird jls lls menu integration but it also seeds the sat solvers so it is kinda multithreaded yes anyway this is so bad. the jls dev hasnt been active for 5 years and lls is under an MIT license so this is fine right mods delete if im violating copyright law thx

[LuveelVoom]

Drift now has a sort by sparkiness option, which uses a surprisingly good heuristic. Add --sort sparky to the end of your command, or stick it in the config file with a different format that I don't feel like typing up atm

[hotcrystal0]

drift's must-reach option seems to be pretty buggy. I ran it with this input file:

Code: Select all

rule = B3/S23-a5
max-changed = 10
size = 6x6

max-gen = 30
max-steps = 3000000000

must-reach = p 14 6

skip = oscillator

pattern:
x = 34, y = 14, rule = B3/S23-a5History
34F$34F$34F$34F$34F$34F$9F5.B10.9F$9F4.A3.2A6.9F$9F3.A.A.A.A6.9F$9F2.
A2.A.A.A.A4.9F$9F2.2A.A.A.A.3A2.9F$9F5.A.A.A.A.A2.9F$9F16.9F$16.D!

Code: Select all

x = 34, y = 14, rule = B3/S23-a5History
34F$34F$34F$34F$34F$34F$9F5.B10.9F$9F4.A3.2A6.9F$9F3.A.A.A.A6.9F$9F2.
A2.A.A.A.A4.9F$9F2.2A.A.A.A.3A2.9F$9F5.A.A.A.A.A2.9F$9F16.9F$16.D!

(the singular state 2 is (14,6) which is the must-reach cell)

I already knew that a solution exists, though, namely this:

Code: Select all

x = 12, y = 11, rule = B3/S23-a5
2bo3b2o$bobobobo$o2bobobobo$2obobobob3o$3bobobobobo$2obobobobo$bo2bo2b
obo$bo6bo$2b6o$4bo$4b2o!

Code: Select all

x = 34, y = 18, rule = B3/S23-a5Super
34F$34F$34F$34F$34F$34F$9F5.B10.9F$9F4.A3.2A6.9F$9F3.A.A.A.A6.9F$9F2.
A2.A.A.A.A4.9F$9F2.2A.A.A.A.3A2.9F$9F5.A.A.A.A.A2.9F$9F2.2G.G.G.G.G4.
9F$12.G2.GD.G.G$12.G6.G$13.6G$15.G$15.2G!

Despite this, the search still returned no results even though there exists a pattern satisfying all the constraints.