Scramble: L2 D2 R' B D B2 L2 D2 F' U B' F U' L R B F' R
Solution: R B R B' R' B R B' R' L U R2 U' R L' B R' B' R' B2 U2 R' B2 R2 B' L2 D' L U2 F' (30)
Use inverse scramble.
2x2x2: F U2 L' D L2 (5|5)
2x2x3: B R2 B2 R U2 (5|10)
F2L minus pair: B2 L U R' U' L' (6|16)
All but 3 edges: R B R' B' R B R' B' R' (9|25)
This gives 25 move skeleton: R B R B' R' B R B' R' L U R * U' L' B2 U2 R' B2 R2 B' L2 D' L U2 F'. Insert R U' M U R' U' M' U = R U' R L' B R' B' R' L U at *, 5 moves cancel, for a total of 30.
This was a lucky end, but I had some other decent stuff too. My first inverse scramble solution was F U2 L' D L2 / B R B2 R2 U2 / R D B2 D' R', then doing NISS gives an easy 30 move skeleton.
Next (still inverse) I did F U2 L' D L2 / B R B2 R2 U2, then NISS and do B' R B R2 B / B R' B' R D' R' D / D' R' D R D B' D' B R (lots of cancellation!) for a 27 move skeleton with 3 corners. But I couldn't find anything better than a 7 move insertion.
My last interesting thing I came across while just doing a Fridrich solve. On the forward scramble, do D2 L' F B U' L U' / B D' B' D' R' D R / F' D F / B' D B / D L' D' L. That's a 24 move F2L, pretty good for Fridrich, but I wasn't going to try to finish that.
3x3x3 Fewest Moves – 54 moves
Scramble: L2 D2 R' B D B2 L2 D2 F' U B' F U' L R B F' R
Solution: B L’ U’ L2 R’ U’ B z2 U L U L2 U2 L U’ F U F2 U’ F U’ R B’ R’ B R U R’ U’ R U R’ U’ R U R’ y2 F R U R’ U’ F’ R’ U’ y F R2 D y R’ U R U’ R D’ y’ R2 U2
Generally in Japan, a man of such an age is already recognized as "OSSAN" or "OJISAN",
which means a man who is no longer young.
In computer science's area, however, the second bit "1" is called a "young bit",
so I should be recognized as a "young" researcher for a few years.
2x2x2 minus one move : B D' F' L D' R ($6)
1x2x2 : U2 F2 U2 ($3, $9)
2x2x3 + pair : D F' R' ($3, $1C)
Last cross : U' B' R2 B ($4, $10)
LL edge orient : U' F' U' F ($4, $14)
Last slot : U2 R U R' ($4, $18)
ZBLL : B U B' U B U F' U B' U' F ($B, $23)
AUF : U ($1, $24)
Generally in Japan, a man of such an age is already recognized as "OSSAN" or "OJISAN",
which means a man who is no longer young.
In computer science's area, however, the second bit "1" is called a "young bit",
so I should be recognized as a "young" researcher for a few years.