Welcome to the Speedsolving.com, home of the web's largest puzzle community! You are currently viewing our forum as a guest which gives you limited access to join discussions and access our other features.

That is part of the plan, not to write out an alg for every possible letter pair but for I think the 256 unique cases for adjacent face and opposite face comms. I don't think you even need a comms list for it to be honest, it boils down to the same few algorithms:

U r U' [l2] U r' U' [l2] - an M2 variant
r U2 r' [d2] r U2 r' [d2] - typical opposite face case
r U r' [d'] r U' r' [d] - typical adjacent face case.
f [u'] f' U' f f' U - solving last 2 centers on adjacent faces by cycling Ubl -> Ufl -> Ful
x' r U r' [d2] r U' r' [d2] x - " " " " on opposite faces by cycling Ufr -> Ubr -> Dfl

I set up to one of these cases when I can't see a 8-move comm straight away

Yea I know it is meant to be intuitive, just kinda wanna explore the concept by executing algs.

Edit: I've tried this algs, now I know what I'm missing. I've limited myself too much that I'd never explore the l2 slices. The M2 variant really helps a lot opening my understanding to the comms, so is the 2nd last one, now that I can see how pieces go in place. Thanks a lot Ollie, this does helps. Hopefully I'll be able to sub 6 consistently before 2013 make its call.

Finished a list of speed-optimized 3-cycle algs for wings for a DFr buffer. Will proof read through whenever I next have time and publish within a few days.

Yea I know it is meant to be intuitive, just kinda wanna explore the concept by executing algs.

Edit: I've tried this algs, now I know what I'm missing. I've limited myself too much that I'd never explore the l2 slices. The M2 variant really helps a lot opening my understanding to the comms, so is the 2nd last one, now that I can see how pieces go in place. Thanks a lot Ollie, this does helps. Hopefully I'll be able to sub 6 consistently before 2013 make its call.

My very first 4BLD success using center comms, even tho scramble is easy. Would've been faster if I used U2, but once I get used to comms I think I'll get quicker.

6:53.11[3:07.21]
Rw' F' Uw2 D' R Rw L2 D' F' U2 L' Uw2 L U2 Rw F' R F D L2 Rw' B2 D U Uw' L2 Rw2 Uw' F' Uw' F2 Uw' R2 D2 R2 Rw F2 R U Rw

I found a 17 centre solved scramble Apologies for the f b turns - blame my old version of prisma which I will update before I try again. This was the best of 20000 scrambles
u2 f b B' u' L r' U L r2 U u B r B U f2 l2 d' f' u' D2 L' f b D2 l' f2 d' b2 r2 f2 u' D' L2 d' B R2 b2 B'

I found a 17 centre solved scramble Apologies for the f b turns - blame my old version of prisma which I will update before I try again. This was the best of 20000 scrambles
u2 f b B' u' L r' U L r2 U u B r B U f2 l2 d' f' u' D2 L' f b D2 l' f2 d' b2 r2 f2 u' D' L2 d' B R2 b2 B'

Actually I made an excel spreadsheet.
In simple terms: Scramble is pasted in, scramble is decomposed into individual moves, each piece is tracked during each move by using a large matrix, end product is found, 24 orientations are checked, maximum is found. Then I wrote a little macro to make it go down a large list of scrambles.
In complicated terms: Even I don't know any more. It was complicated. Very complicated.

Actually I made an excel spreadsheet.
In simple terms: Scramble is pasted in, scramble is decomposed into individual moves, each piece is tracked during each move by using a large matrix, end product is found, 24 orientations are checked, maximum is found. Then I wrote a little macro to make it go down a large list of scrambles.
In complicated terms: Even I don't know any more. It was complicated. Very complicated.

haha ok, I might make a program for something like this. I've already made a cube structure in c++ so something like this probably wouldn't be that hard to do.

Finished a list of speed-optimized 3-cycle algs for wings for a DFr buffer. Will proof read through whenever I next have time and publish within a few days.

I found a 17 centre solved scramble Apologies for the f b turns - blame my old version of prisma which I will update before I try again. This was the best of 20000 scrambles
u2 f b B' u' L r' U L r2 U u B r B U f2 l2 d' f' u' D2 L' f b D2 l' f2 d' b2 r2 f2 u' D' L2 d' B R2 b2 B'

Actually I made an excel spreadsheet.
In simple terms: Scramble is pasted in, scramble is decomposed into individual moves, each piece is tracked during each move by using a large matrix, end product is found, 24 orientations are checked, maximum is found. Then I wrote a little macro to make it go down a large list of scrambles.
In complicated terms: Even I don't know any more. It was complicated. Very complicated.

I've tried a couple of times, and failed pretty badly. I keep wanting to go fast. I also find it harder to be accurate at competitions I either organize or am heavily involved in running.

But honestly, even without those factors, I'm just not sure I'd have a chance at your streak - it really is incredible.

That's awesome! I've never gotten that close for any solve on a stackmat. I guess I usually only use a stackmat unelss I am for sure I will get sub-10.