Recent content by xyzzy

  1. X

    The "Request an Alg" Thread

    R and U generate only 1/48 of all possible last layer cases; this subset is called 2GLL.
  2. X

    Goal... Reached... Mark thing.

    Go with whatever you feel like, but keep it fixed and don't adjust your metric, at least until you've hit your current goal. If you've already decided on sub-35 ao100 as your goal, you don't get to cheat and pretend it counts when you get a sub-35 ao50. That's not good enough! And when you do...
  3. X

    [Help Thread] One-Handed Solving Discussion

    Yes: try (r U r' U2 R U2 R' U2 r U' r') or (R' U2 r U' r' U2 r U r' U2 R). (These are also faster for 2H so you should learn them regardless!) But also just start learning full OLL, imo. Your F2L is relatively solid (about as fast as mine, and I average 22-23) but you're wasting a lot of time...
  4. X

    Can we solve a 3x3 each doing only one move?

    L B F' U' F2 U2 R2 R' U R U R L' U L2 R' U L' L' U' U2 L U L' U' L U2 L' U L U' U B U' B' U B' B B U' Sure, but you're counting on at least three people knowing that alg in order to not mess it up. (It's mostly the same as one of the usual OLL algs, but what if someone does the mirror in an...
  5. X

    Upcoming puzzles

    (off-topic) For this thread and this thread alone, please don't quote a full post if it has an Instagram or YouTube embed. Those are very slow to load because Facebook and Google are terrible at making fast websites.
  6. X

    Loopover god's number upper bounds: 4×4 (25 STM), asymptotics (O(N log^2 N)), etc.

    So, I said this: >I think I have a way of bringing the upper bound down to something like O(n^2 (log n)^4) Turns out my original idea didn't work, but I made it stupider and that gave me a bound of O(n^2\log^2n). And unlike most of my other theoryposts, this one comes with code. It might be...
  7. X

    Watch thread bug

    (i) This isn't related to the topic of this thread. There already are threads for you to report bugs (and this thread should be merged into those…?). (ii) This is intentional. Posts in the Off-topic Discussions subforum do not show up under What's New or the home page.
  8. X

    Can we solve a 3x3 each doing only one move?

    I mean, that's a 7-move ZBLS case, and you don't even need to AUF…
  9. X

    Can we solve a 3x3 each doing only one move?

    Maybe make it something like "you have to wait until 5 moves have been made by other people before you can post again" or something like that. L B F' U' F2 U2 R2 R' U R U R L' U L2 R' U L' L' U L U L' U' L U2 L' U L
  10. X

    Accomplishment Thread

    Random PB ao12 (was 12.40 for months until two weeks ago, then it dropped to 12.25 yesterday and further to 11.82 today): Generated By csTimer on 2019-09-11 (solving from 2019-09-11 20:59:52 to 2019-09-11 21:07:44) avg of 12: 11.818 Time List: 4560. 10.000 D2 F2 U2 L B2 D2 U2 L2 R D2 U2 F D'...
  11. X

    Loopover god's number upper bounds: 4×4 (25 STM), asymptotics (O(N log^2 N)), etc.

    The tl;dr version is the thread title. ;) Explanations are, by their very nature, the exact opposite of tl;dr, so in case that's what you really wanted: God's number is the maximum among optimal solution lengths: GN := max {min {length of S | S is a solution to P} | P is a puzzle state}. But...
  12. X

    [Help Thread] One-Handed Solving Discussion

    See the last few pages of posts in this thread. For the most part, don't bother with table abuse. Table abuse for stuff like MU H perm or Z perm is fine, and obviously if you use Roux you can (and probably should) table-abuse LSE too, but in general using the table is a crutch and can prevent...
  13. X

    A Collection of Algorithms

    OLL 55 (the case with three bars) with diag CP for 4×4×4: z' U r' U2 r U' L2 U r' U2 r U' z Essentially just the standard alg F U' R2 D R' U2 R D' R2 U F' modified to be 3-gen because those D moves are annoying on big cubes. You could use this on 6×6×6 too, but I don't know whether it's better...
  14. X

    Loopover god's number upper bounds: 4×4 (25 STM), asymptotics (O(N log^2 N)), etc.

    Loopover = this game; STM = single-tile metric (the one Loopover implementations use to count moves); MTM = multi-tile metric (a seemingly more sensible choice of metric). STM bound of 26 moves is one move less than the best I could find (27 according to this spreadsheet); MTM bound has not...
Top