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) |
→wwei: I later realized that ikpx2 *does* know how to propagate the consequences of a guess to a row that qfind hasn't even considered yet; it's just that it does so implicitly through SAT solvers instead of doing so explicitly by being a SAT solver, the way that JLS does. |
||
| Line 14: | Line 14: | ||
==[[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 is the only one that understands how to propagate the consequences of a guess to a row that | {{cquote|JLS is the only one that understands 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}} | ||
Revision as of 21:31, 14 May 2024
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 is the only one that understands 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