IAssemble
Member
50-200ms? That's amazing. So what kinda move count does it usually come up with.
Thanks.
The average is just under 21 moves. The video shows a 21 move solve.
Follow along with the video below to see how to install our site as a web app on your home screen.
Note: This feature may not be available in some browsers.
50-200ms? That's amazing. So what kinda move count does it usually come up with.
Ah, very nice. The previous video didn't even come remotely close to doing this justice; this video is a lot better. I'm quite impressed.
Could you do an average of 12, perhaps? Get 12 scrambles (25 moves is OK, cube explorer would be better though) and record the times, then take the average of the middle 10. I think since Feliks is a robot too he should have to compete against this, so it would be interesting to know how far he has to go![]()
EO -> Something with edges -> Something with corners -> solve everything
I don't even think that's right. What are the steps?
Has anyone tried something like MGLS but permuting corners?
I realize the point of this was the fascinating nature of the algorithm, but in case someone likes this one, I wanted to point out that quicker is: F M2 S M2 f' (or any of the many similar alternatives). I use it often for big cubes BLD (5x5x5 or 7x7x7) to solve centers when I reorient.(R2 U2 R2 S)2