![]() ![]() This is with no solved pieces to preserve, so maximum freedom to turn the cube without breaking anything.Īt first I thought that steps that have to preserve more solved pieces would be less move-efficient, but that seems not to be the case (at least not until only 3-4 pieces remain). I have been wondering why that is the case, and what the potential is for improving the efficiency of F2L.Ĭross is typically close to optimal and takes on average ~1.5 moves per piece solved. ![]() Yet, relatively little seems to have been invested in improving F2L, which is the longest and least efficient aspect of a CFOP solve. There seem to be so many different LL and LS options and so much effort has been invested in devising and learning these, with new proposals emerging on almost a weekly basis.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |