Learn how to solve the 4x4x4 Rubik’s Revenge Cube easily. the 4×4 Rubik’s revenge is very similar to it and requires only few more algorithms to learn. The You CAN Do the Rubiks Cube Program objective is to share the secrets of solving the Rubiks Cube with youth and to also encourage them to help others to . This page attempts to list move optimal algorithms for every common form of parity encountered in popular 4x4x4 (Rubik’s Revenge) solving.
|Published (Last):||12 August 2007|
|PDF File Size:||20.8 Mb|
|ePub File Size:||14.83 Mb|
|Price:||Free* [*Free Regsitration Required]|
How to solve a 4×4 Rubik’s Cube
Algorithms for the Cage Methodas well as algorithms for theoretical purposes and general 4x4x4 exploration are present as well. Although symmetrical algorithms are technically conjugates of non-symmetrical algorithms, non-symmetrical algorithms are algorithms which are solely the result of a composition of one or more separate algorithm pieces, which all together accomplish the desired task.
Reduction parity occurs when you try to reduce the puzzle so it can be solved by a constrained set of moves, putting it into some subset of the positions. For example, performing a swap of dedges to a fully solved 4x4x4 and then flipping the front dedge resulting from that swap gives us the following.
4x4x4 parity algorithms
In practice, human creation of symmetrical algorithms requires more trial and error of different paths in both creation of the base the base is defined as the move sequence B in A B A’ and final setup moves, whereas the creation of non-symmetrical algorithms requires having knowledge of forming different pieces individually and knowing how to combine them.
Symmetrical algorithms are conjugates. However, you can often reach a position which seems like it is in your subset, but which is actually not, and to solve the puzzle you have to briefly go outside your constrained set of moves to bring the puzzle back into the subset you want.
Besides containing case images and algorithms for reduction parity cases, this page also contains odd parity cases which can technically be used to pair dedges, since they permute wing edges in a manner which separates wing edges in the same dedge from each other. Wiki tools Special pages.
It is common convention among the speedcubing community to use algorithms which contain wide double layer turns to solve OLL parity instead of single inner layer slices.
There are many types of parity cases which can occur during a 4x4x4 solve, but the cases which result from attempting to reduce a fully scrambled 4x4x4 into a pseudo 3x3x3 state this means an even n x n x n cube in which all of its composite edges are complete and all of its centers are complete and are in the correct center orientation, in general.
Since all OLL parity algorithms contain an odd number of inner slice quarter turns, one can technically fix any 4x4x4 wing edge odd parity case by executing a single slice quarter turn and then resolve the cube using an even number of inner slice quarter turns. You might be lucky when you have finish pairing the third last pair with the final two pairs being algorithks when the centres are realigned, however, this is less likely than still having to match them.
Combining some form of PLL parity and 4×44 single dedge flip creates one of the many cases of what’s commonly called double parity. See the PLL Parity section for details. There are links to either forum posts or video URLs in the right-most column of many “algorithm bars”.
This was deduced from the same idea that Floyd Newberry came up with for using a short repeated sequence to directly solve a 2-cycle. OLL parity falls under this definition too so the reduced 4x4x4 has four times as many positions as you would expect. However, unlike all of the 23 single slice quarter turn algorithms presented in this section which can be applied to all big cube sizesthese two algorithms only work on the 4x4x4.
How to Solve a 4×4 Cube- The Rubik’s Revenge
For illustration of how algorithm bars are going to be labelled, let 4xx4 temporarily name it “Old Standard Alg” and called the author “anonymous”. Below are two single dedge flip 2-cycle algorithms illustrating the idea.
The most popular 2-cycle a swap of two pieces besides the single dedge flip case is the following. Since this algorithm contains move repetitionit can be written more compactly as f2 r E2 2 r f2.
This 2-cycle of wings is as common during a K4 Method solve as the single dedge flip is, but it should never arise during a solve using the Reduction Method because two dedges are not paired up.
You can safely rotate any face to create a starting configuration. More will be explained about what other pieces of information in the algorithm bar above mean later. The last pair to be solved are placed on ether side of the front face.
4x4x4 parity algorithms – Wiki
Most of the algorithms on this page affect some centers of the 4x4x4 supercube: However, the other 54 will only be encountered during a K4 Method solve. The following 21 slice quarter turn algorithm was the only 21 slice quarter turn 3x3x3 algorithm which was closest to being a algorthms dedge flip algorithm.
Below is an example algorithm found in December of You now have a 3x3x3 cube, however you may still have parity problems. Their inner slice turns may all be replaced with wide turns and still preserve the first three layers F3L of the 4x4x4 and flip one dedge.
In MayMichael Gottlieb defined reduction parity in detail. However, many who algorithhms the algorithhms Rubik’s cube using algorithmms variant of the Reduction Method will come across this case; and algorirhms several but not all of the algorithms listed on this page which solve this case directly can be used for completing the tredge-tripling stage of a 5x5x5 Reduction solve. The problem is that we no longer have a alogrithms unmatched pair to realign the centres with.
You will notice that the pair are matched after the first rotation in the algorithm, however, the four centres on the side faces have now been split, the rest of the algorithm places the newly matched pair on the up face then replaces them with the split pair which are turned to the front face so the side face centres can be realigned. This is especially common if two algorithms are in a different move set consist only of certain types of turns.
Algorithm names will be explained next. The remaining PLL parity cases which involve the fewest number of pieces besides the most popular case above are the following. Recalling that the term “2-cycle” is interchangeable with the common term “swap”, these cases perform 2 2-cycles of wing edges.
The creation of a symmetrical algorithm requires one to confront the question “how can I change what I have into what I want it to be? This parity situation can be transformed into 21 other last layer forms of what is commonly called PLL parity by performing a 3x3x3 PLL and adjusting the upper face AUF as needed.
So you will need to learn the next algorithm to pair the last two unpaired edge sets. Page actions View View source History More.