2gen 4x4x4

jupp

Member
Joined
Feb 28, 2008
Messages
9
I tried to solve a cube that is only scrambeld with (Rr) and U. But I could not solve it, althoug I spent the whole day. My best result was everything but a three cycle of edges. Has anyone tried this before?
 
<r, R, U> is 3-gen. ;)
(It's just kinda annoying to come to a thread and find out it's not about what the title says.)
I wanna try to solve <r,U> some time, though (single slice r).

Anyhow, r U R U' r' U R' U' (r single-slice) should work for any 3-wing cycle, with setup.
More fun is performing a 2-cycle of wings. :p


I'm gonna time myself on this 3-gen, though.

EDIT: 2:14.87 first try.
1:15.96 second try.

By the way, I'm solving centers, corners, and inefficient r2 for edges.
 
Last edited:
Aha, apparently you meant only <Rr, U>. For some reason I'd assumed you didn't express your generators correctly, 'cause I'm used to interpreting incorrectly written things on here. :rolleyes:
Sorry, then.


Mitchell (watermelon) could easily find algs for any type of cycle. Just wait until he finds this thread. :p
 
At least the post isn't about edge-pairing.

Thrawst spawned a whole generation of confused cubers when he coined the phrase "2-gen edge pairing". :P I kinda feel sorry for those people who come here and find out 2-gen is something completely different.


I always thought 2-gen was pairing up two edges at once because of Thrawst. So what exactly is two gen?:confused:
 
Wow, actual 2Gen solving is hard. Gives me a new challenge for my boring high school classes. :D

I'll post my strategies tomorrow if I can solve it by then.
 
yeah I got a solution but.... it was not nice. I don't want to count how many moves my last three cycle had. A combination of several different algorithms I used before. I don't have a solution for OLL parity either, except starting from the beginning. (with OLL parity I mean one two cycle left at the end of the solve, a bit different since I does not match the edges before).
It is a very nice challenge solving the 4x4x4 just with (Rr) and U because you can't use algorithms that you already know.
 
How much do you want to bet Lucas will find a 2000+ move algorithm that does R in <Rr,U> and Mitchell will come back with a 40 move alg that does the same thing? >_>
 
Back
Top