AP

2026-10-10T09:11:11Z

LouisAnPhan: Add EOBelt sheet

{{Method Infobox
|name=AP
|image=AvaAP.png
|proposers=Phan Phước An
|year=2026
|anames=
|variants=
|steps=5 (Cross, F2L-2, EOBelt, 6CO, APLL)
|algs=Unknown
|moves=Unknown
|purpose=[[Speedsolving]] / Experimental
}}
== Introduction ==
[[File:SolvebyAP.png|500px]]
 
AP (short for An Phan) is a 3x3 method proposed by Phan Phước An in 2026. It is inspired by ZZ-CT and TN and is a special LL method, divided into 6CO and APLL.

== Steps ==
# '''Cross'''
# '''F2L-2'''
# '''EOBelt'''
# '''6CO'''
# ''' APLL'''
==APLL (An Phan Last Layer)==
APLL is an extension of the standard TTLL from [[ZZ-CT]] and 6CP from [[Mehta]], but instead of only the permutation 1 corner, APLL permutes 2 corners.
APLL is divided into around 7 subsets (except PLL, and still developing), and APLL has around 454 cases.
'''Subsets of APLL'''
#TTLL [[Image:TTLLaround.png|100px]] [[Image:TTLLup.png|100px]]
#APLL ?-5 [[Image:Subset2around.png|100px]] [[Image:TTLLatBRup.png|100px]]
#APLL 6-? [[Image:Subset1around.png|100px]] [[Image:TTLLup.png|100px]]
#APLL 2-3 [[Image:Subset3around.png|100px]] [[Image:Subset3up.png|100px]]
#APLL 3-2 [[Image:Subset4around.png|100px]] [[Image:Subset4up.png|100px]]
#APLL 1-3 [[Image:Subset5around.png|100px]] [[Image:Subset5up.png|100px]]
#PLLCS [[Image:PLLCSaround.png|100px]] [[Image:PLLCSup.png|100px]]

The subset name indicates which corners are involved in the permutation. The locations are named according to the [[YruRU]] numbering scheme: 1 is UFL, 2 is UBL, 3 is UBR, 4 is UFR, 5 is DFR, and 6 is DBR.
* '''Two-number names (e.g., 4-5):'''These represent a '''2-corner swap''' between the two specified positions. For example, "4-5" means the corner at UFR (4) and the corner at DFR (5) are swapped.
*'''?''' means there will be a different insertion point, so I'm not sure.

== Example Solve ==
'''1st example solve'''

Scramble: F2 L2 F2 R2 F2 U' L2 U2 L2 U' R2 U2 R' D' F' L D B' D2 B' D' U
 
z2 //orientation
 
L2 F2 R' D' L R2 // Cross
 
R' U' R U' L' U' L U l U' l' U2 l U l'//F2L-2
 
U F R D S' R2 D2 S D F' R//EOBelt
 
U' R U2 R' U' D' R U' R' D//6CO
 
U2 R F L' U2 R B' M L' B2 L2 U R r//APLL
 
U'//AUF

'''2nd example solve'''

Scramble: R' B2 F2 U2 B2 F2 R F2 L U2 B2 U2 B' L2 R' D F R' U F' U2 F'
 
z2 //orientation
 
D B D' R F L // Cross
 
U' F R' F' R U' S' L' S//F2L-2
 
y R U2 F R2 F' R'//EOBelt
 
U2 D' R U' R' D U2 R U' R'//6CO
 
U' F2 B2 D' L2 D2 L2 D' F2 B2 U//APLL

'''3rd solve'''

Scramble: L2 D2 L' U2 L F2 R2 F2 U2 B2 R F2 U' R2 F L2 B R2 D F2 L B2
 
z2 y2//orientation
 
F2 L F D' R F2 // Cross
 
U D R' U R D' U2 R u R u' R'//F2L-2
 
y2 R' F' U' F R2 U' R'//EOBelt
 
U2 R U' R U' R' U2 R U' R2//6CO
 
R2 B2 R2 U B2 U' R2 B2 U' R2 U R2 //APLL

== See Also ==
* [[Petrus Method]]
* [[Mehta]]
* [[ZZ-CT]]
* [[TN]]

== External Links ==
*[https://www.speedsolving.com/threads/my-experimental-method.96636/ Original proposal on Speedsolving Forums]
*[https://docs.google.com/spreadsheets/d/17WXyuxoc5NaaK321Eso95f6So-WC6Q2zF4DKSmKAlRU/edit?usp=drivesdk/ 6CO Algorithm Sheet]
*[https://docs.google.com/spreadsheets/d/1cPA65gHc-dawvIwaH62e3NiajP4GpPRKxurbhePGHA0/edit?usp=sharing/ APLL sheet (unaccomplished)]
*[https://docs.google.com/spreadsheets/d/1qxE6tkZ9-ub-9plRxSsT8Pf5rz9XEAs2zYHqrMee0cA/edit?usp=sharing/ EOBelt Sheet]
[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Advanced methods]]

AP

2026-09-19T10:45:10Z

LouisAnPhan: Add APLL sheet (unaccomplished)

{{Method Infobox
|name=AP
|image=AvaAP.png
|proposers=Phan Phước An
|year=2026
|anames=
|variants=
|steps=5 (Cross, F2L-2, EOBelt, 6CO, APLL)
|algs=Unknown
|moves=Unknown
|purpose=[[Speedsolving]] / Experimental
}}
== Introduction ==
[[File:SolvebyAP.png|500px]]
 
AP (short for An Phan) is a 3x3 method proposed by Phan Phước An in 2026. It is inspired by ZZ-CT and TN and is a special LL method, divided into 6CO and APLL.

== Steps ==
# '''Cross'''
# '''F2L-2'''
# '''EOBelt'''
# '''6CO'''
# ''' APLL'''
==APLL (An Phan Last Layer)==
APLL is an extension of the standard TTLL from [[ZZ-CT]] and 6CP from [[Mehta]], but instead of only the permutation 1 corner, APLL permutes 2 corners.
APLL is divided into around 7 subsets (except PLL, and still developing), and APLL has around 454 cases.
'''Subsets of APLL'''
#TTLL [[Image:TTLLaround.png|100px]] [[Image:TTLLup.png|100px]]
#APLL ?-5 [[Image:Subset2around.png|100px]] [[Image:TTLLatBRup.png|100px]]
#APLL 6-? [[Image:Subset1around.png|100px]] [[Image:TTLLup.png|100px]]
#APLL 2-3 [[Image:Subset3around.png|100px]] [[Image:Subset3up.png|100px]]
#APLL 3-2 [[Image:Subset4around.png|100px]] [[Image:Subset4up.png|100px]]
#APLL 1-3 [[Image:Subset5around.png|100px]] [[Image:Subset5up.png|100px]]
#PLLCS [[Image:PLLCSaround.png|100px]] [[Image:PLLCSup.png|100px]]

The subset name indicates which corners are involved in the permutation. The locations are named according to the [[YruRU]] numbering scheme: 1 is UFL, 2 is UBL, 3 is UBR, 4 is UFR, 5 is DFR, and 6 is DBR.
* '''Two-number names (e.g., 4-5):'''These represent a '''2-corner swap''' between the two specified positions. For example, "4-5" means the corner at UFR (4) and the corner at DFR (5) are swapped.
*'''?''' means there will be a different insertion point, so I'm not sure.

== Example Solve ==
'''1st example solve'''

Scramble: F2 L2 F2 R2 F2 U' L2 U2 L2 U' R2 U2 R' D' F' L D B' D2 B' D' U
 
z2 //orientation
 
L2 F2 R' D' L R2 // Cross
 
R' U' R U' L' U' L U l U' l' U2 l U l'//F2L-2
 
U F R D S' R2 D2 S D F' R//EOBelt
 
U' R U2 R' U' D' R U' R' D//6CO
 
U2 R F L' U2 R B' M L' B2 L2 U R r//APLL
 
U'//AUF

'''2nd example solve'''

Scramble: R' B2 F2 U2 B2 F2 R F2 L U2 B2 U2 B' L2 R' D F R' U F' U2 F'
 
z2 //orientation
 
D B D' R F L // Cross
 
U' F R' F' R U' S' L' S//F2L-2
 
y R U2 F R2 F' R'//EOBelt
 
U2 D' R U' R' D U2 R U' R'//6CO
 
U' F2 B2 D' L2 D2 L2 D' F2 B2 U//APLL

'''3rd solve'''

Scramble: L2 D2 L' U2 L F2 R2 F2 U2 B2 R F2 U' R2 F L2 B R2 D F2 L B2
 
z2 y2//orientation
 
F2 L F D' R F2 // Cross
 
U D R' U R D' U2 R u R u' R'//F2L-2
 
y2 R' F' U' F R2 U' R'//EOBelt
 
U2 R U' R U' R' U2 R U' R2//6CO
 
R2 B2 R2 U B2 U' R2 B2 U' R2 U R2 //APLL

== See Also ==
* [[Petrus Method]]
* [[Mehta]]
* [[ZZ-CT]]
* [[TN]]

== External Links ==
*[https://www.speedsolving.com/threads/my-experimental-method.96636/ Original proposal on Speedsolving Forums]
*[https://docs.google.com/spreadsheets/d/17WXyuxoc5NaaK321Eso95f6So-WC6Q2zF4DKSmKAlRU/edit?usp=drivesdk/ 6CO Algorithm Sheet]
*[https://docs.google.com/spreadsheets/d/1cPA65gHc-dawvIwaH62e3NiajP4GpPRKxurbhePGHA0/edit?usp=sharing/ APLL sheet (unaccomplished)]
[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Advanced methods]]

Speedsolving.com Wiki - User contributions [en]

AP

AP