I've recently become interested in Baby FTOs. One thing that intruiged me was this puzzle's ridiculously tiny total state count (only 138,240 possible states compared to a few million on the 2x2 and about a million on a Pyraminx). Previously, I watched this video by ben1996123 with every 2x2 scramble, so I decided that I'd try to replicate that with the Baby FTO.
I generated every scramble and used a script to record every frame as I played through a visualization of them all. I did this all in JS on a Dell Latitude 3330 school laptop (I know), so the final list of scrambles took about one hour and states took maybe one and a half, split between three stitched together sessions because my computer doesn't have enough RAM to do it all in one go (I got a memory error TWICE, wasting maybe a combined FIVE HOURS of compute time)
Video is here
About the states, the first eight numbers are the permutation of the centers. The first position represents what's in the top center slot (assuming vertex towards you), second is for front, then anticlockwise around the "belt" until eighth is for bottom. 0 represents white, 1 green, and so on (top belt bottom again). For the next six, it's the same with corners, where it instead starts with UBL (assuming vertex front), then UBR, then F, DFL, DFR, B. Corner orientation is a bit different. If the number is 0, the white/yellow corner sticker is on the white/yellow face. If it's one, W/Y is on the purple/grey face, then green/blue for 2 and red/orange for 3.
For the scrambles, they're the SOLUTION to each scramble, where a lowercase letter indicates a prime (eg, Ur is U R')
If you have an idea for something to do with these scrambles I'd be more than happy to hear them
For example here's every unique scramble which requires ten moves to solve
R U F' L F' L' R F' U' R
R U F U' R' L R' F U' F'
R U F U F' U L R L R'
R U F U R F U R' L' U
R U L R L U R L U' F'
R U R F L R' L' F' R' U'
R U R F R U' L' F R F
R U R F R F L F R' U'
R U R L U L' U' L' R' U'
R U R L U L' R' U' R' F'
R U R L U R' L' F' L' U'
R U R L U F' U' F' U' F'
R U R L U F' R' L' F' L'
R U R U L' F L U R U'
R U R U F L F' R' U R
I generated every scramble and used a script to record every frame as I played through a visualization of them all. I did this all in JS on a Dell Latitude 3330 school laptop (I know), so the final list of scrambles took about one hour and states took maybe one and a half, split between three stitched together sessions because my computer doesn't have enough RAM to do it all in one go (I got a memory error TWICE, wasting maybe a combined FIVE HOURS of compute time)
Video is here
About the states, the first eight numbers are the permutation of the centers. The first position represents what's in the top center slot (assuming vertex towards you), second is for front, then anticlockwise around the "belt" until eighth is for bottom. 0 represents white, 1 green, and so on (top belt bottom again). For the next six, it's the same with corners, where it instead starts with UBL (assuming vertex front), then UBR, then F, DFL, DFR, B. Corner orientation is a bit different. If the number is 0, the white/yellow corner sticker is on the white/yellow face. If it's one, W/Y is on the purple/grey face, then green/blue for 2 and red/orange for 3.
For the scrambles, they're the SOLUTION to each scramble, where a lowercase letter indicates a prime (eg, Ur is U R')
If you have an idea for something to do with these scrambles I'd be more than happy to hear them
For example here's every unique scramble which requires ten moves to solve
R U F' L F' L' R F' U' R
R U F U' R' L R' F U' F'
R U F U F' U L R L R'
R U F U R F U R' L' U
R U L R L U R L U' F'
R U R F L R' L' F' R' U'
R U R F R U' L' F R F
R U R F R F L F R' U'
R U R L U L' U' L' R' U'
R U R L U L' R' U' R' F'
R U R L U R' L' F' L' U'
R U R L U F' U' F' U' F'
R U R L U F' R' L' F' L'
R U R U L' F L U R U'
R U R U F L F' R' U R
