SBLv.7Sub-15 s

Go for optimal SB, even if it breaks FB

This lesson boosts: SB building

Lesson goal

The goal is to be able to build SB with “Break FB for optimal”.

Where this lesson fits

The most advanced SB method. It shaves another 0.7 moves on average off the R, r, U, M optimal, and only helps in half of positions. Take it on once the other methods are second nature.

  • Recommended for advanced solvers chasing optimal
  • In half of positions, shorter than the R, r, U, M-only optimal
  • Saves only 0.7 moves on average, less than 1
  • You need to manage restoring the broken FB
Reference: average moves per SB method
Basic steps13.1 moves
Build a square11.1 moves
Keep the square up, set up the next pair8.9 moves
Use the M slice8.6 moves
Break FB for optimal7.9 moves

This method saves less than 1 move on average (0.7). In half of positions R, r, U, M alone ties, so use it only where it helps.

Reference: average optimal SB move count · 300 positions
R, r, U, M only8.62 moves
With F, B7.92 moves
Reference: moves saved by also using F, B · 300 positions
Same51%
1 move32%
2 moves13%
3 moves3%
4 moves1%

The step before this method. Start here if you haven't yet.

Main content

Build SB in the fewest moves, even breaking FB temporarily with moves like F or B (e.g. open FB's front with F, make the square, put it back with F), then restore FB right away. It's 0.7 moves shorter on average than the R, r, U, M-only optimal, and helps in half of positions. An advanced method for those chasing optimal, shaving off less than one move.

How to recognize

  • Use this only in positions where F or B gives a shorter build than the R, r, U, M-only optimal (in half of positions it's the same).
  • Like F′ U′ F, temporarily move the front (or back) of FB, insert a pair or edge into the gap, and restore FB within the same sequence.
  • It saves 0.7 moves on average. For advanced solvers chasing optimal.

Algorithm

  1. Compare the R, r, U, M-only optimal with moves using F and B, and spot the positions where it's shorter (half)
  2. Temporarily move part of FB, like F′, and insert a pair or edge into the gap
  3. Restore FB within the same sequence. You must be able to restore FB without losing track of it
UM2FU2r2FU2R(8 moves)
  1. Bring DR up to the top layer
  2. F breaks the front of FB for a moment; use the space to make the front square
  3. F puts FB back, and the square goes in together with the back pair: done (8 moves; the optimal keeping FB is 9)