Recent content by alwin5b

If you're not sure what people mean with 'corner twist', watch the first 3 seconds of this video:

1. speedsolving methods (which gradually solve the cube, but mess up the unsolved part) 2. blind methods (which leave most of the cube untouched in each step) 3. Human Thistlethwaite (which doesn't solve anything until the very last step, instead the whole cube gets reduced into 'subgroups')...

Copy and paste the algorithms here to see what they do. I do EP slice by slice, unless I see a shortcut. For a single slice, there are 5 cases: case 1: the slice is one edge swap away from solved. alg: R2 U2 R2 U2 R2 U2 (which swaps two edges in another slice as well, because a single edge...

This is also quite good. Thanks for sharing this. I think I prefer Hoya to Yau because it's almost rotationless, but I've thought about using Yau for ZZ as well (unsuccessfully), and it's nice to see a solution to this problem.

This method is really well thought out. It doesn't look like much at first, which is why I tried developing my own 4x4 ZZ method based on the Ewert method. I thought my method turned out pretty decent, but then I compared it to Hoya-ZZ and, well, Hoya-ZZ is 10 times better than what I came up...

I'll just leave this here, for anyone who wants to know more: http://www.math.rwth-aachen.de/~Martin.Schoenert/Cube-Lovers/Dan_Hoey__The_real_size_of_cube_space.html https://en.wikipedia.org/wiki/Octahedral_symmetry https://en.wikipedia.org/wiki/Burnside%27s_lemma

Before Morwen B. Thistlethwaite came up with his famous 52 move computer algorithm in July 1981, the best known method, also found by Thistlethwaite, was a 63 move solution. The only information I could find about this method is that it consists of these 3 steps: Orient edges and get them into...

without regarding symmetry/mirrors, it is (3^4) * [ 8! / (4! * 4!) ] = 5670

I actually want to use the shorter alg R U' R' U F' r U' L' U2 R' U R U' and not the conjugated PLL, which I just listed for comparison. And I forgot to consider that you have to do a x' rotation at the end of the shorter alg, but the rotation won't matter much. Edit: That absurdly long...

So I want to learn COLL. When I am about to learn a new algorithm set, I just have to find the best algorithms, so I spent some time researching COLL algorithms. The most useful resources for finding LL algorithms I found are: algdb.net the wiki birdflu.lar5.com 10 of the COLL algorithms that...

Different way to do EOCross: Since z rotations don't change EO, you can build the cross on the right face (or the left side if you are left-handed) and do a z rotation afterwards. The steps are: 0. Rotate the cube such that the cross center faces to the right, and recognize EO just like you...

CLS (solve DFR and orient U layer corners) is used in 2x2GR Edit: just saw that shadowslice already mentioned OLS, which is identical with CLS on a 2x2.

Isn't CPEOLL + 2GLL better than OLL + PLL for big cubes? The better ergonomics of 2GLL on big cubes should be worth the bad CPEOLL recognition. Or am I missing something?

Because of @Neuro s post I looked at the SSC method. I don't think the method I came up with has a particularly low move count, but I'll share it anyway. 1. EOLine on left and setup for OL5C. 2. OL5C 3. bring the cube into a state where the 2x2x2 block containing the LBD corner is solved. 4...

another method: 1. CPFB 2. COLine (orient all corners and place the E layer edges oriented in the E layer) 3. solve the DR corners relative to each other (so the R sticker of both DR corners is on the same face) 4. L7E similar to WaterRoux (~ 70 algs) some details: 2. COLine: place a...