## How To Solve a Rubik's Cube Blindfolded

Solving a cube blindfolded sounds impossible at first, but I guarantee you anybody is capable of it.

You only need to know 3 algorithms, and memorize around 20 letters each solve.

Here are the steps:

• Memorize where each piece should go
• Solve 1 piece at a time
• The other pieces don't move while you do this

## Edge Solving Method

### Tips for setup moves:

• As shown above, swapping to FL and LF are two different sticker cases.
• Do not use R/U/F/B moves to setup, since they disturb the other pieces moved by the swapping algorithm.
• Only use L/Lw/Dw moves.
• For D face stickers, do some D-turn followed by L2 to setup.
• For E layer stickers, do some Dw-turn followed by L or L' to setup.
• For M layer stickers, do some Lw-turn to move it to the D face and continue setup.
• Alternatively: do some Lw-turn to move it to the U face and use a J Perm PLL algorithm to swap it with the buffer.
• For S layer stickers, do 1 move that puts it in the E/M layer and setup from there.

## Corner Solving Method

### The concept is identical to solving edges, with minor differences:

• The buffer sticker is LBU, and the target sticker is DFR. Setup moves will bring pieces to DFR.
• The corner swap algorithm is different.

### Tips for setup moves:

• Do not use U/B/L moves to setup, since they disturb the other pieces moved by the swapping algorithm.
• Only use D/F/R moves.
• For D face stickers, do some D-turn to setup.
• For F face stickers, do some F-turn followed by R' to setup.
• For R face stickers, do some R-move followed by F to setup.
• For other stickers, do 1 move that puts it in the D/F/R face and setup from there.

## Memorization Letters for Edges Letters for Corners

### 1. First Cycle (edges)

• Look at the sticker in the buffer location (UR), and find where this sticker goes. Memorize this location.
• In the example scramble, blue/white is at the buffer, so I memorize Q.
• At the location you just memorized, memorize where this piece goes. Stop when you reach the buffer piece (white/red).
• Yellow/green is at Q, so I memorize U.
• Blue/yellow is at U, so I memorize S.
• Red/white is at S, and red/white is the buffer piece so I stop here.
• If every unsolved piece has been visited, memorization is complete. If not, continue to new cycles.

### 2. New Cycles (edges)

• Memorize any unsolved piece that you have not visited yet (if any exist).
• In this example I will memorize R, but there are many possibilities.
• Continue memorization the same way as before. Stop after you memorize the same piece you began with.
• Red/blue is at R, so I memorize N.
• Yellow/orange is at N, so I memorize X.
• Green/white is at X, so I memorize I.
• Yellow/red is at I, so I memorize V.
• Red/green is at V, so I memorize P.
• Blue/orange is at P, so I memorize R.
• R is the same piece that I began the new cycle with, so I stop here.

### 3. Flipped Pieces (edges)

• Memorize any sticker on a flipped piece (if any exist).
• In this example the UL edge is flipped. I will memorize D, but I could also memorize E.
• Memorize where this sticker belongs
• Orange/white is at D, so I memorize E.

### Repeat all of the above, but for corners. Here is a summary of corner memorization using the same concepts:

• 1. First cycle (corners)
• Before memorizing anything, I have already reached the buffer.
• 2. New cycles (corners)
• New cycle: Memorize MWQXM (begins and ends on the same piece).
• New cycle: Memorize DUI (begins and ends on the same piece).
• 2. Flipped pieces (corners)
• The DFL corner is flipped. Memorize VP, as the sticker at V belongs at P.

## Solving After Memorization

### For each letter you have memorized:

• Do setup moves to bring the desired sticker to the target location.
• Do the swapping algorithm.
• Undo the setup moves.

## Example Solves

1. B2 R2 B2 L U2 R' B2 R2 B2 R' U' B' F L' B D R B2 D B' D' U

Edges: QU SR NX IV PR DE

Corners: MW QX MD UI VP

• Solving Edges:
• Q: Lw' D L2 [swap] L2 D' Lw
• U: D' L2 [swap] L2 D
• S: Lw' D' L2 [swap] L2 D Lw
• R: L [swap] L'
• N: Dw L [swap] L' Dw'
• X: L2 [swap] L2
• I: Lw D' L2 [swap] L2 D Lw'
• V: D2 L2 [swap] L2 D2
• P: Dw' L' [swap] L Dw
• R: L [swap] L'
• D: [swap]
• E: L Dw' L [swap] L' Dw L'
• Solving Parity:
• No parity (even edges and even corners).
• Solving Corners:
• M: F [swap] F'
• W: D' [swap] D
• Q: R D' [swap] D R'
• X: D2 [swap] D2
• M: F [swap] F'
• D: F2 [swap] F2
• U: D [swap] D'
• I: F R' [swap] R F'
• V: [swap]
• P: R F [swap] F' R'

2. U' L2 D' U R2 B' D' U' L2 B2 R' U' B' F' L U2 F R2 U'

Edges: KD IE XO WJ HL QN X

Corners: OU SC VN QI F

• Solving Edges:
• K: Lw D L2 [swap] L2 D' Lw'
• D: [swap]
• I: Lw D' L2 [swap] L2 D Lw'
• E: L Dw' L [swap] L' Dw L'
• X: L2 [swap] L2
• O: D' Lw D L2 [swap] L2 D' Lw' D
• W: D L2 [swap] L2 D'
• J: Dw2 L [swap] L' Dw2
• H: Dw L' [swap] L Dw'
• L: L' [swap] L
• Q: Lw' D L2 [swap] L2 D' Lw
• N: Dw L [swap] L' Dw'
• X: L2 [swap] L2
• Solving Parity:
• There is parity (odd edges and odd corners).
• [parity algorithm]
• Solving Corners:
• O: R2 F [swap] F' R2
• U: D [swap] D'
• S: D F' [swap] F D'
• C: F2 D [swap] D' F2
• V: [swap]
• N: R' F [swap] F' R
• Q: R D'[swap] D R'
• I: F R' [swap] R F'
• F: F' D [swap] D' F

## Next Steps

Another walkthrough solve is in this video, showing new cycles and flipped pieces. Also, check the description of the tutorial video for answers to common questions.

The M2 method is a much faster way to solve edges, but it has more special cases to deal with. Once you can do blindfolded solves consistently, I recommend learning the M2 method, as well as other advanced blindfolded techniques.