Showing posts sorted by relevance for query parity. Sort by date Show all posts
Showing posts sorted by relevance for query parity. Sort by date Show all posts

20 October 2022

The 4x4x4 (2/5)

CHAPTER 1: PARITY

Parity - (of a number) the fact of being even or odd; the evenness or oddness of a number.


CHAPTER 2: INTRO

When I started writing my post on the 3x3x3, I bought the Roxenda speed cube set, which includes the 2x2x2, 3x3x3, 4x4x4, the pyraminx, and the megaminx, all for the affordable price of $22.49.  I never wanted the 4x4x4, but my mom scrambled it for me, so I guess I have to learn some stuff and write a post real quick before I attach it to a rocket and shoot it into the sun.


CHAPTER 3: TRANSPOSITIONS

Transposition - the swapping of the elements in a pair

Let's say I have a line segment with two endpoints, A and B.
And let's say I flip it 180° so the endpoints go from here to here:
AB → BA
The endpoints have swapped places, so they have made one transposition.

Now let's say I have a triangle and I rotate the vertices to go from here to here:
AB → CA
C       B
The vertices made two transpositions.
For example, first A with B, and then B with C.
Those two transpositions would take us from the initial position to the rotated position:
AB → BA → CA
C       C       B
Count von Count: one, two transpositions, ah-ah-ah.

Let's say I have a square and I rotate the vertices to go from here to here:
AB → DA
DC     CB
That takes three transpositions.  For example, A/B, then B/C, then C/D.
The vertices look an awful lot like corner cubies on a cube, don't they?

I chose vertices because I prefer corner cubies to edge cubies for this visual, but it's also true that rotating 3 edge cubies = 2 transpositions, and rotating 4 edge cubies = 3 transpositions.

It's sometimes helpful to know the parity of how many transpositions it would take to solve a set of center cubies, a set of edge cubies, or a set of corner cubies.


CHAPTER 4: PARITY OF SETS OF PIECES & PARITY OF PUZZLES

Even permutation - a permutation that creates an even number of transpositions
Odd permutation - a permutation that creates an odd number of transpositions

For the 3x3x3, rotating a face by 90° creates a permutation of the edges and a permutation of the corners.  In terms of transpositions, the 4-cycle of edges = 3 edge transpositions, and the 4-cycle of corners = 3 corner transpositions, so two simultaneous odd permutations occur.
Every time any move is made on the 3x3x3, the total number of transpositions remains even.  The parity of the edge transpositions or the parity of the corner transpositions may be odd, but they'd be odd simultaneously, and their parities would match.  When any move on a permutation puzzle creates an even number of total transpositions between all the sets of cubies, that puzzle is said to have even parity.  So the parity of the 3x3x3 puzzle is even.

Rotating a face by 90° on the 2x2x2 makes a 4-cycle of corners or 3 corner transpositions, so each move makes an odd permutation, and the 2x2x2 puzzle has odd parity.  With each consecutive 90° rotation, the parity state of the corners constantly switches between even and odd.

Rotating a face on the megaminx by 72° makes two 5-cycles.  There are 4 edge transpositions and 4 corner transpositions, or two simultaneous even permutations.  The megaminx is an even parity puzzle; furthermore, the parity of edges is always even, and the parity of corners is always even.

Let's forget about the corner pieces of a pyraminx since they don't affect anything.  A 60° rotation of a face, then, involves a 3-little-edge-cycle and a 3-big-edge-cycle.  The 3-little-edge-cycle yields 2 transpositions and the 3-big-edge-cycle yields 2 transpositions.  Similar to the megaminx, a move on the pyraminx creates two simultaneous even permutations, so the pyraminx has even parity, and furthermore, all of the edges always have even parity.  (I don't know what cubers actually call little edges and big edges because clearly, I'm not a nerd.)

That covers all the permutation puzzles in my Roxenda set except for the 4x4x4.
There are two types of moves you can make on the 4x4x4 - outer rotations and inner rotations.  What a pain - it's enough to make you quit right here.  But, no - the only reasonable way to tackle a problem like this is to write a public letter to myself, so we'll forge ahead, no matter how rough the terrain.  No matter how high the waters.  No matter how deep they run.
A 90° outer face rotation makes 3 single-center transpositions, 3 single-edge transpositions, 3 more single-edge transpositions, and 3 corner transpositions, for a total of 12.  There are 8 single-edges in an outer face, so you might be tempted to think that an outer face rotation creates 7 single-edge transpositions.  However, each rotation does not move an edge cubie to its neighboring slot; if it did, the single-edges would indeed require 7 transpositions.  In reality, each rotation creates two different 4-cycles, each of which requires 3 transpositions.  So an outer face rotation creates four simultaneous odd permutations, two of which cycle single-edges.
A 90° inner face rotation makes 3 single-center transpositions, 3 more single-center transpositions, and 3 single-edge transpositions for a total of 9.  As before, the 8 single-centers create two 4-cycles, each of which requires 3 transpositions.  That makes three simultaneous odd permutations, two of which cycle single-centers.
Because an outer face rotation yields an even parity of total single-edge transpositions, outer face rotations affect the parities of single-centers and corners only.
Because an inner face rotation yields an even parity of total single-center transpositions, inner face rotations affect the parity of single-edges only.
The parity of the puzzle (3 + 3 + 3 + 3 + 3 + 3 + 3) is odd.


CHAPTER 5: THE 3x3x3 REDUCTION

Before we go much further, I ought to mention that the way nearly everybody solves the 4x4x4 is through a method called "reduction."  The cube is "reduced" to a 3x3x3-lookalike by first creating six correctly placed 4-block centers, and then creating twelve randomly placed 2-cubie edges, known affectionately as dedges.  Let's make up a name for the 4-block centers.  "Quenters" is really stupid, but it matches dedges.  Once you write about "cubies," you've already lowered the bar so far that there's no use in trying to pick it back up.  In fact, you may have already noticed that I replace the word "cubie" with "single-center," "single-edge," or "corner" every now and again.

After the quenters are solved, if the last dedges aren't solved in a nice, neat re-ordering of 3 dedges all at once, they will instead present themselves as 2 unsolved dedges, which is more of a headache.  Nobody really talks about it, except to say "here's an algorithm for that."
Single-edge conjugates and commutators can fix that.

In fact, back in 2016 when I went through my first phase of the Rubik's cube, I got very annoyed by the same problem when reducing a 5x5x5.  That puzzle, by the way, is much nicer than the 4x4x4.  After all six of the 9-cubie nonaters (not a real word) are solved, the next step is to create twelve 3-cubie edges, affectionately known as tredges.  I prefer to begin that process by first creating twelve dedges.  In turning dedges into tredges, sometimes you can get stuck pairing up the last two.  My sister came up with a solution, but if I were faced with that problem again, I'd turn to single-edge cycles before anything else.

When a 4x4x4 is in a reduced 3x3x3 configuration, the 24 single-centers and the 24 single-edges have morphed into six quenters and twelve dedges, so the pieces are redefined.  An outer face rotation, then, makes 0 center transpositions, 3 dedge transpositions, and 3 corner transpositions.  An inner face rotation messes up the quenters and dedges, so those moves aren't used.  From here, a 3x3x3 solve is attempted.


CHAPTER 6: PARITY PROBLEMS

I also ought to mention that cubers talk about parity all wrong, and they do it on purpose.  The terms "parity" and "parity error" are used colloquially to describe any sort of problem in cubing.
"False equivocation" is the situation in which an incorrectly oriented piece is assumed to be correctly oriented, or where two identical pieces have had a transposition.  Sometimes the terms "parity" or "parity error" are used to describe the issue of false equivocation.  The two are easily confused, because both lead to a seemingly unsolvable state, and both happen invisibly.
So while mathematicians use "parity" simply to describe the evenness or oddness of a number, and cubers use "parity" to describe any sort of problem, I'll use the phrase "parity problem" to mean "problem related to parity states."  That seems like a totally reasonable compromise to me.
Why anybody would want puzzles with parity problems or false equivocation issues is beyond me.  I feel strongly about this.  Like if I were the head of a puzzle factory, I would employ a person to check permutation puzzle designs for such oversights and reject them before they went into production.  The 12-color megaminx is an excellent puzzle, and the 6-color megaminx, which doubles 6 colors across the 12 faces, is like its stupid sibling who comes with false equivocation issues.


CHAPTER 7: DISCOVERING POSSIBLE PARITY PROBLEMS

Let's sort everything out, for we do love organizing.  We have the following sets of pieces:
single-centers (24); quenters (6); single-edges (24); dedges (12); and corners (8).
In solving the cube, the parities of all the sets eventually need to match.

An outer face rotation affects these groups in this way:
    single-centers - 3 transpositions, odd, does affect parity
    quenters - 0 transpositions, even, does not affect parity
    single-edges - 6 transpositions, even, does not affect parity
    dedges - 3 transpositions, odd, does affect parity
    corners - 3 transpositions, odd, does affect parity

An inner face rotation affects these groups in this way:
    single-centers - 6 transpositions, even, does not affect parity
    quenters - ruins quenters
    single-edges - 3 transpositions, odd, does affect parity
    dedges - ruins dedges
    corners - entirely unaffected

If one set of pieces has odd parity and another has even parity, they are un-matching.
If inner face rotations ruin quenters or dedges, it is preferred to use outer face rotations only.
If two sets of pieces have un-matching parity, and only outer face rotations are available, sometimes the two sets of pieces get locked into un-matching parity states.  When that happens, we'll flag it as a "possible parity problem."
Let's take a closer look.

Can single-centers and quenters be locked into un-matching parity states?
No.  The question is confusing because quenters are made from single-centers.
Technically, inner face rotations ruin quenters, so we'll ignore them for now.
Outer face rotations toggle the parity of single-centers and maintain the parity of quenters.
No parity problem.

Can single-centers and single-edges be locked into un-matching parity states?
No.  Inner face rotations toggle the parity of single-edges and maintain the parity of single-centers, and outer face rotations toggle the parity of single-centers and maintain the parity of single-edges.
No parity problem.

Can single-centers and dedges be locked into un-matching parity states?
Yes.  Inner face rotations ruin dedges, so we'll ignore them for now.
Outer face rotations affect both parities simultaneously.
Possible parity problem.

Can single-centers and corners be locked into un-matching parity states?
Yes.  Inner face rotations affect neither parity.
Outer face rotations affect both parities simultaneously.
Possible parity problem.

Can quenters and single-edges be locked into un-matching parity states?
Yes.  Inner face rotations ruin quenters, so we'll ignore them for now.
Outer face rotations affect neither parity.
Possible parity problem.

Can quenters and dedges be locked into un-matching parity states?
No.  Inner face rotations ruin quenters, so we'll ignore them for now.
Outer face rotations toggle the parity of dedges and maintain the parity of quenters.
No parity problem.

Can quenters and corners be locked into un-matching parity states?
No.  Inner face rotations ruin quenters, so we'll ignore them for now.
Outer face rotations toggle the parity of corners and maintain the parity of quenters.
No parity problem.

Can single-edges and dedges be locked into un-matching parity states?
No.  The question is confusing because dedges are made from single-edges.
Technically, inner face rotations ruin dedges, so we'll ignore them for now.
Outer face rotations toggle the parity of dedges and maintain the parity of single-edges.
No parity problem.

Can single-edges and corners be locked into un-matching parity states?
No.  Inner face rotations toggle the parity of single-edges and don't affect corners.
Outer face rotations toggle corners and maintain single-edges.
No parity problem.

Can dedges and corners be locked into un-matching parity states?
Yes.  Inner face rotations ruin dedges, so we'll ignore them for now.
Outer face rotations affect both parities simultaneously.
Possible parity problem.


CHAPTER 8: WHICH ONES MATTER?

Commutators always use an even number of rotations because every single rotation used in an X or a Y has its inverse coming up somewhere along the way.  Making commutators into the center parts of conjugates doesn't change anything, because every new rotation brings along its inverse as well.
If two sets of pieces are locked into un-matching parity states and one of them is solvable with commutators, then the other wouldn't be.  That's bad, and that's why we marked those situations as "possible parity problems."

The four possible parity problems we found were between the following sets:
    1. single-centers & dedges
    2. single-centers & corners
    3. quenters & single-edges
    4. dedges & corners

Let's take a closer look at the second one, single-centers & corners.  Inner face rotations affect neither parity, and outer face rotations affect both parities simultaneously.  Single-centers & corners, then, must always match!  So they can never reach an un-matching state in which to get locked in the first place!  That means we don't have to worry about them, so our new list is:
    1. single-centers & dedges
    2. quenters & single-edges
    3. dedges & corners

Because we know that single-centers & corners always have matching parity, that means the first and the third groups mean the same thing.  So we can get rid of one of those as well.  Would you rather keep tabs on 24 single-centers or 8 corners?  Me too.
    1. quenters & single-edges
    2. dedges & corners


CHAPTER 9: THE 4x4x4 OLL & PLL PARITY PROBLEMS

The two parity problems in the 4x4x4 are the "orientation of the last layer" (OLL) parity problem, and the "permutation of the last layer" (PLL) parity problem.  The OLL parity problem happens when quenters and single-edges are locked into un-matching parity states, and the PLL parity problem happens when dedges and corners are locked into un-matching parity states.

OLL

An OLL parity problem occurs or does not occur the moment the last quenters are solved and placed.  When the cube appears to approach a solved state, the OLL parity problem looks like two incorrectly placed single-edges or one flipped dedge when the cube is otherwise solved.
The OLL parity problem occurs when the parity of the solved quenters does not match the parity of the single-edges.  Once the quenters are solved, the parity of the single-edges is locked.  Pairing up from single-edges dedges while maintaining solved quenters uses an even number of inner slice moves, so that won't change the parity state of single-edges.  If the single-edge parity is odd the moment the quenters are solved, disturbing a quenter to make a dedge will toggle the single-edge parity to even, and re-solving the quenter will toggle the single-edge parity back to odd.  The same is true if the single-edge parity is even the moment the quenters are solved; as long as the quenters are split and then re-solved with an even number of inner slice moves, the parity of single-edges will remain even.
The parity of single-edges remains locked, unless the quenters are reconfigured with an odd number of inner face rotations.  So that's how you fix the OLL parity problem - breaking the quenters with one inner face rotation and then resolving everything.  It's a huge pain, and this is why the 4x4x4 belongs on a rocket.
If the number of inner face rotations used in the scramble plus the number of inner face rotations used in solving the quenters happens to be odd, then the ending result is a cube with solved quenters with single-edges locked into an odd parity state.  Because an outer face rotation creates 6 single-edge transpositions, no amount of outer face rotations can affect single-edge parity, which means no amount of outer face rotations can solve the single-edges in relation to their quenters.

PLL

A PLL parity problem occurs or does not occur the moment the last dedges are paired.  When the cube appears to approach a solved state, the PLL parity problem looks like two incorrectly permuted but correctly oriented dedges or two incorrectly permuted but correctly oriented corners when the cube is otherwise solved.
The PLL parity problem occurs when the parity of the dedges does not match the parity of the corners.   The two affected dedges or corners could be any two dedges or corners; they wouldn't have to be dedges that are directly across from each other like in the picture above.  With a PLL parity problem, if the dedges are first solved, the problem will present itself in two corners; and if the corners are first solved, the problem will appear in two dedges.
The moment the last dedges are paired, their parity is locked, so if the parity of the dedges is even and the parity of the corners is odd (or vice versa), there will be PLL parity problem.  Inner face rotations would ruin both quenters and dedges, so they aren't used.  Outer face rotations create 3 dedge transpositions and 3 corner transpositions, so they can't help to match the parities.
As with the OLL parity problem solve, solving a PLL parity problem requires breaking out of the 3x3x3-lookalike with an odd number of inner face rotations.  This time, instead of reconfiguring quenters, the dedges are reconfigured in such a way that their parity matches that of the corners.

In sum,
Single-edges and quenters with unmatching parity = OLL parity problem.
Inner face rotations ruin solved quenters (and paired dedges).
Outer face rotations affect the parity of neither single-edges nor solved quenters.
Corners and dedges with unmatching parity = PLL parity problem.
Inner face rotations ruin solved dedges (and solved quenters).
Outer face rotations affect the parity of both corners and dedges simultaneously.


CHAPTER 10: PARITY PROBABILITY

In the 4x4x4 in a reduced state, there's a 50% chance for an OLL parity problem to arise, and independently, a 50% chance for a PLL parity problem.  That means that a quarter of the time there will be neither parity; a quarter of the time there will be an OLL parity problem and not a PLL; a quarter of the time there will be a PLL parity problem and not an OLL; and a quarter of the time there will be both an OLL parity problem and also a PLL parity problem.  When there is neither an OLL parity problem or a PLL parity problem after the reduction, our odd parity puzzle is locked into a state of even parity, and that's lucky.
When choosing the 3x3x3 reduction method, the moment the quenters and dedges are "solved" in a regular 4x4x4, a contract has been signed to accept at least one parity problem 3 out of 4 times.  Does that sound like a good bargain?  I'm pretty sure you're thinking what I'm thinking, so we can say it together: "Nay!  For such a trinket, in which a parity problem appears but once every hundred times - nay, every thousand times - 'tis worth not a wooden nickel!  Not the spit of my cheek, not the glance of my eye, not the smudge of my shoe!"


CHAPTER 11: THE 2x2x2 REDUCTION

If dedges are likely to fail us, why rely so heavily on them in the first place?  To solve the 4x4x4 by reduction without parity problems, begin with a layer approach for the first two layers.  Then treat those two layers as four 2x2x2 blocks on an eight block cube.  The four solved blocks can be separated from one another, as long as they remain solid 2x2x2 blocks.  Then, solve the remaining four 2x2x2 blocks to their remaining corners using moves that don't mess up the first four blocks.
Once the cube is in a state of eight blocks, solve the cube like a regular 2x2x2, which is another odd parity puzzle, but one without new headaches.  (For further reading, see chapter 18 of my original post).
A few notes on this approach:
    1.  It's totally brilliant; the source is superantoniovivaldi.
    2.  It's not the same thing as solving eight blocks from the beginning.  Don't do that.
    3.  It's admittedly slower and more difficult than the 3x3x3 reduction.  So there's that.


CHAPTER 12: CORNER & SINGLE-EDGE COMMUTATOR REVIEW

If you ask me, I think it's best to not use reduction at all.
The PLL parity problem is purely a dedge construct, so it disappears entirely without a full set of completed dedges.  Locking in your quenters can cause an OLL parity problem; the problem with the "don't do that" link above was locked quenters, even though they were spread out among the 2x2x2 blocks.

Let's stop talking about all the things that don't work for a sec and talk about what does: commutators and conjugates.  In the 4x4x4, there are single-center, single-edge, and corner commutators.

I do hope you remember commutators from my original post.  If not, please review chapters 6 and 8 there.  You'll find corner and edge commutators in chapters 10 and 12.  In fact, the only chapters that won't translate well to the 4x4x4 are chapters 13 (edge cycles part II) and 14 (2 edge flip), and that's because those commutators rely on having a central middle slice.  Oh sure, they'd work with 4x4x4 dedges, but that's not what we're talking about right now.  Chapter 12 (edge cycles part I) uses middle slices, but it never mattered that they were in the middle.

But center commutators?  That's new, that's new!  At long last, there's a point to this post!!
And what happened, then?
Well, in Whoville they say –
that the Grinch's small heart
grew three sizes that day.


CHAPTER 13:  THE CENTER 3-CYCLE PART I

We have center cubies Vixen, Mrs. Claus, and the Mayor of Southtown.
As before, Mothernature's is a set of four adjacent lands, each of which is neither Snowmiser's nor Heatmiser's.  We've already been introduced to Vixenland, which sits opposite of Southtown, but I've never mentioned that one of the other two lands happens to be Christmastown.
Come to think of it, I'd also forgotten to mention anything about the carousels that go around Mothernature's!  In the 4x4x4, there are two: the Comet Carousel and the Cupid Carousel.  They run parallel to one another, and neither carousel ever enters Snowmiser's or Heatmiser's.  Each carousel has one seat in each land at all times, and there are two cubies between each passenger seat: a single-edge cubie and a center cubie.  People don't usually talk about it, so I'd appreciate your discretion here, but if passengers enter the carousel without being exactly two cubies apart, the carousels malfunction and bad things happen.
The Station is the only place to change tracks, and it's located in Christmastown.  There's a never-ending fountain of hot cocoa at The Station, just the way you like it.  Everyone loves cocoa and everyone loves The Station.  In fact, drinking cocoa is such a part of the Mothernature's carousel tradition that when two cubies on different carousels find themselves next to one another, they clink their mugs.  It's adorable.

From a solved cube, set yourself up:
(ML)*(U*MR*U-1)*(ML-1)*(U*MR-1*U-1)

When we peek in on our little center cubies, everybody is ready to go home: the miserable Mayor of Southtown is freezing in Vixenland, Mrs. Claus has recently finished a little shopping in Southtown, and Vixen is between the other two in Christmastown, calling it a night after smoking Santa in poker.  Vixen and the Mayor have boarded the Comet Carousel, and Mrs. Claus is alone on the Cupid Carousel.  All three of them are equidistant from the perspectives of Snowmiser and Heatmiser, which means that the carousels won't malfunction.
And so our story begins.

Vixen switches tracks to the Cupid Carousel and collects a cup of cocoa.
    (That's a Christmastown rotation.)
The Cupid Carousel takes Vixen and Mrs. Claus to their respective homes.
    (That's an M slice move; Vixen & Mayor clink in Vixenland.)
Mrs. Claus switches over to the Comet Carousel for her cuppa.
    (That's a Christmastown rotation opposite our first.)
Those 3 moves together were the X in our commutator.

The Mayor takes the Comet Carousel to Christmastown.
    (He accidentally pushes Mrs. Claus into Southtown with that M slice move.)
That was the Y.

The Mayor could always use a cocoa, so he switches tracks to the Cupid Carousel.
    (That's just like our first Christmastown rotation).
The Mayor heads home to Southtown, bringing Vixen back into Christmastown.
    (The Mayor is rather inconsiderate, is he not?  He and Mrs. Claus clink in Southtown anyway.)
Vixen, finding herself at The Station, switches to the Comet Carousel.
    (If Vixen is to be so rudely awoken from her slumbers, she might as well have a second cup.)
That was X-1.

Vixen and Mrs. Claus take the Comet Carousel home, and everybody has a good night's rest.
That was Y-1.
And there's some good news: the fun doesn't stop until chapter 15.


CHAPTER 14: THE CENTER 3-CYCLE PART II

There's another situation you might find yourself in, and that's where Vixen and Mrs. Claus need to switch places.  Vixen is in Christmastown and Mrs. Claus is in Vixenland.  Everyone knows our commutators are 3-cycles, not 2-cycles, so how could this be?  Can you guess?
Well, it's not too tough!  It just so happens that Donner is hanging out in Vixenland before we begin, and she doesn't need to be anywhere else.  She just wants to pick up a cup of cocoa and come back.  I'm telling you, everybody loves The Station.

From a solved cube, set yourself up:
(ML)*(U*MR-1*U-1)*(ML-1)*(U*MR*U-1)

When this story begins, Vixen and Donner are on the Comet Carousel.  You can't see Donner because she matches Vixenland, but she's there.  Mrs. Claus is on the Cupid Carousel, just across the tracks from Donner.  They clink.  As before, Vixen and Donner are two cubies apart, so the carousels won't malfunction.

And as before, Vixen switches tracks to the Cupid Carousel for a cup of cocoa.
The Cupid Carousel brings Mrs. Claus to Christmastown, pushing Vixen into Southtown.
Mrs. Claus changes tracks to the Comet Carousel to get her cocoa.
(X).

The Comet Carousel takes off, bringing Mrs. Claus to Southtown and Donner into Christmastown!
(Y, Vixen and Mrs. Claus clink in Southtown.)

Donner wastes no time switching to the Cupid Carousel to grab her cocoa.
The Cupid Carousel brings Vixen back to Christmastown and Donner back to Vixenland.
Vixen changes tracks to the Comet Carousel, collecting her second cup of cocoa.
(X-1).

Vixen and Mrs. Claus take the Comet Carousel home, and everybody has a good night's rest.
(Y-1, Vixen & Donner clink back in Vixenland.)

The main difference between chapter 13 and chapter 14 is that in chapter 13, the carousels are approaching Christmastown from different directions, starting from Southtown and Vixenland.  In chapter 14, they're both traveling the same direction, beginning in Vixenland.

Just like our corner 3-cycle made use of two opposite planes, Snowmiser's place and Heatmiser's place, our center 3-cycle makes use of two carousel tracks.  And just like two cubies start in Snowmiser's and the third starts in Heatmiser's for a corner 3-cycle, the center 3-cycle is no different: two cubies will always start on one carousel and the third will always start on the other.

If you successfully solved your cube, you're too much!!


  CHAPTER 15: REVIEW  
  THE TOOLBOX  
  Have you collected all 12?  

  1.  The Corner 3-Cycle   (review)
I think of this as the key - the very most important commutator.
Once you understand it, you can understand all commutators.
Also, you can solve the 3x3x3 Rubik's cube with nothing else!

  2.  The 2 Corner Twist   (review)
An orienting commutator is most handy when you'd like to permute without a care in the world.
Pulling a corner out, reorienting it, and placing it back is a little tricky.
Once that sinks in, however, understanding the inverse is nothing.
Our Corner 3-Cycle uses a conjugate in the X of the commutator; this uses two conjugates.

  3.  The Edge 3-Cycle   (review)
  in which M is the first move in the 3-move X  
It's the edge version of the corner 3-cycle!

  4.  The Edge 3-Cycle   (review)
  in which M is the second move in the 3-move X  
Still very much like the corner 3-cycle.

  5.  The Edge 3-Cycle   (review)
  in which M is the 1-move Y  
Not too hard after the first two edge 3-cycles, but a little less related.
This is the first commutator where the 1-move Y is an inner face rotation.
That means the 3-move X will appear to mess up more of the cube than it did before!

  6.  The Edge 3-Cycle   (review)
  in which 3 edges are on the same M  
This edge 3-cycle gets first prize for being the shortest and simplest.
The inverse requires very little effort to think through.
Reorients centers.

  7.  The Edge 3-Cycle   (review)
  in which 4 edges are on the same M  
An extension of the previous, maybe even easier with all 180° rotations.
Also reorients centers.

  8.  The 2-Edge Flip   (review)
This is the other orienting commutator, also most handy.
Pulling an edge out, reorienting it, and placing it back is simpler than twisting a corner.
As with the 2 Corner Twist, the X in the commutator uses two conjugates.
Both reorienting commutator inverses are easier to envision than 3-cycle inverses.

  9.  The Oriented 3-Cycles   (review)
Without pencil and paper, I find these kind of annoying and hard.

  10.  The Center 3-Cycle   (review)
  in 3 different planes  
Understanding both the corner 3-cycle and also the last edge 3-cycle are helpful prerequisites.
Even though there are 3-move X's and 1-move Y's like usual, the rhythms are duples.

  11.  The Center 3-Cycle   (review)
  in 2 different planes  
An important extension of the first, this 3-cycle has two cubies in Vixenland.

  12.  Conjugates in General   (review)
Conjugates are my favorite!
The C's in conjugates move pieces into optimal positions for commutators.
Their inverses restore the cube.  It really is that simple and that amazing.

My my my, we've built quite a lovely toolbox, haven't we?  Any commutator can be put into the middle of a conjugate or inverted (or both), which means our tools are very flexible!


CHAPTER 16: THE MEGAMINX 3-CYCLES

In case you also bought the Roxenda speed cube set for the affordable price of $22.49, you might notice that everything we've talked about translates pretty well to all the puzzles except for the megaminx edges, which are a little tricky.  At first I couldn't figure out how to cycle them, but Jamie Mulholland could, and he explained that even though there are no M moves on a megaminx, M's can be imitated by rotating two outer planes around edges.
The megaminx no longer has five related edge cycles; there's just one and its inverse, but it's fairly powerful.  It's similar to the first commutator in chapter 12 from my original post.  The main thing to remember is that only outer planes are at our disposal, and to create a commutator, we must create a plane in which nothing but an edge has changed.  Let's call that plane Snowmiser's.

When our story begins, edge Vixen and edge Mayor will be hanging out at Snowmiser's.  They do that a lot, much to the Mayor's dismay.  Mrs. Claus could be in a variety of places, but not just any place.  We'll simplify the situation for the purpose of our story and get more into her real specifics in just a mo'.  (Once you hear Julie Andrews say, "mo'" in Thoroughly Modern Millie, it just sort of creeps into your life every now and again.)
When we begin, Vixen and the Mayor are in Snowmiser's.  Mrs. Claus is not.
Also, Vixen and Mrs. Claus both have a Snowmiser tile.  The Mayor does not.
As usual, the plan is to replace edge Vixen (who is at Snowmiser's) with edge Claus (who is not) with the X in our commutator.  Then we'll rotate Snowmiser's to select the Mayor for the 1-move Y.  The inverse of X will bring Vixen back to Snowmiser's while removing the Mayor, and the inverse of Y will rotate Snowmiser's back to its original state.

In more detail, we must prepare for takeoff.
    1.  Edge 1 Position & Orientation
        Because Vixen is an edge, she's in two planes.
            The color of one of her 2 tiles must match the color of the rest of that face.
            That face is Snowmiser's.
            The other face we'll call Vixenland.
    2.  Edge 2 Position
            The miserable Mayor must be at Snowmiser's with Vixen.
    3.  Edge 3 Position
            For now, Mrs. Claus will be positioned in Vixenland across from Vixen.
            Because our planes have 5 sides, she'll be 2 or 3 Vixenland rotations away from Vixen.
    4.  Edge 3 Orientation
            For now, Mrs. Claus will be oriented so that her Snowmiser tile is not in Vixenland.

Here we go.
As it turns out, there's only one way to begin our X, and that's to take the two corners adjacent to Vixen and move them together, away from Mrs. Claus, in the same direction.  (That means one of the planes will be moving clockwise and one will be moving counterclockwise, just like opposite planes on a cube when they're moving in the same direction.)
Our next step is to replace Vixen with Mrs. Claus.  In our simplified story, we'll rotate Vixenland 2 or 3 times until we've made the switch.  Notice that we have steered clear of those moving corner planes!
To restore Snowmiser's, both of Vixen's original corners come back to where they were, snuggling Mrs. Claus instead of Vixen.
That was our 2+1+2 move X.  It's just a 3-move X that involves a weird two-part corner move.
Our 1-move Y is a Snowmiser rotation that brings the Mayor to where Claus just arrived.
Taking the inverse of X and then the inverse of Y of course completes the megaminx edge 3-cycle and otherwise restores the dodecahedron that we may have newly discovered feelings of attachment towards.

Okay, once that makes some sense, let's revisit Mrs. Claus' possibilities.  We already know that Vixen's position and orientation defines both planes Snowmiser's and Vixenland.  We also know that Vixen and the Mayor will be on Snowmiser's.
    3.  Edge 3 Position
            Mrs. Claus' position and orientation are very complicated.
            Once the first double corner move has been executed, we cannot rotate Snowmiser's.
            Nor can we rotate any of Snowmiser's 5 original corners.
            That means we cannot rotate seven out of twelve planes.
            But... that means we can move the other five planes!
            The five planes that don't bother Snowmiser's corners are:
                Vixenland
                The two planes across Vixenland opposite Snowmiser's
                    (Sort of like a two-land Heatmiser's)
                The only other plane joining the previous two planes
                Moving around the dodecahedron in the same direction, the next plane
            Mrs. Claus can be any of the eighteen edges on those five planes.
            (That's what I meant when I said this commutator was "fairly powerful.")
    4.  Edge 3 Orientation
            However Mrs. Claus moves across those 5 planes, her second to last move
                must have her arrive in Vixenland with her Snowmiser tile outside of Vixenland.
            Her final move will be a Vixenland rotation transporting her to Snowmiser's.
            When she arrives to Snowmiser's, her snowmiser tile will, of course, match that face.

Wasn't that wild?
Now that the edges are old hat, we can address the corners.  The megaminx corner 3-cycle is like the first commutator in our toolbox, so this part is easy.
Similar to the Mrs. Claus specs in the megaminx edge 3-cycle, the long part of the corner 3-cycle commutator (the middle of our X) includes a choice of fourteen corners across seven planes of rotation, while the short part (the 1-move Y) only offers a selection of four Snowmiser corners.

In either case, it makes just as much sense to put a shorter commutator into the middle of a conjugate, but there are times in life when we do crazy things just for the fun of it.  I'm pretty sure that's what they mean when they say, "Carpe diem."


CHAPTER 17: THE MEGAMINX ORIENTED COMMUTATORS

Now that we know how to permute edges on a megaminx, we can figure out a 2-edge flip.  It starts off the same way as the megaminx edge 3-cycle: Jingle's two adjacent corners move in the same direction, and Snowmiser's is defined.  Jingle rotates twice (144°, not 72°) on the non-Snowmiser plane to avoid the seven untouchables.  Two more adjacent plane rotations will take care of the reorienting, and 144° in the same direction he's been travelling will bring him back to Snowmiser's but upside down.  His two original adjacent corners return to their places, and that's the end of X.
Snowmiser's is rotated to select Jangle.
Jangle's corners rotate the same way Jingle's did, Jangle does the Jingle dance but backwards (I believe that's called the "Elgnij"), and his corners return to their original places to complete the commutator.

The megaminx 2 corner twist is so similar to the cube 2-corner twist that it's hardly worth mention.
For all reorienting commutators,
First, the plane that holds both to-be-reoriented pieces is identified.
In my last post, I called this plane Snowmiser's.
The X in all the reorienting commutators does 3 things:
    1.  It removes one piece from Snowmiser's
    2.  Reorients that piece, and
    3.  Returns that piece to Snowmiser's without otherwise disturbing Snowmiser's.
The Y rotates Snowmiser's to select the second piece that will be reoriented.
The rest of the commutator re-solves everything.

If you know how to build a cross, place corners, and place second-layer edges with double Z-commutators (covered in chapters 16 and 17 of my original post), then you can create simple conjugates around those skills to solve all but one face on the megaminx.  Or you could solve all but two, leaving a "column" open to re-orient the last edges intuitively (as described in chapter 19 of my original post).  In either case, once you're at that point, a few conjugates with chapters 16 and 17 of this post will finish the solve.
Chapter 15 of my original post walks you through creating conjugates for single layers.  Basically, it just tells you to move your pieces off one layer so that they're ready for takeoff, perform your commutator, and move everything back to where it was with the inverse of your first sequence of moves.

It looks like I've finally written out how to solve all the cubes and the megaminx from my Roxenda speed cube set.  There's no way you'd get to this point without being able to solve the pyraminx, but if you have, you've officially gotten away with graduating Rubik's Cube 202 totally unqualified.  That would actually be so astounding that I'd be forced to offer my deepest heartfelt congratulations.


CHAPTER 18: MUSINGS ON INVERSES

It should come as no surprise that sometimes I need a piece of paper to help keep track of what I'm doing, or to jot down the C's in my conjugates.  If you find yourself jotting something down, and you think there might be a simpler way to approach a problem, you can always try thinking of cycling your Vixen backwards, which means you'd be thinking in terms of inverses.
Speaking of inverses, the stories in chapters 13 and 14 from this post are based on the inverses of the center commutators that are normally presented, so if you learn center commutators from someone else and they're different from mine, that's why.  My first post had 3-move X's and 1-move Y's, and I require compelling reasons to be inconsistent.

Let's take a moment to review 3-cycle commutators with longer X's and 1-move Y's, along with their inverses, which are commutators with 1-move X's and longer Y's.  It's nice to be a stranger to neither.  To begin, we'll need a piece (let's call it V) which is correctly oriented to travel to its slot (let's call that S) through a given plane of rotation (let's call that P).  So on the 4x4x4, P could be U, D, R, L, F, B, MU, MR, MF, or even MD, ML, or MB.  (Cubers have a different notation for this, but then you have to memorize their arbitrary directions.)
It's rather clumsy to use one variable for a piece, one variable for a position, and one variable for an entire plane, but there it is.  That's to say nothing of the fact that two other variables, X and Y, are being used to represent a sequence of rotations.  Please bear with me.

V must be able to travel to S by moving P some number of times (P, P-1, or P2), which means both V and S are contained in plane P.

During the longer X, V is moved out of P without otherwise disturbing P.  Then, the 1-move Y rotates P so that S occupies V's original position.  The longer X inverse puts V into S, and the 1-move Y inverse returns S to where it belongs.

For a 1-move X, P is rotated so that V moves to S's spot immediately, also moving everything else in P with it.  The longer Y removes V from P without otherwise disturbing P.  The 1-move X inverse returns P back to where it belongs, and the longer Y inverse puts V into S.

Naturally, you have to keep track of what exactly is replacing Vixen, as well as its orientation, if you're wanting to solve more than one piece at a time, so those details give you the specifics of what exactly to do in the longer part of the commutator and how to rotate the 1-move part.


CHAPTER 19: THE SUPERCUBE

Cubes that require specifically oriented single-centers are called "supercubes."  Single-centers always rotate around the center point of the four-square quenter area; that's just how outer and inner rotations move them.  If you'd like to turn your 4x4x4 cube into a supercube, first solve it, and then put 16 little stickers, all with the same orientation, on each face.  That will do the trick, but if you'd like to turn your 4x4x4 into a supercube with some class, make sure to orient opposite sides so that they're both pointing in one direction together, and make sure no corner is adjoining two planes that have orientations 0 or 180° apart.  Supercubes don't get classier than that.
If, on the other hand, you'd like to be the proud owner of the least classy supercube on the block, you could take a sharpie and draw a really ugly picture on each face.  That would work too.
For the 4x4x4 supercube, nothing we know about the corners or single-edges changes, but the way our center 3-cycles orient our single-centers is suddenly useful.

Whether our cubies traipse across 2 or 3 different lands, the following observations remain:

Vixen never gets re-oriented.
(Of course she doesn't; that's what defines her as our Vixen.)
Claus, Mayor, and Donner always rotate towards the center line between the carousels.

In terms of inverses, Vixen would first travel to a new land instead of switching tracks.
Vixen still never gets re-oriented.
Claus, Mayor, and Donner still always rotate towards the center line between the carousels.
What changes is the direction of the 3-cycle.
Vixen will start moving the 3-cycle in a clockwise or counter-clockwise direction.
Naturally, everyone else will follow suit.

Friendly reminder:
The last two edge commutators in the toolbox (#6 & #7) do reorient centers, so they should be used on supercubes with discretion!


CHAPTER 20: CONCLUDING REMARKS & SOURCES

Most people who don't want to memorize algorithms run into a parity problem, re-scramble the cube, and just hope for the best.  A step up from that would be understanding what causes the parity problems, strategically "scrambling" the cube with an inner face rotation, and re-solving.  Re-solving with conjugates and commutators specifically makes sense because commutators will maintain parity for any set of pieces.  Being of the form C*X*Y*X-1*Y-1*C-1, they guarantee an even number of every type of move.

Solving the 4x4x4 with the centers last makes the most sense to me.  It's called the "cage method" because the solved pieces look like a cage.  (I've listed a source that goes into the details of how to do this most efficiently below, but I've paid it no attention myself.)  My reasoning is that you won't run into a PLL parity problem if you're not married to dedges, and if you run into the OLL parity problem, which could happen because your quenters have a parity state whether or not they're solved, then an inner face rotation would disrupt up to 4 incorrectly solved single-edges instead of up to 4 incorrectly solved single-edges and 8 incorrectly solved single-centers.

Because an OLL parity problem appears to require a 2-cycle, using an inner face rotation to fix it is related to chapter 18 of my original post.  If you'll recall, we discovered that if a 3x3x3 cube appears to require a 2-cycle of edges and a 2-cycle of corners, rotating a face may "un-solve" some pieces, but in return, our newly unsolved pieces could now be prepared for 3-cycles.
By the by, as previously hinted at in chapter 11 of this post, that's also everything you need to know about solving the 2x2x2.

But back to the cage method - because corners don't move on inner face rotations, I'd start with those.  After that, there's no real need to avoid dedges should they arise: they just oughtn't be solved all at once.  Of course, all three of the edge commutators and the 2-edge flip from my original post work on dedges.  And once that cage is complete, you can cocoa your way out of there like a boss, with nary a par'y in sight.

And yes, I can solve the 4x4x4 faster and more easily through reduction and backtracking than with dozens of commutators, but for the times I pride myself on taking a journey with no hidden detours, I solve this thing a little bit faster than a squirrel could.

Center commutators and single-edge commutators might be a little tedious, but you won't be making a deal with the devil 75% of the time.  And as always, if you're not ready for take off, you can always use conjugates so that you are (no rules just right).  With center commutators, sufficient C's are often just simple outer face (U D R L F B) rotations.
If you'd like to look into this a little more on your own, I should warn you that parity is most often explained by people who don't know what they're talking about.  In the last post, I emphasized that Ryan Heise's website was my favorite source, but that was my favorite source amongst many correct sources.  No such luxury this time.  Be careful out there, and start with these.  These are good sources.


SOURCES


"Let's talk about parity!"

"It's fascinating."

"You don't mind this, do you?"

"... We don't mind at all...  Thank you, Santa."

(My 4x4x4, headed at warp speed towards a big ball of fire)

Entire Series:

29 January 2023

The Skewb & SQ1 (4/5)

INTRO

This is my fourth post on permutation puzzles.  The others are here:
    The Rubik's Cube (1/5)
    The 4x4x4 (2/5)

The first post covers conjugates and commutators and how they pertain to the Rubik's Cube, the second covers the notion of a "parity problem," and the third documents my kids' course.  From developing an interest in these puzzles, I've acquired the following collection:

15 Puzzle
Tower Cuboid, Domino Cuboid
Ivy Skewb, Dino Skewb, Skewb
Pocket Cube, Rubik's Cube, Rubik's Revenge, Professor's Cube
Cylinder Shape Mod, Windmill Shape Mod, Fisher Shape Mod, Axis Shape Mod
Pyraminx, Pyramorphix, Mastermorphix
Kilominx, Megaminx
Square 1

20 Stickerless QiYi Brand Permutation Puzzles

Sleepin' in Their Basket

The reasoning behind solving all of these puzzles is related, but the Skewb and the Square 1 (SQ1) seem to require some additional attention.  That, and the fact that my faithful friend Jack keeps editing these posts out of the goodness of his heart, is why I'm back.  I'll try to make it short.
Skewb, SQ1, Domino Cuboid


CHAPTER 1: THE SKEWB

Chapter 17 of my original Rubik's Cube post reads:
The 3-cycles we've been creating are more complicated commutators that yield simpler outcomes, and Z/Y commutators are simpler commutators that yield more complicated outcomes. In this chapter, we're observing what these simple commutators do, and taking advantage of them to permute our pieces in a way that's convenient for us.
(Aside: the Skewb permutation puzzle relies on simple commutators that yield more complicated outcomes only, as it's impossible to construct more complicated commutators that yield simpler outcomes!)

The Skewb has 6 centers and 8 corners.  One twist on the Skewb displaces half the puzzle: 3 centers and 4 corners.  It's like the Pocket Cube in terms of severe displacement, but without the option to create simple X's and Y's that that have an intersection of 1.
If we can't easily create 3-cycles, we must try a (simple) commutator X*Y*X-1*Y-1 in which both X and Y are two different 120° rotations, and make a note of the results.  Such a commutator on the Skewb preserves 6 pieces: 4 corners surrounding a center, that center, and an adjacent center.  The remaining 4 centers have been permuted by two 2-cycles, and the remaining 4 corners have been reoriented.  Because of the two 2-cycles, doubling the commutator, X*Y*X-1*Y-1*X*Y*X-1*Y-1, is an algorithm that affects corner orientation only!

Thus, the way the Skewb is solved is as follows:
One center and its surrounding four corners are solved by blockbuilding.
The corners must coordinate with one another, but not with other centers.
This automatically places the final four corners.
Let X and Y be 120° rotations that do not disturb the solved center.
The commutator X*Y*X-1*Y-1 is then used to place the remaining centers.
Finally, doubling the commutator, X*Y*X-1*Y-1*X*Y*X-1*Y-1, reorients the final four corners.
The Skewb has to be correctly positioned for this to work, but I'm sure you can figure that part out much more easily than if I write another paragraph about it.  Doing it wrong won't permute anything anyway, so you don't have much to lose.

Although the initial reasoning behind this is a little tricky, solving the cube becomes very easy rather quickly.  It's a lovable little thing.


CHAPTER 2: SQ1 INTRO & NOTATION

If the Skewb is a lovable little thing, SQ1 is quite the opposite.  It's nerdy.  And for an official "World Cube Association" event, unpopular.  Maybe even annoying.  It's so unlike its peers.
The first thing to notice is that it's structured differently.  SQ1 is a 3 layer cube in which the middle layer is a 2-piece equator that is very easy to manipulate.  Solving the puzzle, then, is really a matter of solving the top and bottom layers.  I'll call these U and D.
SQ1 is a shape mod that's first made into a cube.  Typically, the yellow and white pieces are placed into their respective sides, and then everything gets permuted around.  At some point in this process, the parity state must be addressed.  More on that in a mo'.

Because the SQ1 moves so differently, it requires its own notation.
To read notation, it is assumed that
    the shorter part of the equator when viewed from the front is always on the left.

The equator only allows 180° turns, so the notation   /   means a 180° turn on the right.

Meanwhile, measuring angles from the center of U or D, each corner piece is 60°.
Each edge piece is 30°.
    (Each of 12 corner and edge pieces on a SQ2 are 30°!)
U and D rotations are therefore based on the number of 30° angles.
As is standard, a positive number indicates clockwise, and negative indicates counterclockwise.
Putting this together, 3 = 90° clockwise.
5 = 150° clockwise.
-3 = 90° counterclockwise.

() are used to organize numbers to mean a rotation on U and a rotation on D.

The notation (3,3) means a 90° clockwise U turn and a 90° clockwise D turn.
Remember, clockwise is determined "when looking at the face."
So (3,3) requires that U and D faces to shift in opposite directions.
(1,-1) means a 30° clockwise U turn and a 30° counterclockwise D turn.
U and D would then move in the same direction, imitating a middle slice move.
(1,6) means a 30° clockwise U turn and a 180° D turn.

Putting this together with 180° R turns (/), an example of SQ1 notation is:
    (6,0)/(6,0)/(6,0)/(6,0)
This algorithm flips the right side of the equator.
For all algorithms, the left side of the equator never moves.

Another example of SQ1 notation is:
    /(6,6)/(-1,1)
That one exchanges U with D.
If an algorithm affects either U or D only, knowing how to exchange U and D can be very handy.  For example, let's say that I want to permute something and my algorithm affects U only, but my issue is in D.  I can bring D to U, perform my algorithm, and swap them back.  Conjugates :)


CHAPTER 3: SQ1 CUBE SHAPE

The first step is to get this thing looking like a cube.  To do that, we need to get 4 corners alternating with 4 edges in both U and D.  Intuitively, this is not one of our skills; our hunting and gathering backgrounds did nothing for us here.  One thing we can do, however, is recognize symmetry.  The most straightforward method to go about cube shape is to find symmetry.
Fuss about until all 8 adjacent edges and 2 corners are in U, leaving D with 6 corners.  Of course you could do this backwards and put the 6 corners in U instead, but you wouldn't be able to see what you're doing, so I wouldn't recommend it.  Tingman calls that shape "the Millennium Falcon," and I think that's a pretty good name for it.  After we find the Millennium, we split the 8 edges into two 4's, the two 4's into four 2's, four 2's into four 1's and two 2's, and then finally into all eight 1's.  Then it's a cube.
Millennium Falcons in Pretty Colors

Once the SQ1 is in cube shape, if U or D (not both) is offset by exactly 1, then / maintains cube shape.  Of course, 3's, -3's, and 6's after (1,0) or (0,-1) won't destroy cube shape either.  It's handy to know this when exploring your own algorithms.  

For example, the algorithm (1,0)/(-1,0) exchanges half of U with half of D.
Try it and its inverse.

Here's the right equator flip we saw in the last chapter, but without leaving cube shape.
    (1,0)/(6,0)/(6,0)/(5,0)
        Let's call it the "Equator Flip."
        Repeating it will restore the cube.

Here's the U and D flip without leaving cube shape.
    (1,0)/(6,6)/(-1,0)
        For all you Stranger Things fans, let's call it the "Upside Down."
        Repeating it will restore the cube.

    (1,0)/(-1,-1)/(0,1)
        transposes the pair of front and back edges of U and D.
        Because those edges gallop around so fast, let's call it the "4 Horsemen."
        Repeating it will restore the cube.

    (1,0)/(3,0)/(-1,0)
        swaps a quarter of U with a quarter of D;
        It also shifts a quarter of U and D clockwise.
        Interesting!

So (1,0) puts us in cube shape position and /(3,0)/ starts permuting quarter squares (quarters).
Playing with that, it appears that
    (1,0)/(3,0)/(3,0)/(3,0)/(3,0)/(3,0)/(2,0)
        cycles quarters around; the whole thing is an identity algorithm.


CHAPTER 4: SQ1 PARITY PROBLEMS

It's time to talk about parity.
Imagine there are 3 corners on the right side of U and 3 corners on the right side of D.  It's true that a / creates 3 2-cycles of corners.  A 2-cycle is a transposition, so that's an odd number of transpositions!!  The entire point of my second post was to explain that an odd number of transpositions is... unkind.  The Rubik's Cube never shows such unkindness.
Remember how when we were getting into cube shape, we put 6 corners into D?  Well, it's also true rotating the 6 corners once, like (0,2), creates a 6-cycle of corners, which requires 5 transpositions.  That's an odd number of transpositions again!  Unkindness again!
(The SQ2 looks like a tremendous pain, but at least it does not have these problems.  A / would create 6 transpositions instead of 3, and a (0,2) would create 10 transpositions instead of 5.  But I digress.)

So there are parity problems in SQ1, and two ways we know to wrong the right or right the wrong.

Advanced SQ1 competitors know how to check for parity problems before getting into cube shape.  While that's ideal, it requires memorizing a "reference scheme" and making a bunch of calculations concerning 6 different things.  I'm not against calculations, as ridiculous as they may be, but I'll be damned if I'm memorizing a "reference scheme."
Other cubers nearly solve the SQ1, find there is parity half the time, curse, and then apply some monstrous algorithm at the very end.  That is also entirely unreasonable.

What to do, what to do.  Well.
Because I refuse to memorize a reference scheme, the first step would have to be for me to get this thing into cube shape.  After that, instead of orienting or permuting pieces, I could start counting all the cycles for the corners and the edges as a way of checking the parity of all transpositions required to solve the cube.  Do you remember when I was talking about subgroups under chapter 3 on group theory in my first post?  Of course not.  That part goes over counting cycles.
Let's say I begin my parity checking process by counting a corner cycle.  At random I'd choose a corner, C1, which is in a slot, S1.  If Cis solved, meaning that S1 is C1's correct slot, then we can say C1 is part of a 1-cycle and it requires 0 transpositions to become solved, and that cycle's parity is even.
If C1 is not solved, meaning that S1 is not C1's correct slot, I'd look at C1's correct slot to find a new corner, C2.  If C2's correct slot was S1, then C1 and C2 would make a 2-cycle, which requires 1 transposition, and that cycle's parity would be odd.
But if C2's correct slot was not S1, I would look at C2's correct slot to find C3.  If C3's correct slot was S1, then C1C2, and C3 would make a 3 cycle, which requires 2 transpositions, and that cycle's parity would be even.
And so on and so forth.
I'd add up the number of transpositions of all the cycles for corners and all the cycles for edges on U and D to determine the overall parity state.  If the cube happened to be completely solved, that number would be 0.  If all 8 corners were involved in a single cycle, that would require 7 transpositions, and if all 8 edges were involved in another single cycle, that would require 7 more.  In other words, I must count to some number ≥ 0 but ≤ 14.
Once the puzzle is in cube shape and remains in cube shape, the parity of transpositions is locked.  To avoid parity problems, we want the cube shape to be locked in an even parity.

If the parity of total transpositions were even, I would simply continue solving the cube.  If it were odd, I'd have to fix that by taking my cube back to the Millennium with /(3,3)/(1,2)/(4,2)/.  Then I'd (0,2) to swap parity, and restore to cube shape once again.
Altogether, that would look like this:
         /(3,3)/(1,2)/(4,2)/
         (0,2)
         /(-2,4)/(1,2)/(-3,-3)/

But wait!  We know of not one, but two ways to right the wrong!  I could also toggle parity by taking my cube back only most of the way towards the Millennium, /(3,3)/(1,2)/, noticing an abundance of adjacent corners on both my U and D.  Then I could move the 3 adjacent corners on U and and the 3 adjacent corners on D over to the right side with (2,-2), and swap parity with /.  Then I'd restore cube shape.  That would be kind of showoffy.
Altogether, that would look like this:
        /(3,3)/(1,2)/
        (2,-2)/
        (4,-4)/(1,2)/(-3,-3)/


CHAPTER 5: BUILDING SQ1 ALGORITHMS

By now, you may have wondered why I included the Domino Cuboid in my photo.  To solve the Domino Cuboid in terms that made sense to me, I used simple commutator/blockbuilding skills to simultaneously solve the edges, and then I wrote a commutator for the corners.  The X in my commutator was R2*U*R2*U-1*R2, and the Y was some form of D.  Mainly, my point is that the R2 reminds me a lot of the /.  The 180° flip is weirdly constricting, but solving the Domino gives me the courage to explore the SQ1.  I recommend trying these puzzles in that order.  With the notion that we're going to be using something like R2's all the time, let's start building algorithms.

Here's where we left off at the end of chapter 3:
    (1,0)/(3,0)/(-1,0)
        swaps a quarter of U with a quarter of D;
        it also shifts a quarter of each U and D clockwise.
        This is an algorithm about making quarters, so let's call it the "Washington."
        And if we're going to be talking about quarters, let's abbreviate them.
        FR - front right quarter
        FL - front left quarter
        BR - back right quarter
        BL - back left quarter

Say we wanted to permute quarters but maintain orientation.
We know
    (1,0)/(3,0)/ would get us started.
    (3,3)/(3,0)/ would move all the quarters to their original faces.
    (5,6) would reorient the cube so we could see what happened.
Altogether,
    (1,0)/(3,0)/(3,3)/(3,0)/(5,6)
        swaps BR & BL in both U and D.
        This is an algorithm about 4 oriented quarters, so let's call it "2 Heads 2 Tails."
        Repeating it will restore the cube.

Also, because
    (1,0)/(3,0)/(3,3)/(3,0)/(5,6)
        swaps BR & BL in both U and D,
I should be able to perform the algorithm, reposition one face only, and repeat the algorithm.
The second iteration will re-solve the face I didn't reposition!
That's just like what I was talking about with the Skewb.
    (1,0)/(3,0)/(3,3)/(3,0)/(5,6) (no slash, just resetting)
    (0,3) (rotating)
    (1,0)/(3,0)/(3,3)/(3,0)/(5,0)
        Aha!
        This one swaps FL & BL in D only.
        Repeating the whole thing will restore the cube.
        This is an algorithm about two oriented quarters only, so let's call it the "Half Dollar."
        But actually, "Kennedy" is cooler.
        Repeating it will restore the cube.

Related Kennedys:
    (1,0)/(3,0)/(3,3)/(3,0)/(5,6) (no slash, just resetting)
    (0,-3) (rotating)
    (1,0)/(3,0)/(3,3)/(3,0)/(5,0)
        swaps FR & BR in D only.
        Repeating it will restore the cube.
    (1,0)/(3,0)/(3,3)/(3,0)/(5,6) (no slash, just resetting)
    (0,6) (rotating)
    (1,0)/(3,0)/(3,3)/(3,0)/(5,3)
        swaps FL & BR in D only.
        Repeating it will restore the cube.
    (1,0)/(3,0)/(3,3)/(3,0)/(5,6) (no slash, just resetting)
    (3,0) (rotating)
    (1,0)/(3,0)/(3,3)/(3,0)/(-2,6)
        swaps FR & BR in U only.
        Repeating it will restore the cube.
    (1,0)/(3,0)/(3,3)/(3,0)/(5,6) (no slash, just resetting)
    (-3,0) (rotating)
    (1,0)/(3,0)/(3,3)/(3,0)/(-1,6)
        swaps FL & BL in U only.
        Repeating it will restore the cube.
    (1,0)/(3,0)/(3,3)/(3,0)/(5,6) (no slash, just resetting)
    (6,0) (rotating)
    (1,0)/(3,0)/(3,3)/(3,0)/(2,6)
        swaps FR & BL in U only.
        Repeating it will restore the cube.

Let's go back to Washington.
     (1,0)/(3,0)/(-1,0)
        Specifically, this moves
            BL in U to FR in D
            BR in D to FL in U
            FL in U to BL in U
            FR in D to BR in D
        Washington doesn't affect FR & BR in U or FL & BL in D.
That means I should be able to
    1.  Flip 4 quarters around with Washington,
    2.  Reposition U and D with (3, 3) so the scrambled quarters are in the back, and
    3.  Swap adjacent quarters with 2 Heads 2 Tails to get one unsolved quarter on each face.
           Let's try it out:
    (1,0)/(3,0)/(-1,0) (no slash, just resetting)
    (3, 3) (rotating)
    (1,0)/(3,0)/(3,3)/(3,0)/(2,3)
        Eureka, it worked!!!
        BL in U transposed with BR in D.
        Repeating it restores the cube, natural, natural.
        This is an algorithm that maintains 3/4 of each face!
        Let's add up those quarters and celebrate with some "Charles Shaw."

I was hoping to get to something like this.  Originally, I was thinking that from here I'd further isolate a corner or an edge to make a commutator.  But as I'm entirely unwilling to leave cube shape even for a moment, all I can permute are quarter squares.  Also, so many of my algorithms are quarter square transpositions that leave the rest of the cube intact, which means I've already acquired more powerful tools than I had predicted.  So it looks like I need to reevaluate my plan and solve this thing by reduction!


CHAPTER 6: THE DOUBLE KENNEDY

Well, to be honest, I failed.  I was able to solve my SQ1, but not in a way that I was happy to present to you.  I still had to derive one more thing.  Begrudgingly, I admit that it appears to be important to understand both types of quarter groupings: (1,0) and (0,-1).  Luckily for us, that's not difficult at all.

There comes a time in blockbuilding quarters where you can run into something that feels like a parity error due to the limitations of my algorithms.  So we need one more tool.  You see, our quarter swapping algorithms make a 2-cycle of corners and a 2-cycle of edges.  The 4 Horsemen makes one 2-cycle of edges in U, and another in D.  But what we can't do yet is make 2 corner or edge transpositions in only one face.  That's also known as a 3-cycle, and those are all over my other permutation puzzles.  It took me a little while to figure this one out, but I finally got it.

First, let's just explore what (1,0) and (0,-1) quarters are in the first place.
When using algorithms that begin with (1,0) and not (0,-1),
    Quarters are edges then corners when moving clockwise.
    Think of corners as having 2 colors, not 3.
    The first corner color is yellow or white.
    The second edge-matching color is on each corner's counterclockwise side.
    The third color is completely ignored.
    We'll call these (1,0) quarters.
On the other hand, when using algorithms that begin with (0,-1) and not (1,0),
    Quarters are corners then edges when moving clockwise.
    The first corner color is yellow or white.
    The second edge-matching color is on each corner's clockwise side.
    We'll call these (0,-1) quarters.
    Because our algorithms were written for (1,0) quarters, we mostly use those.
    Luckily, extending our understanding to (0,-1) quarters is not hard at all!

If we momentarily think in (0,-1) quarters and then return to (1,0) quarters, we can move edges around but leave corners untouched!  But we never have to stop thinking in quarters!  We just have to think in two kinds of quarters with overlapping corners!

(0,-1) Kennedy looks like this:
    (0,-1)/(3,0)/(3,3)/(3,0)/(6,-5) (no slash, just resetting)
    (0,3) (rotating)
    (0,-1)/(3,0)/(3,3)/(3,0)/(6,1)                 
        That maintains U and swaps FL and BL (0,-1) quarters in D.
To turn that into a edge 3-cycle, follow up with the corresponding (1,0) Kennedy!
We started with a (0,-1) Kennedy DL, so in this case, we'll continue with a (1,0) Kennedy DL:
    (1,0)/(3,0)/(3,3)/(3,0)/(5,6) (no slash, just resetting)
    (0,3) (rotating)
    (1,0)/(3,0)/(3,3)/(3,0)/(5,0)   
        Look!  It's a clockwise 3-cycle of D front, back, and left edges!  Thrilling!!

I'll call the 3-edge cycle a DoubleKennedy.

Specifically, that one was the DoubleKennedyDL, and altogether, it looks like this:
    (0,-1)/(3,0)/(3,3)/(3,0)/(6,-5) (no slash, just resetting)
    (0,3) (rotating)
    (0,-1)/(3,0)/(3,3)/(3,0)/(6,1)
    (1,0)/(3,0)/(3,3)/(3,0)/(5,6) (no slash, just resetting)
    (0,3) (rotating)
    (1,0)/(3,0)/(3,3)/(3,0)/(5,0)
        Cycles D front, back, and left edges clockwise

DoubleKennedy DR:
    (0,-1)/(3,0)/(3,3)/(3,0)/(6,-5) (no slash, just resetting)
    (0,-3) (rotating)
    (0,-1)/(3,0)/(3,3)/(3,0)/(6,1)
    (1,0)/(3,0)/(3,3)/(3,0)/(5,6) (no slash, just resetting)
    (0,-3) (rotating)
    (1,0)/(3,0)/(3,3)/(3,0)/(5,0)
        Cycles D front, back, and right edges clockwise

Counterclockwise DoubleKennedys, on the other hand, begin with (1,0) Kennedys:
    (1,0)/(3,0)/(3,3)/(3,0)/(5,6) (no slash, just resetting)
    (0,3) (rotating)
    (1,0)/(3,0)/(3,3)/(3,0)/(5,0)
    (0,-1)/(3,0)/(3,3)/(3,0)/(6,-5) (no slash, just resetting)
    (0,3) (rotating)
    (0,-1)/(3,0)/(3,3)/(3,0)/(6,1)
        Cycles D front, back, and left edges counterclockwise

    (1,0)/(3,0)/(3,3)/(3,0)/(5,6) (no slash, just resetting)
    (0,-3) (rotating)
    (1,0)/(3,0)/(3,3)/(3,0)/(5,0)
    (0,-1)/(3,0)/(3,3)/(3,0)/(6,-5) (no slash, just resetting)
    (0,-3) (rotating)
    (0,-1)/(3,0)/(3,3)/(3,0)/(6,1)
        Cycles D front, back, and right edges counterclockwise

You get the idea.  You could cycle edges in U by changing (0,3) to (3,0), etc.
I won't muddy up our toolbox with all of these because you don't actually need to understand it for my method.  You just need to be able to start an algorithm with (0,-1), like maybe one time.  Of course, now that you know how to make 3-cycles of edges, you can solve a SQ1 a great variety of ways.


CHAPTER 7: SOLVING THE SQ1

  7.1: TOOLBOX OF DERIVABLE ALGORITHMS  
Dolla'Dolla'(1,0)/(-1,0) (Chapter 3)

Equator Flip(1,0)/(6,0)/(6,0)/(5,0) (Chapter 3)

Upside Down(1,0)/(6,6)/(-1,0) (Chapter 3)

4 Horsemen(1,0)/(-1,-1)/(0,1) (Chapter 3)

Washington(1,0)/(3,0)/(-1,0) (Chapter 5)

2 Heads 2 Tails(1,0)/(3,0)/(3,3)/(3,0)/(5,6) (Chapter 5)

Kennedy DR(1,0)/(3,0)/(3,3)/(3,0)/(5,6)(0,-3)(1,0)/(3,0)/(3,3)/(3,0)/(5,0) (Chapter 5)
2H2T(0,-3)2H2T

Kennedy DL(1,0)/(3,0)/(3,3)/(3,0)/(5,6)(0,3)(1,0)/(3,0)/(3,3)/(3,0)/(5,0) (Chapter 5)
2H2T(0,3)2H2T

Kennedy D Opposite(1,0)/(3,0)/(3,3)/(3,0)/(5,6)(0,6)(1,0)/(3,0)/(3,3)/(3,0)/(5,3) (Chapter 5)
2H2T(0,6)2H2T

Kennedy UL(1,0)/(3,0)/(3,3)/(3,0)/(5,6)(-3,0)(1,0)/(3,0)/(3,3)/(3,0)/(-1,6) (Chapter 5)
2H2T(-3,0)2H2T

Kennedy UR(1,0)/(3,0)/(3,3)/(3,0)/(5,6)(3,0)(1,0)/(3,0)/(3,3)/(3,0)/(-1,6) (Chapter 5)
2H2T(3,0)2H2T

Kennedy U Opposite(1,0)/(3,0)/(3,3)/(3,0)/(5,6)(6,0)(1,0)/(3,0)/(3,3)/(3,0)/(2,6) (Chapter 5)
2H2T(6,0)2H2T

Charles Shaw(1,0)/(3,0)/(-1/0)(3,3)(1,0)/(3,0)/(3,3)/(3,0)/(2,3) (Chapter 5)
WASH(3,3)2H2T

Parity Rotation/(3,3)/(1,2)/(4,2)/(0,2)/(-2,4)/(1,2)/(-3,-3)/ (Chapter 4)

Parity Flip/(3,3)/(1,2)/(2,-2)/(4,-4)/(1,2)/(-3,-3)/ (Chapter 4)

  7.2: THE KRATZKE METHOD  
    1.  Get to the Millennium Falcon - Tingman's video is excellent for this.
        a.  Group pairs of edges together.
        b.  There are 3 ways to add the final pair to the cluster of 6.
            I.  They can be added to a side of the cluster of 6.
            II.  They can be separated into a line and added to straddle the cluster of 6.
            III.  If the last 2 edges are stuck in an L-shape instead,
                Replace an outer pair in the cluster of 6 with the L.
                This creates a line of edges, a cluster of 4, and an isolated pair.
                Make a cluster of 6, and then add the line.
        c.  The notion of opposite edges in a line is important; let's call these edge-lines.
    2.  Do the carbon dating thing to get a cube.
    3.  Check for odd parity.
        a.  You can rotate pieces around as much as you like before counting cycles.
        b.  Once you start counting cycles, however, do not alter the cube.
        c.  While unnecessary, it's easier count cycles if the pieces are oriented.
            That means all the yellow pieces are in U and all the white pieces are in D.
        d.  To do this, first put yellow corners into U with Dolla'Dolla'.
                Whenever I specify an algorithm like that, I always mean:
                You can use it as many times as needed, and
                You have the freedom to use U and D rotations to your heart's content.
            Then use the 4 Horsemen to get one or both yellow edge-lines into U.
                It's possible that this leaves an L-shape of edges in white.
                In this case, permute white corners to form yellow and white edge-lines.
                Whenever I say "permute," feel free to use any of our derivable algorithms.
            Finally, use the 4 Horsemen to finish orienting edges.
        e.  Calculate the parity of transpositions needed to solve all pieces.
    4.  If the parity is odd, use one of the parity fix algorithms.
    5.  Blockbuild exactly 4 quarters and hide them from the 4 Horsemen.
        Then build the remaining 4 quarters with the 4 Horsemen.
        You must be hiding 4 (1,0) quarters or 4 (0,-1) quarters; don't mix and match.
        a.  Odd numbers of built quarters are a huge pain; avoid them if at all possible.
        b.  (1,0) quarters can be hidden in FR and BL of U and also FL and BR of D.
            (0,-1) quarters can ben hidden in the opposite quadrants.
            Built edges simply need to be perpendicular to the 4 Horsemen transpositions.
        c.  Make U into yellow corners with white edges.
            (You can choose to divide pieces any way you like; this is just how I do it.)
            (Ex: white corners with yellow edges; hot color corners with cool color edges)
            Arrange U with the method I described before the parity count in 3d.
        d.  Permute quarters in D until the 4 Horsemen can build 2 opposite yellow quarters in U.
        e.  Build the 2 yellow quarters and hide them from the 4 Horsemen with a 90° U rotation.
        f.  If you're very lucky,
            I.  You didn't accidentally build any white quarters, AND
            II.  You're set up so that the 4 Horsemen can build 2 white quarters in D.
                In this case, build those 2 white quarters!
                Then use the 4 Horsemen to finish building all 8 quarters.
        g.  Otherwise, permute quarters in D and build the 2 remaining yellow quarters in U.
            We must now evaluate D.
            I.  If D has 0 built quarters, excellent!!  We can hide them from the 4 Horsemen.
                Begin with Dolla'Dolla', follow with 2 Heads 2 Tails, and hide.
                Use the 4 Horsemen to build all four white quarters.
            II.  If D has 1 built quarter, we must remedy this with a (0,-1) Kennedy.
                We don't care about quarter placement, so we don't need a DoubleKennedy.
                ((0,3) rotation cycles D front, back, and left edges clockwise.)
                ((0,-3) rotation cycles D front, back, and right edges clockwise.)
                You have two options.
                    α.  Unbuild all white quarters with a (0,-1) Kennedy and go to the previous step.
                    β.  Solve U completely with (1,0) quarter algorithms first.
                        Then use your (0,-1) Kennedy to help make all 8 (0,-1) quarters!
                        That commits you to (0,-1) algorithms through the end.  Fancy.
            III.  If D has 2 built quarters, you counted wrong and you have parity.
            IV.  D can't possibly have 3 built quarters; what would be in the 4th?
            V.  If D has 4 built quarters, you already have all 8!  Go go go!
    7.  Permute your 8 quarters to finish the solve!!


CHAPTER 8: CHECKERBOARDING & SOURCES

You've made it all the way through my final post, and you deserve a paragraph on checkerboarding.  It's not important, and it's hardly any sort of concluding remark.  It's just something fun.
To make a solved standard Rubik's Cube into one with a checkerboard pattern on each side is very easy.  Take each of the 3 middle slices, and in any order, rotate them 180°.  That's all.
Checkerboarding doesn't entirely work with puzzles that have an even number of pieces along at least one edge, but some people try.  Just like the book Will It Waffle, here are my opinions on Will It Checkerboard.

15 Puzzle: No.  What does this even mean?
Tower & Domino Cuboids: Only on some sides; still worth it
Ivy Skewb, Dino Skewb, Skewb: Not at all
Rubik's Cube, Professor's Cube: Classic checkerboard!
Pocket Cube, Rubik's Revenge: I don't like this
Cylinder Shape Mod: Yes, kind of sweet
Windmill Shape Mod: YES; this one is named for its checkerboard pattern
Fisher Shape Mod: Yes, it's wacky
Axis Shape Mod: Yes, yikes, the wackiest
Pyraminx, Pyramorphix: No
Mastermorphix: Looks like bowling shoes
Kilominx, Megaminx: Just gets scrambled really
Square 1: So glad you asked

We should all know how to checkerboard a SQ1!
    4 Horsemen(1,0)/(-1,-1)/(0,1) (no slash, just resetting)
                        (3,3) (rotating)
                        (1,0)/(-1,-1)/(0,1) (no slash, just resetting)
                        (-3,-3) (rotating)

Altogether, (1,0)/(-1,-1)/(0,1)(3,3)(1,0)/(-1,-1)/(-3,-2)