User:DroneBetter/esoteric search program knowledge: Difference between revisions
Jump to navigation
Jump to search
DroneBetter (talk | contribs) create (repository of deep wisdom for the future dominant species that unearth our civilisation's search programs after we make Earth uninhabitable for ourselves by searching too much) |
DroneBetter (talk | contribs) m wonderful excellentmost piece of Sokwadvice regarding pruning the lifesrc tree to avoid disjoint results when looking for nonminimal ones |
||
| (2 intermediate revisions by one other user not shown) | |||
| Line 5: | Line 5: | ||
==observations== | ==observations== | ||
*qfind's width-exhausting capability is surpassed by JLS's at high speeds and low denominators, both seem to be surpassed by ikpx2 for extremely low denominators (ie. c/2 in rules such as {{rl|2×2}} where they are hard to find), and LSSS (nonexhaustive though it may be) is good for finding examples of speeds when one doesn't care about width but existence | *qfind's width-exhausting capability is surpassed by JLS's at high speeds and low denominators, both seem to be surpassed by ikpx2 for extremely low denominators (ie. c/2 in rules such as {{rl|2×2}} where they are hard to find), and LSSS (nonexhaustive though it may be) is good for finding examples of speeds when one doesn't care about width but existence | ||
==[[Darren Li]]== | ==[[Darren Li]]== | ||
*despite the fact that it says it is 'adaptive widening,' ikpx2 moving on from a width does in fact imply it has been searched exhaustively (and, due to its concatenation of subsections of different symmetry, in fact means it has searched a superset of the width) | *despite the fact that it says it is 'adaptive widening,' ikpx2 moving on from a width does in fact imply it has been searched exhaustively (and, due to its concatenation of subsections of different symmetry, in fact means it has searched a superset of the width) | ||
| Line 12: | Line 13: | ||
{{cquote|Once [qfind's] deepening exceeds like, 50, ikpx2 is unilaterally faster - the only problem is that ikpx2's memory usage is unbounded}} | {{cquote|Once [qfind's] deepening exceeds like, 50, ikpx2 is unilaterally faster - the only problem is that ikpx2's memory usage is unbounded}} | ||
{{cquote|qfind is [expletive] cracked actually i need to study how its lookahead works under a microscope}} | {{cquote|qfind is [expletive] cracked actually i need to study how its lookahead works under a microscope}} | ||
==[[wwei23|wwei]]== | ==[[wwei23|wwei]]== | ||
*generally, JLS is better than ikpx2 for odd-period diagonal spaceships since it is capable of exploiting diagonal symmetry (not implemented in ikpx2), but ikpx2 is better for even ones since it is capable of diagonal glide-symmetry (apparently, JLS is also, but it only works for oscillators) | *generally, JLS is better than ikpx2 for odd-period diagonal spaceships since it is capable of exploiting diagonal symmetry (not implemented in ikpx2), but ikpx2 is better for even ones since it is capable of diagonal glide-symmetry (apparently, JLS is also, but it only works for oscillators) | ||
{{cquote|JLS | {{cquote|JLS and ikpx2 understand how to propagate the consequences of a guess to a row that qfind hasn't even <i>considered</i> yet}} | ||
==[[Adam P. Goucher|apg]] (per wwei)== | ==[[Adam P. Goucher|apg]] (per wwei)== | ||
*the algorithm JLS uses is {{LinkWikipedia|DPLL_algorithm|name=DPLL|nobullet=no|nosuffix=no}} | *the algorithm JLS uses is {{LinkWikipedia|DPLL_algorithm|name=DPLL|nobullet=no|nosuffix=no}} | ||
==[[User:Sokwe|Sokwe]]== | |||
*how to avoid small objects congesting searches when looking for nonminimal results:<ref>{{CiteDiscord|channel=tools|id=1368083651912273952|author=Sokwe|date=May 3, 2025}}</ref> | |||
{{cquote|Specifically, when [<span class{{=}}"plainlinks">[https://conwaylife.com/forums/viewtopic.php?f{{=}}2&t{{=}}2031&p{{=}}98433#p98433 Nicolay Beluchenko's version of WLS (WLS 6.3)]</span>] finds a complete spaceship, it will only continue on that branch if the subsequent pattern interacts with the spaceship. For example, it can be used to find complete sets of spaceships for certain combinations of speed and width/height (when that set is finite).}} | |||
==references== | |||
<references /> | |||
Latest revision as of 12:44, 4 May 2025
this page is intended to store information and quotation for referenciation and also a small amount of opinionation in humoracious juxtapositation
all quotes herein are true and real and unadulterated and I may be trusted
observations
- qfind's width-exhausting capability is surpassed by JLS's at high speeds and low denominators, both seem to be surpassed by ikpx2 for extremely low denominators (ie. c/2 in rules such as 2×2 where they are hard to find), and LSSS (nonexhaustive though it may be) is good for finding examples of speeds when one doesn't care about width but existence
- despite the fact that it says it is 'adaptive widening,' ikpx2 moving on from a width does in fact imply it has been searched exhaustively (and, due to its concatenation of subsections of different symmetry, in fact means it has searched a superset of the width)
- as far as SAT-solver-utilisers go, ikpx2 is better than LLS due to 'automation of the usage of said SAT solvers'
| “ | ikpx2 is literally just qfind but with ridiculously high deepening, and qfind is just gfind with ridiculously high deepening | ” |
| “ | the pecking order for spaceships is definitely ikpx2 > qfind > jls | ” |
| “ | Once [qfind's] deepening exceeds like, 50, ikpx2 is unilaterally faster - the only problem is that ikpx2's memory usage is unbounded | ” |
| “ | qfind is [expletive] cracked actually i need to study how its lookahead works under a microscope | ” |
- generally, JLS is better than ikpx2 for odd-period diagonal spaceships since it is capable of exploiting diagonal symmetry (not implemented in ikpx2), but ikpx2 is better for even ones since it is capable of diagonal glide-symmetry (apparently, JLS is also, but it only works for oscillators)
| “ | JLS and ikpx2 understand how to propagate the consequences of a guess to a row that qfind hasn't even considered yet | ” |
apg (per wwei)
- the algorithm JLS uses is DPLL
- how to avoid small objects congesting searches when looking for nonminimal results:[1]
| “ | Specifically, when [Nicolay Beluchenko's version of WLS (WLS 6.3)] finds a complete spaceship, it will only continue on that branch if the subsequent pattern interacts with the spaceship. For example, it can be used to find complete sets of spaceships for certain combinations of speed and width/height (when that set is finite). | ” |
references
- ↑ Sokwe (May 3, 2025). Message in #tools on the Conwaylife Lounge Discord server