Hello fellow zz-d solver I would like to share my recognition pattern in porky v1 esp. the 4 corners of the U face (I know it's late) but I want to share it and I dont know where exactly so I pasted here. I also used this recognition in
http://www.speedsolving.com/forum/s...ink-for-ZZ-d-(it-sucks-but-it-still-works!-D). and also I proposed this in
http://www.speedsolving.com/forum/showthread.php?20834-ZZ-ZB-Home-Thread/page123
Convention notation:
UFL: 1
UFR: 2
UBR: 3
UBL: 4
I numbered every corner so any corner may sits at position 1 or 1.
Few terms (Y/B orientation for the examples)
1) good means 2 corners are in good position with each other in terms of color both corners have 1 same color(ignore top color).
Ex.
red-green-yellow at 3 and red-blue-yellow at 2
red-green--yellow at 2 and red-blue-yellow at 1
2) bad means 2 corners are swap with each other in terms of color both corners have 1 same color(ignore top color).
Ex.
red-blue-yellow at 3 and red-green-yellow at 2
red-blue-yellow at 1 and red-green-yellow at 2
3) diagonal means 2 corners are in diagonal relationship with each other in terms of color both corners have opposite colors(ignore top color).
Ex.
red-green-yellow at 3 and orange-blue-yellow at 2
red-green-yellow at 2 and orange-blue-yellow at 1
Here's my recognition:
Look at 1 and 2 determine if diagonal, bad, or good then look at 2 and 3 determine if diagonal, bad, or good.
1) Good case (1,2)
1.1) (1,2)-good+(2,3)-good
observation: correct corner perm.
1.2) (1,2)-good+(2,3)-diagonal
observation: 3 must be swap to 4 therefore it is a '3-4 swap'
2) bad case (1,2)
2.1) (1,2)-bad+(2,3)-bad
observation: 1 and 2 are swap also 2 and 3 therefore 2 must be swap with 4 then it is a 'diagonal swap'
2.2) (1,2)-bad+(2,3)-diagonal
observation: 2 must swap with 1 cuz 3 is diagonal relationship with 2 therefore it is a '1-2 swap'
3) diagonal case (1,2)
3.1) (1,2)-diagonal+(2,3)-good
observation: 2,3 are good therefore 1 must be swap to 4 then it is a '1-4 swap'
3.2) (1,2)-diagonal+(2,3)-bad
observation: 2 must go to 3 to retain diagonal relationship to 1 therefore it is a '2-3 swap'
To summarize:
good-good = solve
good-diagonal = 3-4 swap
bad-bad = diagonal swap
bad-diagonal = 1-2 swap
diagonal-good = 1-4 swap
diagonal-bad = 2-3 swap
To integrate this to porky v1 we have 12 cases (6 swaps*2 DR corner perm)
Case 1: Nn (good-good)-n
Case 2: Ds (bad-bad)-s
Case 3: On
we have 4 horizontal swaps and do auf
(good-diagonal)-n
(bad-diagonal)-n
(diagonal-good)-n
(diagonal-bad)-n
Case 4: Os
we have 4 horizontal swaps and do auf
(good-diagonal)-s
(bad-diagonal)-s
(diagonal-good)-s
(diagonal-bad)-s
Case 5: Dn (bad-bad)-n
Case 6: Ns (good-good)-s
After we place the DR corners no need to auf just to find our favorite corner then determine the corner perm just after DR corners insertion look at 1 and 2 and 2 and 3.
I hope mDiPalma or anyone verify my recognition in v1
haha! Maybe you can though!
