God's number for selected 3x3x3 stages

bcube

Veteran
Joined
Sep 8, 2010
Messages
760
Hi,

Thistlethwaite's algorithm can be schematically expressed as follows:

Scrambled cube → EO → DR → HTR → Solved cube

I am wondering whether God's number is known for these 3x3x3 stages in HTM when all 18 possible moves are allowed?
  • EO → HTR = ?
  • DR → HTR = ? (upper bound: 13)
God's number in HTM when all 18 possible moves are allowed is known for:
 
Last edited:
some of the pure-corner-twist scrambles are 20 optimal iirc.
I remembered wrongly; there is this example which is 8-twist (seven cw, one ccw) composed with 4-spot:
 Twizzle link 
U F R2 D' F' L2 U F' B' U F' B' U L2 B' D' F R2 U F'


(From Chong Wen on the FMC Discord who in turn got it from CF.)
 
Hi,

Thistlethwaite's algorithm can be schematically expressed as follows:

Scrambled cube → EO → DR → HTR → Solved cube

I am wondering whether God's number is known for these 3x3x3 stages in HTM when all 18 possible moves are allowed?
  • EO → HTR = ?
  • DR → HTR = ? (upper bound: 13)
God's number in HTM when all 18 possible moves are allowed is known for:
is this how FMC works??
 
DR to HTR is 13.
1768799274338.png
 
Hmmm, something is wrong. Could you please elaborate?

Scrambled → EO: 2,048 cases ✅
EO → DR: 1,082,565 cases ✅
DR → HTR: 29,400 cases ❌
HTR → Solved: 663,552 cases ✅
What is the problem? Is my total case-count wrong? This is solving HTR with DR completed and not breaking the DR, i.e. staying within the subgroup.
 
I found some mistakes in my computation. I reran it and found gods number 9 with only 4900 cases. But this also doesn't match the number of cases you put forth, so Idk if I did it right this time.
 
I found some mistakes in my computation. I reran it and found gods number 9 with only 4900 cases. But this also doesn't match the number of cases you put forth, so Idk if I did it right this time.

Easy check: 2,048 * 1,082,565 * X * 663,552 = 43,252,003,274,489,856,000

This is solving HTR with DR completed and not breaking the DR, i.e. staying within the subgroup.

Perhaps you missed the point. The point is using the <U, D, R, L, F, B> move set in all stages (see links in the first post).
 
Last edited:
Omg, I completely missed the part "when all 18 possible moves are allowed".

I agree with the numbers 2048, 1082565, and 663552 as my tool gives those same values. And your equation makes sense. So I need to figure out where I went wrong.
 
Back
Top