Athefre
Member
- Joined
- Jul 25, 2006
- Messages
- 1,252
ACMLL
Introducing a new algorithm set for the Roux method. The user solves F2B with flipped pairs, swapped pairs, or even flipped/swapped individual pieces. Then F2B is corrected during the CMLL algorithm. This provides many advantages including a significant move-count reduction, an ability to plan more of F2B during inspection, and good algorithms. To provide an example of how this reduces move-count, there is ~50% chance that the final built pair for SB will be a flipped pair before being inserted. It will have to be moved over its correct slot and flipped into place. However, if this pair is instead inserted into the opposite side just using R and U moves, this provides an average reduction of 2 moves. You can then imagine this reduction applied to all of the pairs that are built for F2B. If the shortest insert is used for all pairs, or even pieces, this will greatly reduce the number of moves for F2B. It is also easy to do and doesn't require any extra thinking during the solve.
I actually started working on this around a year ago and have occasionally posted updates in the Roux Discord server and in the Roux discussion topic here on SS. It has gotten really good feedback. So far what has been developed are the single flipped pair blocks and the spiral blocks. These have been analyzed and determined to produce a great move-count reduction and to also have good algorithms. There is still a lot to be analyzed and many algorithm sets to be developed. It would likely be beneficial to run a computer analysis for which block types have the best results. If anyone wants to start that project, let me know.
Introducing a new algorithm set for the Roux method. The user solves F2B with flipped pairs, swapped pairs, or even flipped/swapped individual pieces. Then F2B is corrected during the CMLL algorithm. This provides many advantages including a significant move-count reduction, an ability to plan more of F2B during inspection, and good algorithms. To provide an example of how this reduces move-count, there is ~50% chance that the final built pair for SB will be a flipped pair before being inserted. It will have to be moved over its correct slot and flipped into place. However, if this pair is instead inserted into the opposite side just using R and U moves, this provides an average reduction of 2 moves. You can then imagine this reduction applied to all of the pairs that are built for F2B. If the shortest insert is used for all pairs, or even pieces, this will greatly reduce the number of moves for F2B. It is also easy to do and doesn't require any extra thinking during the solve.
I actually started working on this around a year ago and have occasionally posted updates in the Roux Discord server and in the Roux discussion topic here on SS. It has gotten really good feedback. So far what has been developed are the single flipped pair blocks and the spiral blocks. These have been analyzed and determined to produce a great move-count reduction and to also have good algorithms. There is still a lot to be analyzed and many algorithm sets to be developed. It would likely be beneficial to run a computer analysis for which block types have the best results. If anyone wants to start that project, let me know.
Last edited: