What blindfolded solving actually is
Lesson overview
- Describe the two halves of a blindfolded solve, memorising and executing
- Explain why a blindfolded solve moves one piece at a time
- Know what the next lessons build, in order
You already solve a cube by looking at it. You turn, you check, you turn again. A blindfolded solve takes the looking away, but only after you've looked once, as long as you like.
So a blindfolded solve has two halves.
Half one: memorising
You look at the scrambled cube and work out, piece by piece, where everything needs to go. You don't turn it. You turn what you see into something you can remember: a short list of letters, and then words or pictures for those letters.
At the start this takes minutes. That's fine. Nobody is timing you here.
Half two: executing
You put the blindfold on and solve from memory. You can't check anything, so you can't use your normal method, which depends on seeing what each move did.
Instead, you solve one piece at a time. There's always a fixed starting spot, called the buffer. You move the piece in the buffer to where it belongs, with a short sequence that leaves everything else exactly as it was. Then you do the same for the piece that arrived in the buffer. And again, until every piece is home.
Here is one of those moves. Only the pieces it touches are lit; press play and watch the rest of the cube stay put.
That sequence is always the same. What changes from piece to piece is a few moves before it, which bring the right spot into place, and the same moves undone afterwards. Because nothing else is disturbed, you can do this blind: you only need your memory and a sequence you trust.
Why this is learnable
It sounds like a memory trick. It's really a small set of ideas used in a fixed order:
- Name every sticker with a letter, so a position becomes something you can say.
- Follow pieces from the buffer, writing down letters as you go. That's tracing.
- Turn the letters into words, so a long list becomes a short story.
- Learn one sequence for corners and one for edges, plus the setup moves that feed them.
- Handle the one special case, called parity, where the count comes out odd.
The path follows exactly that order. By lesson 15 you'll do a whole solve, with the site guiding every step.