| # | Diagram | Algorithm | Comments | Video |
| 01 | ![]() |
FR: (R U' R') Dw (R' U2) (R U'2) (R' U R) FL: (L' U L Dw') (L U'2) (L' Dw2) (R U' R') BR: (R' U R Dw') (R U2) (R' U2) (R U' R') BL: (L U'L' Dw) (L' U'2) (L U2) (L' U L) |
Separate the corner from the edge by placing them in the U-layer. Next, AUF and bring the corner to the bottom using the empty slot so you can move the edge freely to match-up with the corner. AUF again and place the block in the slot it belongs. | Videos Coming Soon! |
| 02 | ![]() |
FR: [U] (R U' R') Dw' (L' U L) FL: [Dw] (R U' R') Dw' (L' U L) BR: [Dw] (L U' L') Dw' (R' U R) BL: [U] (L U' L') Dw' (R' U R) |
AUF so that the edge would "match the center" if you moved it one turn towards the empty slot. Next, remove the corner from the slot to match the edge, AUF again, and place them both together. | Videos Coming Soon! |
| 03 | ![]() |
FR: [Dw'] (L' U L Dw) (R U' R') FL: [U'] (L' U L Dw) (R U' R') BR: [U'] (R' U R Dw) (L U' L') BL: [Dw'] (R' U R Dw) (L U' L') |
This is just the mirror of Case #02. | Videos Coming Soon! |
| # | Diagram | Algorithm | Comments | Video |
| 04 | ![]() |
FR: (R U R' U') (R U R' U') (R U R') FL: (L' U' L U) (L' U' L U) (L' U' L) BR: [U'] (R' U) (R U') (R' U) (R U') (R' U R) BL: [U] (L U') (L' U) (L U') (L' U) (L U' L') |
This is easy to remember because it is the repetition of a very fast trigger three times. | Videos Coming Soon! |
| 05 | ![]() |
FR: [Dw] (R' U) (R U2) (R' U R) FL: [U] (L' U) (L U'2) (L' U L) BR: [U] (R' U) (R U2) (R' U R) BL: [Dw] (L' U) (L U'2) (L' U L) |
To place the corner, you match the corner with the edge to form a block and place them both together. | Videos Coming Soon! |
| 06 | ![]() |
FR: [U'] (R U') (R' U2) (R U' R') FL: [Dw'] (L U') (L' U'2) (L U' L') BR: [Dw'] (R U') (R' U2) (R U' R') BL: [U'] (L U') (L' U'2) (L U' L') |
This is just the mirror of Case #05. | Videos Coming Soon! |
| # | Diagram | Algorithm | Comments | Video |
| 07 | ![]() |
FR: (R'2 U2) (R' U' R U') (R' U2 R') FL: (L' U2) (L' U' L U') (L' U2 L2) BR: (R' U2) (R' U' R U') (R' U2 R'2) BL: (L2 U2) (L' U' L U') (L' U2 L') |
In this case, the edge is solved, but the corner is not. A common way of solving this involves removing the entire first layer, breaking away the corner to match it with its edge, and then restoring everything. | Videos Coming Soon! |
| 08 | ![]() |
FR: (R U' R U) y (R U') (R' F2) FL: (L' U L) (F R U'2) (R' F') BR: (R' U R) B (L U'2 L' B') BL: (L U' L U) y' (R U') (R' F2) |
This is one of the least intuitive cases for the F2L. It involves breaking up the two pieces and restoring them while the cross is still not yet restored. | Videos Coming Soon! |
| 09 | ![]() |
FR: [U2] (R U' R') y (L' U' L) FL: (L' U' L U) (L' U' L) BR: (R' U' R U) (R' U' R) BL: [U2] (L U' L') y (R' U' R) |
In this case, the goal is to get the corner to be "opposite" from its matching edge and then placing them both together. | Videos Coming Soon! |
| 10 | ![]() |
FR: (R U') (R' U) (R U' R') FL: (L' U'2 L) y'(R U2 R') BR: (R' U2 R) y (R U2 R') BL: (L U') (L' U) (L U' L') |
In this case, the goal is to form a corner-edge block and then place it in its slot. | Videos Coming Soon! |
| # | Diagram | Algorithm | Comments | Video |
| 11 | ![]() |
FR: (R U'2) (R U R' U) (R U'2 R'2) FL: (L2 U'2) (L U L' U) (L U'2 L) BR: (R'2 U2) (R U R' U) (R U2 R) BL: (L U'2) (L U L' U) (L U2 L'2) |
This is just the mirror of Case #07. | Videos Coming Soon! |
| 12 | ![]() |
FR: (R U' R') (F' L' U2) (L F) FL: (L' U L' U') y' (L' U) (L F'2) BR: (R' U R' U') y (L' U) (L F'2) BL: (L U' L') B' (R' U2 R B) |
This is just the mirror of Case #08. | Videos Coming Soon! |
| 13 | ![]() |
FR: (R U2 R') y' (R' U2 R) FL: (L' U) (L U') (L' U L) BR: (R' U) (R U') (R' U R) BL: (L U'2 L') y (R' U2 R) |
This is just the mirror of Case #10. | Videos Coming Soon! |
| 14 | ![]() |
FR: (R U R' U') (R U R') FL: [U2] (L' U L) y (R U R') BR: [U2] (R' U R) y (R U R') BL: (L U L' U') (L U L') |
This is just the mirror of Case #09. | Videos Coming Soon! |
| # | Diagram | Algorithm | Comments | Video |
| 15 | ![]() |
FR: (R U' R' Dw) (R' U R) FL: (L' U L Dw') (L U' L') BR: (R' U R Dw') (R U' R') BL: (L U' L' Dw) (L' U L) |
This pair is already connected, so just take it out of the slot (without losing the edge!) and put it back in. | Videos Coming Soon! |
| 16 | ![]() |
FL: (L' U'2 L U) (L' U' L) BR: (R' U2 R U) (R' U' R) |
Break up the two pieces so that they become opposite from each other and then just place them. | Videos Coming Soon! |
| 17 | ![]() |
FR: [U2] (R2 U'2) (R' U' R U' R'2) BL: [U2] (L2 U'2) (L' U' L U' L'2) |
This is different than most cases because you match the edge with the other edges, then match the corner with the other corners, and finally restore everything together. | Videos Coming Soon! |
| 18 | ![]() |
FR: [Dw'] (L' U2 L U') (L' U L) FL: [U'] (L' U2 L U') (L' U L) BR: [U'] (R' U2 R U') (R' U R) BL: [Dw'] (R' U2 R U') (R' U R) |
First, AUF to "match" the edge piece with a center, then move the corner to match the edge using the free slot, and place the block in its slot. | Videos Coming Soon! |
| 19 | ![]() |
FR: [U2] (R U R' U) (R U' R') FL: (F R U'2) (R' F') BR: B (L U'2 L' B') BL: [U2] (L U L' U) (L U' L') |
This case is very similar to Case #18. | Videos Coming Soon! |
| 20 | ![]() |
FR: (R U2 R' U') (R U R') BL: (L U'2 L' U') (L U L') |
This is just the mirror of Case #16. | Videos Coming Soon! |
| 21 | ![]() |
FL: [U2] (L'2 U2) (L U L' U L2) BR: [U2] (R'2 U2) (R U R' U R2) |
This is just the mirror of Case #17. | Videos Coming Soon! |
| 22 | ![]() |
FR: [U] (R U'2 R' U) (R U' R') FL: [Dw] (R U'2 R' U) (R U' R') BR: [Dw] (L U2 L' U) (L U' L') BL: [U] (L U2 L' U) (L U' L') |
This is just the mirror of Case #18. | Videos Coming Soon! |
| 23 | ![]() |
FR: (F' L' U2) (L F) FL: [U2] (L' U' L U') (L' U L) BR: [U2] (R' U' R U') (R' U R) BL: B' (R' U2 R B) |
This is just the mirror of Case #19. | Videos Coming Soon! |
| # | Diagram | Algorithm | Comments | Video |
| 24 | ![]() |
FR: [Dw] (R' U' R Dw') (R U R') FL: [U] (L' U' L Dw') (L U L') BR: [U] (R' U' R Dw') (R U R') BL: [Dw] (L' U' L Dw') (L U L') |
In this case, you remove the edge from the second layer such that it is opposite the corner, AUF, and place the pair. | Videos Coming Soon! |
| 25 | ![]() |
FR: [Dw'] (L' U L) FL: [U'] (L' U L) BR: [U'] (R' U R) BL: [Dw'] (R' U R) |
This case is easy to recognize because the corner-edge pair is already connected and only need to be inserted. It is common for many of the F2L algorithms to end with this trigger. | Videos Coming Soon! |
| 26 | ![]() |
FR: [Dw] (R' U2 R Dw') (R U R') FL: [U] (L' U'2 L Dw') (L U L') BR: [U] (R' U2 R Dw') (R U R') BL: [Dw] (L' U'2 L Dw') (L U L') |
Use the empty slot to break up the pair such that the corner and edge are opposite each other and then place the pair. | Videos Coming Soon! |
| 27 | ![]() |
FR: [Dw] (R' U' R U'2) (R' U R) FL: [U] (L' U' L U'2) (L' U L) BR: [U] (R' U' R U'2) (R' U R) BL: [Dw] (L' U' L U'2) (L' U L) |
Use the empty slot to form a 2x1x1 block and place the block into the slot in which it belongs. | Videos Coming Soon! |
| 28 | ![]() |
FR: [Dw] (R' U R Dw') (R U R') FL: [U] (L' U L Dw') (L U L') BR: [U] (R' U R Dw') (R U R') BL: [Dw] (L' U L Dw') (L U L') |
This case is very similar to Case #26. | Videos Coming Soon! |
| 29 | ![]() |
FR: [U'] (R U' R' U) (R U R') FL: [Dw'] (L U' L' U) (L U L') BR: [d'] (R U' R' U) (R U R') BL: [Dw'] (L U' L' U) (L U L') |
This case is very similar to Case #26. | Videos Coming Soon! |
| 30 | ![]() |
FR: (R U') (R' U2) y' (R' U' R) FL: (Rw' U' R' F) (R U Rw) BR: (R' F') (L' U L) (F R) BL: (L U') (L' U'2) y (R' U' R) |
One way of doing this is to break up these two pieces and twist the corner so that the two pieces are opposite each other and then placing them. The other way of fixing htis case is to just use the clever algorithm that doesn't necessarily have pair-up and insertion phases. | Videos Coming Soon! |
| 31 | ![]() |
FR: (R U R') BL: (L U L') |
Here, the corner and edge are "opposite" each other and can be placed with a simple trigger. The goal of many F2L algorithms is to get the corner and edge into this case and then solve them with this trigger. | Videos Coming Soon! |
| 32 | ![]() |
FR: [Dw] (R' U2 R U'2) (R' U R) FL: [U] (L' U'2 L U2) (L' U L) BR: [U] (R' U2 R U'2) (R' U R) FL: [Dw] (L' U'2 L U2) (L' U L) | This case is very similar to Case #27. | Videos Coming Soon! |
| # | Diagram | Algorithm | Comments | Video |
| 33 | ![]() |
FR: [U'] (R U R' Dw) (R' U' R) FL: [Dw'] (L U L' Dw) (L' U' L) BR: [Dw'] (R U R' Dw) (R' U' R) BL: [U'] (L U L' Dw) (L' U' L) |
This is just the mirror of Case #24. | Videos Coming Soon! |
| 34 | ![]() |
FR: [Dw] (R' U R U') (R' U' R) FL: [U] (L' U L U') (L' U' L) BR: [U] (R' U R U') (R' U' R) BL: [Dw] (L' U L U') (L' U' L) |
This is just the mirror of Case #29. | Videos Coming Soon! |
| 35 | ![]() |
FR: (Lw U L F') (L' U' Lw') FL: (L' U) (L U'2) y' (R U R') BR: (R' U) (R U2) y (R U R') BL: (L F) (R U' R') (F' L') |
This is just the mirror of Case #30, with a right-handed optimization at the FL slot. | Videos Coming Soon! |
| 36 | ![]() |
FL: (L' U' L) BR: (R' U' R) |
This is just the mirror of Case #31. | Videos Coming Soon! |
| 37 | ![]() |
FR: [U'] (R U'2 R' U2) (R U' R') FL: [Dw'] (L U2 L' U2) (L U' L') BL: [U'] (L U2 L' U2) (L U' L') BR: [Dw'] (R U'2 R' U2) (R U' R') |
This is just the mirror of Case #32. | Videos Coming Soon! |
| 38 | ![]() |
FR: [U] (R U' R') FL: [Dw] (R U' R') BR: [Dw] (L U' L') BL: [U] (L U' L') |
This is just the mirror of Case #25. | Videos Coming Soon! |
| 39 | ![]() |
FR: [U'] (R U'2 R' Dw) (R' U' R) FL: [Dw'] (L U'2 L' Dw) (L' U' L) BR: [Dw'] (R U'2 R' Dw) (R' U' R) BL: [U'] (L U'2 L' Dw) (L' U' L) |
This is just the mirror of Case #26. | Videos Coming Soon! |
| 40 | ![]() |
FR: [U'] (R U R' U2) (R U' R') FL: [Dw'] (L U L' U'2) (L U' L') BR: [Dw'] (R U R' U2) (R U' R') BL: [U'] (L U L' U'2) (L U' L') |
This is just the mirror of Case #27. | Videos Coming Soon! |
| 41 | ![]() |
FR: [U'] (R U' R' Dw) (R' U' R) FL: [Dw'] (L U' L' Dw) (L' U' L) BR: [Dw'] (R U' R' Dw) (R' U' R) BL: [U'] (L U' L' Dw) (L' U' L) |
This is just the mirror of Case #28. | Videos Coming Soon! |