I think it would've been good to explain how we know there are 43 quintillion total possible states of the cube, as that was a fact used to prove earlier lower bounds.
yup! has to use moves only in that move set. (thus only double turns) less things to check! "the most optimal" was not really sought after back then - it was really just, given that we won't make our computers spend 50 years on this calculation, what's the best that we can do?
Also, when we'll find a method for the optimal solution of any scrambles, solves would have to be arrenged by the number of moves (fastest time to solve a 19-mover, etc). Otherwise someone could have like a 15-mover and no one could beat that unless they're lucky too
good point! although - considering 2x2, which most optimal solutions can be predicted (at least up to 6-movers), 4-movers and 6-movers are still regarded as "2x2". I guess luck will always be present. Maybe have a rule of any scramble has to be solvable in more than 15 moves, like the 4-move rule for 2x2?
he went through every 18 move solution after g1 and checked if either of U2 R2 F2 B2 took the cube to another 18 move state, it didnt, which means you can invert the last move before reaching G1 to go to a 17 move state
I think it would've been good to explain how we know there are 43 quintillion
total possible states of the cube, as that was a fact used to prove earlier lower bounds.
good point. I should add in a card - I made another video explaining just that a few years ago, forgot to do that when publishing-
This is a really good and well-researched video, more people need to see it
very good video, keep it up
thanks man!!
Enjoyed very much even though this topic is completely new to me.
wonderful! speedcubing is a cool world - but the theory behind it is every cooler :)
Great job!!! Very interesting i always wondered how it was figured oit.
8:29 wait so were computers told to never break that moveset bc the optimal solution after htr (G3) often breaks the moveset, such as in R L U2 R’ L’
yup! has to use moves only in that move set. (thus only double turns) less things to check! "the most optimal" was not really sought after back then - it was really just, given that we won't make our computers spend 50 years on this calculation, what's the best that we can do?
Also, when we'll find a method for the optimal solution of any scrambles, solves would have to be arrenged by the number of moves (fastest time to solve a 19-mover, etc). Otherwise someone could have like a 15-mover and no one could beat that unless they're lucky too
good point! although - considering 2x2, which most optimal solutions can be predicted (at least up to 6-movers), 4-movers and 6-movers are still regarded as "2x2". I guess luck will always be present. Maybe have a rule of any scramble has to be solvable in more than 15 moves, like the 4-move rule for 2x2?
We already found it and it's not. Human learnable. It's called Kociemba
I was actually discussing this with a friend the other day!
We had a question
Is R2: 1 move or 2 moves?
Is E1: 1 move or 2 moves?
yay!! it’s interesting, isn’t it?
For HTM: R2 is 1 move, E1 is 2 moves. God's numbers for HTM is 20
For STM: R2 is 1 move, E1 is 1 move. God's numbers from STM. Is 18 to 20
How did Reid come up with the conclusion in 13:36 I'm a bit confused
he went through every 18 move solution after g1 and checked if either of U2 R2 F2 B2 took the cube to another 18 move state, it didnt, which means you can invert the last move before reaching G1 to go to a 17 move state
@parabolaaaaa4919's explanation is exactly it!
@@parabolaaaaa4919 thanks for the explanation
Happy to be your 999th subscriber
letssss goo :) giveaway soon!! (when I make the video LOL)
underrated
thanks dude :)
Good video man
thanks :))
17:55 wen
WOOOO❤
WOOOOO
WOOOO
YOU JUST ADMITTED ORZ
BANNN
i am your no 1000
14:14 i dont think a 12 bad eo case is good for zz
subscriber #1K!!!