![]() Memorize the algorithms, and i also color coded some very frequent Highlited and grouped the notation that I thought would best help you These algorithms are organized and presented to best aid you in MEMORIZATION. NOTATION LINK to check out notation that you don't know.ĭifficulty to Learn at each row assumes that you already know all algorithms in all rows above it The program just loads these images when it starts.ĭOWNLOAD, How-to run on Linux (thanks Gopi!) Introduction to my solutions To rotate any of the PLL's in the program, just rotate the image in the folder. It keeps track of all of this, gives you averages, etc. It generates a random PLL, and then it times how quickly you can perform it. This is a program that I wrote that helps you practice PLLs. Watch my video HERE to learn the 2look PLL.Īlso, here is a printable sheet of all cases and solutions for reference, in pdf format (Thank you Husayn for making and sending me this sheet) PLL Trainer You then only have to learn 6 of them (at the expense of speed obviously). However, if you are willing to do it in two steps instead, you can use what is called the 2look PLL. You need all of the 21 algorithms below to solve this stage in a single step. Then one of the diagrams should match what you have. Before you go off finding which case you have, use U/U'/U2 turns to align as many pieces as possible. Find out which diagram indicates how you need to move them around, and apply the algorithm. ![]() After you finish OLL, pieces on the last layer will need to be permuted (moved around). PLL is the last step of the Fridrich Method.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |