EG-1

Solve a 2x2 whose first face has an adjacent corner swap underneath: 40 cases.

What it is

EG lets a 2x2 solver build only a face, not a layer: one algorithm then solves the rest, including the first layer's permutation. EG-1 handles a first face with an adjacent swap (its headlights on one side), EG-2 a diagonal swap; with no swap it is CLL.

Recognition

Check the bottom layer for headlights. Headlights on all four sides of the bottom layer: solved (CLL). Headlights on exactly one side of the bottom layer: adjacent swap (EG-1). No headlights on the bottom layer: diagonal swap (EG-2). Then read the top as for CLL.
How to read the diagrams
Sort
Show
Train these
Print sheet

AS

EG1 AS 1
y U2 B U' R2 F2 U' F
7 HTM · 4 algs
EG1 AS 2
U R U' R' F' U' F2 R U' R'
10 HTM · 4 algs
EG1 AS 3
F' R U R' U' R U R2 F' R
10 HTM · 4 algs
EG1 AS 4
R U' R' F' U' R U R' U' F
10 HTM · 4 algs
EG1 AS 5
y' R U R' F' U' R U R' U' R U R'
12 HTM · 4 algs
EG1 AS 6
y2 R U' R2 F R U' R' F R F'
10 HTM · 2 algs

H

EG1 H 1
U' R' F R2 U' R' F R U R' F'
11 HTM · 4 algs
EG1 H 2
U' F' U R U' R2 F2 R U' F
10 HTM · 4 algs
EG1 H 3
U R' F R F' U2 F R U2 R' F
11 HTM · 4 algs
EG1 H 4
U' R U R' F' R U R' U' R U R' U'
13 HTM · 4 algs

L

EG1 L 1
y R U' R' U R U' R2 F' R F
10 HTM · 3 algs
EG1 L 2
y' U' R' F R U' R' F R2 U R' F' U2
12 HTM · 4 algs
EG1 L 3
y R' U R2 U' R2 U' F R2 U' R'
10 HTM · 1 alg
EG1 L 4
y R' F R2 U R' F' R U2 R'
9 HTM · 2 algs
EG1 L 5
y2 R U R' F' R U R' U' F R' F' R
12 HTM · 4 algs
EG1 L 6
y2 R' U2 F R U2 R U' R2 F
9 HTM · 4 algs

Pi

EG1 Pi 1
y2 U' F U' R' F R U' F2 R U R'
11 HTM · 4 algs
EG1 Pi 2
y' R U' R2 F R2 U' R'
7 HTM · 4 algs
EG1 Pi 3
y' F R' F U' F2 R U R
8 HTM · 2 algs
EG1 Pi 4
y' R U' R' U R U' R' F R U' R'
11 HTM · 2 algs
EG1 Pi 5
R U' R2 F R U R U' R' U' R' F R F'
14 HTM · 4 algs
EG1 Pi 6
U' R' F' R U' R' F R2 U R' F' R U R'
14 HTM · 4 algs

S

EG1 S 1
y2 U' L F' L2 U' L F U L' U L
11 HTM · 4 algs
EG1 S 2
R U R' F2 U F R U R'
9 HTM · 3 algs
EG1 S 3
y2 F R' F' R U R' F' R2 U R'
10 HTM · 3 algs
EG1 S 4
U F' R' F R2 U R' U' F R' F' R U
13 HTM · 3 algs
EG1 S 5
y R U' R' U R U' R' U F R U' R'
12 HTM · 4 algs
EG1 S 6
R' F R2 U' R' U R U' R' F
10 HTM · 3 algs

T

EG1 T 1
F R U' R2 F' R U R' F' R
10 HTM · 4 algs
EG1 T 2
F' R' F R2 U R' U' R U R'
10 HTM · 3 algs
EG1 T 3
y R U' R2 F R U R U2 R'
9 HTM · 4 algs
EG1 T 4
y' U2 R' F R F' U R U' R' U F R U' R'
14 HTM · 3 algs
EG1 T 5
y' R' F' R2 U R' F' R U R'
9 HTM · 3 algs
EG1 T 6
y' U' R U' R' U2 F R U2 R' F
10 HTM · 3 algs

U

EG1 U 1
y U2 R U R' U R U' R2 F' R2 U R' U
13 HTM · 4 algs
EG1 U 2
U2 y R' U R' U' R U' R' U' F2 R2
11 HTM · 4 algs
EG1 U 3
F' U2 R U2 R' U2 F
7 HTM · 4 algs
EG1 U 4
y R' F R F' R' F R2 U' R'
9 HTM · 3 algs
EG1 U 5
U2 R U' R' U R U' R' U' F R U' R'
13 HTM · 4 algs
EG1 U 6
y2 R' F R U' R' F R U' R U R' F' U2
13 HTM · 4 algs
Source: SpeedCubeDB, https://speedcubedb.com/a/2x2/EG1, retrieved 2026-10-24: case names, groups, setups and images, and the top-voted algorithms per case with their votes. Every algorithm shown was checked by the logic engine; rejected ones are listed in docs/db-exclusions.md.