Script request thread

[MDA]

[…]

[…]

[…] are there any search programs which create XWSS helices for a given speed?

If such programs do exist, could anyone provide an example of one?

Here's one:
https://conwaylife.com/forums/viewtopic.php?t=1267
It's written in perl, but there's a python version as well which I haven't been able to get to work.

Looking at the code, it seems to have been written assuming Golly supports Perl scripting, but that doesn’t seem to be true.

Could you please provide the Python version so I can try to get it working?

[I6_I6]

[...]
Could you please provide the Python version so I can try to get it working?

It's at the bottom of the thread.

EDIT (Aug 6):
Can somebody make a script which can identify a pattern's outer-totalistic rulespace in which it evolves in the same way as in the given rule for a set number of generations? (Preferably Golly-compatible.) I'm trying to track down the sources of the various uncited spaceships in the Star Trek article. I suspect they all came from gliderDB, meaning somebody likely posted it in the Spaceships in Life-like Cellular Automata thread. And since each entry includes the outer-totalistic rulespace of the spaceship (usually), I can use that to try and find the original post containing it.

I sure hope the phpBB forums search engine doesn't troll me or anything! That sort of thing would NEVER happen.
*hint* Subtle forshadowing *hint*

[Docsy]

I think a cool idea for a script would be a script that helps you find rules where some basic pattern occurs the most often in random soups. Like you input a base pattern, a min and max rule, a soup size, and a number of generations to check, and it'll run soups for rules across the space to find one where a large number of soups had the pattern develop. I think if it used genetic algorithms or simulated annealing it could be especially effective, since there is some real topology to rulespaces since many rules 1-3 transitions from life still have common gliders, but just random search could still be intriguing.

[NNlk05]

I think a cool idea for a script would be a script that helps you find rules where some basic pattern occurs the most often in random soups. Like you input a base pattern, a min and max rule, a soup size, and a number of generations to check, and it'll run soups for rules across the space to find one where a large number of soups had the pattern develop. I think if it used genetic algorithms or simulated annealing it could be especially effective, since there is some real topology to rulespaces since many rules 1-3 transitions from life still have common gliders, but just random search could still be intriguing.

EPE can (somewhat) do that by making a low cell count pattern (ex: obo!) turn into the pattern you want. This is how “snowflake” rules work.

[Docsy]

That is a neat idea for finding some rules, but it seems pretty limited in application for the particular purpose.