In the past week, I have calculated the god's algorithm for square one in face turn metric (ftm). According to the calculation, any twistable square-one states can be solved no more than 31 moves, where (x, 0), (0, y), / are counted as one move, (x, y) are counted as two moves.
@Cube Elite Union Cafe 2014
Scramble: L2 D2 L2 B2 U F2 D2 U' R2 B F' L B' F U F R' U' B2
cross：z' x' L2 F' L' y U' R' F D
1st: L' U2 L R' U R
2nd: y' R U' R' U' F' U' F
3rd: U L' U L U2 L' U L
4th: R' U2 R U' R' U' R
Oll: y' R' U' F' U F R
csTimer (translation needed)
cstimer upcoming version: https://cstimer.net/new/
If you are a developer, you may find the source code of cstimer at: https://github.com/cs0x7f/cstimer
If you are willing to help translating cstimer into your native language, please...