speedsolvetheory
Regular
VoidRoux is a method I came up with today that is a fun solution to the puzzle's main crux: parity. This is the annoyance of any 3x3 solver solving the Void Cube for the first time, coming across an impossible case, and being frustrated about how to solve it.
Parity arises from the void cube when centers are misaligned by one quarter turn, leading to the appearance that edges or corners are swapped, when in reality the centers are misaligned and the pieces are simply being viewed from the wrong frame of perspective.
Step 1: Relative First Block:
This step is mostly the same as in Roux, except for the fact that you can take extra liberties in blockbuilding due to the fact that you do not need to align the pieces with centers. Start the solve from the orientation where you can execute the blockbuilding the most comfortably.
Step 2: Second Block:
This step is the same as in Roux.
Step 3: CMLL:
This step is the same as in Roux.
Skip here if you know Roux: Step 4: EPA
There are two ways of doing this: the easy way and a more difficult way.
Easy Way:
Insert the two bottom edges, regardless of their orientation, and then examine the permutation of the pieces in the last layer.
If they are in a valid case, (Ua, Ub, H, or Z) then you continue as normal. Otherwise, perform an M or M'. Then solve the cube as normal without performing a M or M' in isolation.
Advanced Way (Counting):
You look at where all of the edges are and figure if an edge is swapped. Doing this at first is a little difficult, but it becomes easier with practice.
To do the process, start with any edge. I use UL. When I look at the UL edge I see that it is unsolved. I will say "1". Then I will look at the edge in the UL slot and see which slot it goes in. I then look at that spot and see it is unsolved. I will say "2", and look where that edge goes, and so on. This process is similar to blind solving.
I will now provide an example.
Example of EPA
It's a counting game, where you count the number of cycles and swaps.
The bad cases are: 2, 4, 6 2+2+2, 3+2
You can understand it as an even number of swaps, when it should be odd due to puzzle geometry.
To practice, look away and do a bunch of M and U, U' U2 moves. Then perform the counting and see if you are correct.
Once you start to count you will pick up many mental tricks to go faster.
Step 5: L6E
This is done like in Roux. If you mess up, do an M or M' and solve again, or perform a parity algorithm.
For the reason that parity is one slice move, this is probably the most efficient solving method for the void cube.
If you have any fun suggestions for the name of this method or for improvements, reply and tell me what you think! I am not the best Roux or void cube solver, but I tried my best.
Obviously some has invented this before so please point me to the original creator
Parity arises from the void cube when centers are misaligned by one quarter turn, leading to the appearance that edges or corners are swapped, when in reality the centers are misaligned and the pieces are simply being viewed from the wrong frame of perspective.
Step 1: Relative First Block:
This step is mostly the same as in Roux, except for the fact that you can take extra liberties in blockbuilding due to the fact that you do not need to align the pieces with centers. Start the solve from the orientation where you can execute the blockbuilding the most comfortably.
Step 2: Second Block:
This step is the same as in Roux.
Step 3: CMLL:
This step is the same as in Roux.
Skip here if you know Roux: Step 4: EPA
There are two ways of doing this: the easy way and a more difficult way.
Easy Way:
Insert the two bottom edges, regardless of their orientation, and then examine the permutation of the pieces in the last layer.
If they are in a valid case, (Ua, Ub, H, or Z) then you continue as normal. Otherwise, perform an M or M'. Then solve the cube as normal without performing a M or M' in isolation.
Advanced Way (Counting):
You look at where all of the edges are and figure if an edge is swapped. Doing this at first is a little difficult, but it becomes easier with practice.
To do the process, start with any edge. I use UL. When I look at the UL edge I see that it is unsolved. I will say "1". Then I will look at the edge in the UL slot and see which slot it goes in. I then look at that spot and see it is unsolved. I will say "2", and look where that edge goes, and so on. This process is similar to blind solving.
I will now provide an example.
Example of EPA
It's a counting game, where you count the number of cycles and swaps.
The bad cases are: 2, 4, 6 2+2+2, 3+2
You can understand it as an even number of swaps, when it should be odd due to puzzle geometry.
To practice, look away and do a bunch of M and U, U' U2 moves. Then perform the counting and see if you are correct.
Once you start to count you will pick up many mental tricks to go faster.
Step 5: L6E
This is done like in Roux. If you mess up, do an M or M' and solve again, or perform a parity algorithm.
For the reason that parity is one slice move, this is probably the most efficient solving method for the void cube.
If you have any fun suggestions for the name of this method or for improvements, reply and tell me what you think! I am not the best Roux or void cube solver, but I tried my best.
Obviously some has invented this before so please point me to the original creator
