Speedsolving.com Wiki - User contributions [en]

ZBLD

2009-11-26T01:02:23Z

MisterZB:

'''ZBLD''' uses ZBLL algorithms for blindfolded solving.

It has 2 variations, ZBLD 3cycle and ZBLD 2cycle.
The benefit of ZBLD is the fact that the setup moves are the same as conventional methods, and it combines multiple steps into one step.

The 3-cycle variation works best with preorientation of the edges and uses 2gen ZBLL algorithms to permute the edges whilst orienting the corners, simplifying the corner phase of the BLD solve.

It uses around 90 algorithms in total, and uses the same setup moves as 3OP methods.
It can be considered the next step up in difficulty from 3OP, since 3OP uses a subset of the ZBLL algorithms.

An example of 3-cycle ZBLD:

Scramble: F D2 L' B2 L2 U' R2 U' F' D B2 D' R' B R D' R U2 L U' L2 R D' R' B2

On the U layer, both UFL and UBL need a CCW twist, and DBL and DBR need a CW twist.

Orient Edges:

S2, D', x, M', U, M', U, M', U, M' U, M, U, M, U, M, U, M, U, x', D, S2

Y', R, U, x, M', U, M', U, M', U2, M, U, M, U, M, U2, x', U', R', Y

Permute Edges and Orient Corners Simultaneously:

UF -> FL -> RB (note that during setup, UFL and DBR are brought to the U layer and requires a CCW turn for UFL and a CW turn for DBR. This will look like a T set ZBLL.)

L', R', (U', R', U', R2, U, R2, U, R2, U2, R', U, R' U, R),R, L

UF-> BD -> UR (In this edge permutation, the setup will bring BDL to the U layer, and we use UFR as a buffer, Since, BDL needs a CW twist, we will use an algorithm from the L set.)

D, L2, U', (R, U2, R, U, R2, U, R', U', R, U, R', U2, R', U, R', U2) U, L2, D'

UF-> DL -> UB (No ZBLL is needed, and a simple set up and edge cycle will suffice)

L2, U', (M2, U', M, U2, M', U', M2) U, L2

UF -> UL -> FR (since UBL needs a CCW twist, and the set up conveniently places the UFR piece, we can use a fast T set ZBLL)

R, (U', R', U', R2, U, R2, U, R2, U2, R', U, R' U, R) R'

There is now a parity, and so we save that for last.

Now we can solve corners in a simple 3 cycle way.

UFR -> BDL -> UBL

z2, Y, (R, U, R', U',)x3 (D2) (R, U, R', U',)x3 Y', z2

UFR -> DFL -> URB

L2 ( R', F, R', B2, R, F', R', B2, R2) L2

My fix for parity is very inefficient, but I would do R2, and then U' and then do the most common T perm(R, U, R', U', R', F, R2, U', R', U', R, U, R', F'), then undo the setups with U, R2.

From there, I can do L, and then D, R2, and then an H perm, followed by undoing the setups with R2, D', L'.

The 2-cycle variation is the next step in difficulty from pochmann's classic method for edges.
It also orients corners, but does not need preorientation of edges. It replaces the T, and J perms of classic pochmann with the 2 swap algorithms from ZBLL.

It uses slightly less algorithms than 3-cycle ZBLD, but is not 2 gen.
It also uses the same setup moves as classic pochmann.

[[Category:Methods]]
[[Category:Blindsolving Methods]]

ZBLD

2009-11-26T01:01:44Z

MisterZB:

'''ZBLD''' uses ZBLL algorithms for blindfolded solving.

It has 2 variations, ZBLD 3cycle and ZBLD 2cycle.
The benefit of ZBLD is the fact that the setup moves are the same as conventional methods, and it combines multiple steps into one step.

The 3-cycle variation works best with preorientation of the edges and uses 2gen ZBLL algorithms to permute the edges whilst orienting the corners, simplifying the corner phase of the BLD solve.

It uses around 90 algorithms in total, and uses the same setup moves as 3OP methods.
It can be considered the next step up in difficulty from 3OP, since 3OP uses a subset of the ZBLL algorithms.

An example of 3-cycle ZBLD:

Scramble: F D2 L' B2 L2 U' R2 U' F' D B2 D' R' B R D' R U2 L U' L2 R D' R' B2

On the U layer, both UFL and UBL need a CCW twist, and DBL and DBR need a CW twist.

Orient Edges:

S2, D', x, M', U, M', U, M', U, M' U, M, U, M, U, M, U, M, U, x', D, S2

Y', R, U, x, M', U, M', U, M', U2, M, U, M, U, M, U2, x', U', R', Y

Permute Edges and Orient Corners Simultaneously:

UF -> FL -> RB (note that during setup, UFL and DBR are brought to the U layer and requires a CCW turn for UFL and a CW turn for DBR. This will look like a T set ZBLL.)

L', R', (U', R', U', R2, U, R2, U, R2, U2, R', U, R' U, R),R, L

UF-> BD -> UR (In this edge permutation, the setup will bring BDL to the U layer, and we use UFR as a buffer, Since, BDL needs a CW twist, we will use an algorithm from the L set.)

D, L2, U', (R, U2, R, U, R2, U, R', U', R, U, R', U2, R', U, R', U2) U, L2, D'

UF-> DL -> UB (No ZBLL is needed, and a simple set up and edge cycle will suffice)

L2, U', (M2, U', M, U2, M', U', M2) U, L2

UF -> UL -> FR (since UBL needs a CCW twist, and the set up convieniently places the UFR piece, we can use a fast T set ZBLL)

R, (U', R', U', R2, U, R2, U, R2, U2, R', U, R' U, R) R'

There is now a parity, and so we save that for last.

Now we can solve corners in a simple 3 cycle way.

UFR -> BDL -> UBL

z2, Y, (R, U, R', U',)x3 (D2) (R, U, R', U',)x3 Y', z2

UFR -> DFL -> URB

L2 ( R', F, R', B2, R, F', R', B2, R2) L2

My fix for parity is very inefficient, but I would do R2, and then U' and then do the most common T perm(R, U, R', U', R', F, R2, U', R', U', R, U, R', F'), then undo the setups with U, R2.

From there, I can do L, and then D, R2, and then an H perm, followed by undoing the setups with R2, D', L'.

The 2-cycle variation is the next step in difficulty from pochmann's classic method for edges.
It also orients corners, but does not need preorientation of edges. It replaces the T, and J perms of classic pochmann with the 2 swap algorithms from ZBLL.

It uses slightly less algorithms than 3-cycle ZBLD, but is not 2 gen.
It also uses the same setup moves as classic pochmann.

[[Category:Methods]]
[[Category:Blindsolving Methods]]

Category:Methods

2009-11-26T00:59:32Z

MisterZB: /* Complete List of Methods by Purpose */

Methods used to solve all or part of various cubes/puzzles

== Complete List of Methods by Purpose ==

Presented below is a complete list of methods (and their variants) for solving various twisty puzzles. Use the Wiki links in the table to find out more about each method, or the methods in each category.

{| class="TablePager" style="padding:3px; border-spacing:0"
!| Name
!| Original Proposer(s)
!| Variants
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:2x2x2 Beginner Methods | 2x2 Beginner]]'''
|-
| [[LBL]]
|
| Waterman Last Layer
|-
| [[Beginner Guimond]]
| Conrad Rider
|
|-
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:2x2x2 Speedsolving Methods | 2x2 Speed]]'''
|-
| [[Ortega]]
| Victor Ortega, Josef Jelinek
|
|-
| [[Guimond]]
| Gaétan Guimond
|
|-
| [[Waterman]] ([[CLL]])
| Marc Waterman
|
|-
| [[EG]]
| Erik Akkersdijk, Gunnar Krig
|
|-
| [[OFOTA]]
| Erik Akkersdijk
|
|-
| [[SS]]
| Stern-Sun
|
|-
|[[js2]]
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:3x3x3 Beginner Methods | 3x3 Beginner]]'''
|-
| [[LBL]]
|
| [[Keyhole]], [[XG]]
|-
| [[Corners First]]
| Marc Waterman
|
|-
| [[Edges First]]
|
|
|-
| [[Beginner Petrus]]
|
|
|-
| [[8355]]
| Reheart Sheu
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:3x3x3 Speedsolving Methods | 3x3 Speed]]'''
|-
| [[ZZ]]
| Zbigniew Zborowski
| [[ZZ-VH]], [[ZZ-a]], [[ZZ-b]], [[ZZ-d]], [[ZZ-WV]], [[MGLS | MGLS-Z]], [[ZZ-blah]], [[EJLS]], [[JTLE]],[[jsls]]
|-
| [[Waterman]]
| Marc Waterman
|
|-
| [[Tripod]]
| Michael Gottlieb
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:3x3x3 Speedsolving Methods | 3x3 Speed]]/[[:Category:SpeedBLD Methods|SpeedBLD]]'''
|-
| [[CFOP]] (Fridrich)
| Jessica Fridrich, and others
| [[CLL]]/[[ELL]], [[VH]], [[ZB]], [[MGLS | MGLS-F]]
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:3x3x3 Speedsolving Methods | 3x3 Speed]]/[[Fewest Moves Techniques|FMC]]'''
|-
| [[Petrus]]
| Lars Petrus
| [[JTLE]], [[EJLS]], [[MGLS | MGLS-P]],[[jsls]]
|-
| [[Roux]]
| Gilles Roux
|
|-
| [[Heise]]
| Ryan Heise
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:Blindsolving Methods | 3x3 BLD]]'''
|-
| [[3OP]]
| John White?
|
|-
| [[Old Pochmann]]
| Stefan Pochmann
|
|-
| [[M2/R2]]
| Stephen Pochmann
| Deadalnix ([[M2]]), Freestyle for Dummies ([[R2]])
|-
| [[TuRBo]]
| Erik Akkersdijk
|
|-
| [[BH]]
| Beyer-Hardwick
|-
| [[ZBLD]]
| Chris Tran
| ZBLD-2Cycle, ZBLD-3Cycle
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:Experimental Methods | Experimental]]'''
|-
| [[Human Thistlethwaite]]
| Morwen Thistlethwaite Ryan Heise
|
|-
| [[Belt]]
| ??
|
|-
| [[Fort]]
| James Straughan
|
|-
| [[Salvia Method]]
| David Salvia
|
|-
| [[Triangular Francisco]]
| ??
|
|-
| [[Orient First]]
| Lars Nielsson
|
|-
| [[E15 / E35]]
| ??
|
|-
| [[3CFCEP]]
| ??
|
|-
| [[3CFCE]]
| ??
|
|-
| [[PEG]]
| ??
|
|-
| [[PORT]]
| ??
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:Big Cube Methods | Big Cubes Speed]]'''
|-
| [[Reduction]]
|
|
|-
| [[Cage]]
| Per Kristen Fredlund
|
|-
| [[K4]]
| Thom Barlow
|
|-
| [[Sandwich]]
| ??
|
|-
| [[Kenneth's Big Cubes Method]]
| ??
|
|-
| [[js4]]
| ??
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:Blindsolving Methods | Big Cubes BLD]]'''
|-
|-
| [[r2]]
| Erik Akkersdijk
|
|-
| [[BH]]
| Beyer-Hardwick
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Pyraminx Methods | Pyraminx]]'''
|-
| [[Pyraminx Methods | Corners First]]
| ??
|
|-
| [[Pyraminx Methods | Layer First]]
| ??
|
|-
| [[Pyraminx Methods | Last 4 Edges]]
| ??
|
|-
| [[Pyraminx Methods | Petrus]]
| ??
|
|-
| [[Pyraminx Methods | Face Permute]]
| ??
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Megaminx Methods | Megaminx]]'''
|-
| ...
|
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Square-1 Methods | Square-1]]'''
|-
| [[SSS1M]]
| Shelley Chang
|
|-
| [[Vandenbergh Method]]
| Lars Vandenbergh
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Rubik's Clock Methods | Rubik's Clock]]'''
|-
| ...
|
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Methods for Other Puzzles | Magic]]'''
|-
| ...
|
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Master Magic Methods | Master Magic]]'''
|-
| [[Pochmann Method]]
| Stephan Pochmann
|
|-
| [[Ooms]]
| ??
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Skewb Methods | Skewb]]'''
|-
| ...
|
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Rubik's 360 Methods | Rubik's 360]]'''
|-
| ...
|
|
|}

== See Also ==
* [[Method]]
* [[Common Sub Steps]]
* [[Algorithm Database]]
* [[Solving Variants]]

== External Links ==
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=2402 BCE Methods] - methods based around Blockbuilding, Corners First and Edges First.

[[Category:Cubing Resources]]

ZBLD

2009-11-26T00:56:07Z

MisterZB:

ZBLD uses ZBLL algorithms for blindfolded solving.

It has 2 variations, ZBLD 3cycle and ZBLD 2cycle.
The benefit of ZBLD is the fact that the setup moves are the same as conventional methods, and it combines multiple steps into one step.

The 3-cycle variation works best with preorientation of the edges and uses 2gen ZBLL algorithms to permute the edges whilst orienting the corners, simplifying the corner phase of the BLD solve.

It uses around 90 algorithms in total, and uses the same setup moves as 3OP methods.
It can be considered the next step up in difficulty from 3OP, since 3OP uses a subset of the ZBLL algorithms.

An example of 3-cycle ZBLD:

Scramble: F D2 L' B2 L2 U' R2 U' F' D B2 D' R' B R D' R U2 L U' L2 R D' R' B2

On the U layer, both UFL and UBL need a CCW twist, and DBL and DBR need a CW twist.

Orient Edges:

S2, D', x, M', U, M', U, M', U, M' U, M, U, M, U, M, U, M, U, x', D, S2

Y', R, U, x, M', U, M', U, M', U2, M, U, M, U, M, U2, x', U', R', Y

Permute Edges and Orient Corners Simultaneously:

UF -> FL -> RB (note that during setup, UFL and DBR are brought to the U layer and requires a CCW turn for UFL and a CW turn for DBR. This will look like a T set ZBLL.)

L', R', (U', R', U', R2, U, R2, U, R2, U2, R', U, R' U, R),R, L

UF-> BD -> UR (In this edge permutation, the setup will bring BDL to the U layer, and we use UFR as a buffer, Since, BDL needs a CW twist, we will use an algorithm from the L set.)

D, L2, U', (R, U2, R, U, R2, U, R', U', R, U, R', U2, R', U, R', U2) U, L2, D'

UF-> DL -> UB (No ZBLL is needed, and a simple set up and edge cycle will suffice)

L2, U', (M2, U', M, U2, M', U', M2) U, L2

UF -> UL -> FR (since UBL needs a CCW twist, and the set up convieniently places the UFR piece, we can use a fast T set ZBLL)

R, (U', R', U', R2, U, R2, U, R2, U2, R', U, R' U, R) R'

There is now a parity, and so we save that for last.

Now we can solve corners in a simple 3 cycle way.

UFR -> BDL -> UBL

z2, Y, (R, U, R', U',)x3 (D2) (R, U, R', U',)x3 Y', z2

UFR -> DFL -> URB

L2 ( R', F, R', B2, R, F', R', B2, R2) L2

My fix for parity is very inefficient, but I would do R2, and then U' and then do the most common T perm(R, U, R', U', R', F, R2, U', R', U', R, U, R', F'), then undo the setups with U, R2.

From there, I can do L, and then D, R2, and then an H perm, followed by undoing the setups with R2, D', L'.

The 2-cycle variation is the next step in difficulty from pochmann's classic method for edges.
It also orients corners, but does not need preorientation of edges. It replaces the T, and J perms of classic pochmann with the 2 swap algorithms from ZBLL.

It uses slightly less algorithms than 3-cycle ZBLD, but is not 2 gen.
It also uses the same setup moves as classic pochmann.

[[Category:Methods]]
[[Category:Blindsolving Methods]]

Category:Methods

2009-11-26T00:55:52Z

MisterZB: /* Complete List of Methods by Purpose */

Methods used to solve all or part of various cubes/puzzles

== Complete List of Methods by Purpose ==

Presented below is a complete list of methods (and their variants) for solving various twisty puzzles. Use the Wiki links in the table to find out more about each method, or the methods in each category.

{| class="TablePager" style="padding:3px; border-spacing:0"
!| Name
!| Original Proposer(s)
!| Variants
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:2x2x2 Beginner Methods | 2x2 Beginner]]'''
|-
| [[LBL]]
|
| Waterman Last Layer
|-
| [[Beginner Guimond]]
| Conrad Rider
|
|-
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:2x2x2 Speedsolving Methods | 2x2 Speed]]'''
|-
| [[Ortega]]
| Victor Ortega, Josef Jelinek
|
|-
| [[Guimond]]
| Gaétan Guimond
|
|-
| [[Waterman]] ([[CLL]])
| Marc Waterman
|
|-
| [[EG]]
| Erik Akkersdijk, Gunnar Krig
|
|-
| [[OFOTA]]
| Erik Akkersdijk
|
|-
| [[SS]]
| Stern-Sun
|
|-
|[[js2]]
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:3x3x3 Beginner Methods | 3x3 Beginner]]'''
|-
| [[LBL]]
|
| [[Keyhole]], [[XG]]
|-
| [[Corners First]]
| Marc Waterman
|
|-
| [[Edges First]]
|
|
|-
| [[Beginner Petrus]]
|
|
|-
| [[8355]]
| Reheart Sheu
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:3x3x3 Speedsolving Methods | 3x3 Speed]]'''
|-
| [[ZZ]]
| Zbigniew Zborowski
| [[ZZ-VH]], [[ZZ-a]], [[ZZ-b]], [[ZZ-d]], [[ZZ-WV]], [[MGLS | MGLS-Z]], [[ZZ-blah]], [[EJLS]], [[JTLE]],[[jsls]]
|-
| [[Waterman]]
| Marc Waterman
|
|-
| [[Tripod]]
| Michael Gottlieb
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:3x3x3 Speedsolving Methods | 3x3 Speed]]/[[:Category:SpeedBLD Methods|SpeedBLD]]'''
|-
| [[CFOP]] (Fridrich)
| Jessica Fridrich, and others
| [[CLL]]/[[ELL]], [[VH]], [[ZB]], [[MGLS | MGLS-F]]
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:3x3x3 Speedsolving Methods | 3x3 Speed]]/[[Fewest Moves Techniques|FMC]]'''
|-
| [[Petrus]]
| Lars Petrus
| [[JTLE]], [[EJLS]], [[MGLS | MGLS-P]],[[jsls]]
|-
| [[Roux]]
| Gilles Roux
|
|-
| [[Heise]]
| Ryan Heise
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:Blindsolving Methods | 3x3 BLD]]'''
|-
| [[3OP]]
| John White?
|
|-
| [[Old Pochmann]]
| Stefan Pochmann
|
|-
| [[M2/R2]]
| Stephen Pochmann
| Deadalnix ([[M2]]), Freestyle for Dummies ([[R2]])
|-
| [[TuRBo]]
| Erik Akkersdijk
|
|-
| [[BH]]
| Beyer-Hardwick
|-
| [[ZBLD]]
| Chris Tran
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:Experimental Methods | Experimental]]'''
|-
| [[Human Thistlethwaite]]
| Morwen Thistlethwaite Ryan Heise
|
|-
| [[Belt]]
| ??
|
|-
| [[Fort]]
| James Straughan
|
|-
| [[Salvia Method]]
| David Salvia
|
|-
| [[Triangular Francisco]]
| ??
|
|-
| [[Orient First]]
| Lars Nielsson
|
|-
| [[E15 / E35]]
| ??
|
|-
| [[3CFCEP]]
| ??
|
|-
| [[3CFCE]]
| ??
|
|-
| [[PEG]]
| ??
|
|-
| [[PORT]]
| ??
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:Big Cube Methods | Big Cubes Speed]]'''
|-
| [[Reduction]]
|
|
|-
| [[Cage]]
| Per Kristen Fredlund
|
|-
| [[K4]]
| Thom Barlow
|
|-
| [[Sandwich]]
| ??
|
|-
| [[Kenneth's Big Cubes Method]]
| ??
|
|-
| [[js4]]
| ??
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[:Category:Blindsolving Methods | Big Cubes BLD]]'''
|-
|-
| [[r2]]
| Erik Akkersdijk
|
|-
| [[BH]]
| Beyer-Hardwick
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Pyraminx Methods | Pyraminx]]'''
|-
| [[Pyraminx Methods | Corners First]]
| ??
|
|-
| [[Pyraminx Methods | Layer First]]
| ??
|
|-
| [[Pyraminx Methods | Last 4 Edges]]
| ??
|
|-
| [[Pyraminx Methods | Petrus]]
| ??
|
|-
| [[Pyraminx Methods | Face Permute]]
| ??
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Megaminx Methods | Megaminx]]'''
|-
| ...
|
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Square-1 Methods | Square-1]]'''
|-
| [[SSS1M]]
| Shelley Chang
|
|-
| [[Vandenbergh Method]]
| Lars Vandenbergh
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Rubik's Clock Methods | Rubik's Clock]]'''
|-
| ...
|
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Methods for Other Puzzles | Magic]]'''
|-
| ...
|
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Master Magic Methods | Master Magic]]'''
|-
| [[Pochmann Method]]
| Stephan Pochmann
|
|-
| [[Ooms]]
| ??
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Skewb Methods | Skewb]]'''
|-
| ...
|
|
|-
| colspan="3" style="background-color:#f5f5f5; text-align:center;" | '''[[Rubik's 360 Methods | Rubik's 360]]'''
|-
| ...
|
|
|}

== See Also ==
* [[Method]]
* [[Common Sub Steps]]
* [[Algorithm Database]]
* [[Solving Variants]]

== External Links ==
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=2402 BCE Methods] - methods based around Blockbuilding, Corners First and Edges First.

[[Category:Cubing Resources]]

ZBLD

2009-11-25T02:58:37Z

MisterZB:

ZBLD uses ZBLL algorithms for blindfolded solving, proposed by Chris Tran.

It has 2 variations, ZBLD 3cycle and ZBLD 2cycle.
The benefit of ZBLD is the fact that the setup moves are the same as conventional methods, and it combines multiple steps into one step.

The 3-cycle variation works best with preorientation of the edges and uses 2gen ZBLL algorithms to permute the edges whilst orienting the corners, simplifying the corner phase of the BLD solve.

It uses around 90 algorithms in total, and uses the same setup moves as 3OP methods.
It can be considered the next step up in difficulty from 3OP, since 3OP uses a subset of the ZBLL algorithms.

An example of 3-cycle ZBLD:

Scramble: F D2 L' B2 L2 U' R2 U' F' D B2 D' R' B R D' R U2 L U' L2 R D' R' B2

On the U layer, both UFL and UBL need a CCW twist, and DBL and DBR need a CW twist.

Orient Edges:

S2, D', x, M', U, M', U, M', U, M' U, M, U, M, U, M, U, M, U, x', D, S2

Y', R, U, x, M', U, M', U, M', U2, M, U, M, U, M, U2, x', U', R', Y

Permute Edges and Orient Corners Simultaneously:

UF -> FL -> RB (note that during setup, UFL and DBR are brought to the U layer and requires a CCW turn for UFL and a CW turn for DBR. This will look like a T set ZBLL.)

L', R', (U', R', U', R2, U, R2, U, R2, U2, R', U, R' U, R),R, L

UF-> BD -> UR (In this edge permutation, the setup will bring BDL to the U layer, and we use UFR as a buffer, Since, BDL needs a CW twist, we will use an algorithm from the L set.)

D, L2, U', (R, U2, R, U, R2, U, R', U', R, U, R', U2, R', U, R', U2) U, L2, D'

UF-> DL -> UB (No ZBLL is needed, and a simple set up and edge cycle will suffice)

L2, U', (M2, U', M, U2, M', U', M2) U, L2

UF -> UL -> FR (since UBL needs a CCW twist, and the set up convieniently places the UFR piece, we can use a fast T set ZBLL)

R, (U', R', U', R2, U, R2, U, R2, U2, R', U, R' U, R) R'

There is now a parity, and so we save that for last.

Now we can solve corners in a simple 3 cycle way.

UFR -> BDL -> UBL

z2, Y, (R, U, R', U',)x3 (D2) (R, U, R', U',)x3 Y', z2

UFR -> DFL -> URB

L2 ( R', F, R', B2, R, F', R', B2, R2) L2

My fix for parity is very inefficient, but I would do R2, and then U' and then do the most common T perm(R, U, R', U', R', F, R2, U', R', U', R, U, R', F'), then undo the setups with U, R2.

From there, I can do L, and then D, R2, and then an H perm, followed by undoing the setups with R2, D', L'.

The 2-cycle variation is the next step in difficulty from pochmann's classic method for edges.
It also orients corners, but does not need preorientation of edges. It replaces the T, and J perms of classic pochmann with the 2 swap algorithms from ZBLL.

It uses slightly less algorithms than 3-cycle ZBLD, but is not 2 gen.
It also uses the same setup moves as classic pochmann.

[[Category:Methods]]
[[Category:Blindsolving Methods]]

ZBLD

2009-11-25T02:55:28Z

MisterZB:

ZBLL

2009-11-25T02:54:03Z

MisterZB: /* See Also */

'''ZBLL''' (short for ''[[Zbigniew Zborowski|Zborowski]]-[[Ron van Bruchem|Bruchem]] Last Layer'') is a step of a method which involves solving the entire [[last layer]] in one step, assuming that the [[edge]]s are already oriented. This is part of the [[ZB method]], but it can be useful for any other method which leaves the edges of the last layer oriented after F2L is solved (such as the [[Petrus method]]).

ZBLL indeed sounds like a very useful step to learn, but the main reason that it is not in wide use is that it involves a massive 177 algorithms (counting inverses and mirrors are the same), or a total of 493 cases. Only a handful of people have ever learned this step in its entirety. If you wish to learn it, it is useful to start by learning either [[OCLL]]/[[PLL]] or [[COLL]]/[[EPLL]], so that you will always be able to finish the cube relatively quickly even if you do not yet know the ZBLL case.

===Learning Approach===

The ZBLL cases are divided into 7 sets: T, U, L, Pi, Sune, Anti-sune, H, and the Pll cases, in which all pieces are oriented. The sets are then divided further into 40 subsets. They are recognized by their [[COLL]] case as well as a corresponding edge cycle. Every subset contains 12 cases, which are all different edge cycles possible with the COLL case of that set. Many people recognize ZBLL by looking at the UFR corner, and its neighboring stickers. Whether the stickers are adjacent, or opposite allows for a quick recognition. However, this method only works for the T, U and L subsets of ZBLL, because in the other cases the UFR corner is not correctly oriented. Another way to recognize is through blocks of colour or simply the edge cycle.

===Edge recognition===

For the T, U and L cases (there are 3*6*12=216 algorithms in this set) recognition goes as follows:

1. Recognize the orientation case.

2. Recognize the [[COLL]] case.

3. Recognize the edge cycle by looking at the UFR corner and the edge stickers around it.

4. Apply the corresponding algorithm.

Step 3 may look a little complicated, but it's actually not too bad. In total there are 12 cases, but those are recognized by 2 minor sub-cases, of which there are 3:

C: If the FU sticker is the same as the FRU sticker, and if the RU sticker is the same as the RUF sticker.

A: If the FU sticker is an adjacent color to the FRU sticker, and if the RU sticker is an adjacent color to the RUF sticker.

O: If FU and FRU are opposite, and if RU and RUF are opposite.

A case is recognized by the combination of those. First comes the FU/FRU relation, then the RU/RUF relation, divided by a slash. That means there are 9 possibilities with these cases: C/C, C/A, C/O, A/C, A/A, A/O, O/C, O/A, O/O. However, there are 12 cases. That's because the A case can mean 2 stickers. That's why the last 3 cases are known as C/OX, O/CX and OppX. This means that you don't look for the relation between FU/FRU and RU/RUF, but between FU/RUF and RU/FRU. In the C/OX case, FU and RUF are the same, and RU and FRU are opposite to each other. The same goes for the O/CX case, but vice versa. In the OppX case, both FU/RUF and RU/FRU are opposite. This looks like a Z-permutation. Note that all of these cases can be seen as A/A cases at first, but whenever you have an A/A case, you should always look if it isn't the other one.

== See Also ==

* [[VH Method]]
* [[H ZBLL]] (Algorithms)
* [[ZBLD]]

== External Links ==
* [http://www.ai.univ-paris8.fr/~bh/cube/solutions_567.html Bernhard Helmstetter's ZBLL algs] - complete, but excludes mirrors/inverses
* [http://www.cubestation.co.uk/cs2/index.php?page=3x3x3/zb/zbll/zbll Dan Harris's ZBLL algs] - incomplete
* [http://jmbaum.110mb.com/zbll.htm Jason Baum's ZBLL algs] - incomplete
* [http://www-personal.umich.edu/~dlli/Hardwick/zbll.html Chris Hardwick's ZBLL algs] - incomplete
* [http://lar5.com/cube/270/index.html Lars Petrus's One-look 2-alg ZBLL system]

[[Category:Methods]]
[[Category:Last Layer Methods]]
[[Category:Fewest Moves Methods]]
[[Category:Cubing Terminology]]
[[Category:Abbreviations and Acronyms]]
[[Category:Sub Steps]]

ZBLD

2009-11-25T02:53:16Z

MisterZB: New page: ZBLD uses ZBLL algorithms for blindfolded solving, proposed by Chris Tran. It has 2 variations, ZBLD 3cycle and ZBLD 2cycle. The benefit of ZBLD is the fact that the setup moves are the sa...

ZBLD uses ZBLL algorithms for blindfolded solving, proposed by Chris Tran.
It has 2 variations, ZBLD 3cycle and ZBLD 2cycle.
The benefit of ZBLD is the fact that the setup moves are the same as conventional methods, and it combines multiple steps into one step.

The 3-cycle variation works best with preorientation of the edges and uses 2gen ZBLL algorithms to permute the edges whilst orienting the corners, simplifying the corner phase of the BLD solve.

It uses around 90 algorithms in total, and uses the same setup moves as 3OP methods.
It can be considered the next step up in difficulty from 3OP, since 3OP uses a subset of the ZBLL algorithms.

An example of 3-cycle ZBLD:

F D2 L' B2 L2 U' R2 U' F' D B2 D' R' B R D' R U2 L U' L2 R D' R' B2

I noticed that on the U layer, that both UFL and UBL need a CCW twist, and DBL and DBR need a CW twist.

Orient Edges:

S2, D', x, M', U, M', U, M', U, M' U, M, U, M, U, M, U, M, U, x', D, S2

Y', R, U, x, M', U, M', U, M', U2, M, U, M, U, M, U2, x', U', R', Y

Permute Edges and Orient Corners Simultaneously:

UF -> FL -> RB (note that during setup, UFL and DBR are brought to the U layer and requires a CCW turn for UFL and a CW turn for DBR. This will look like a T set ZBLL.)

L', R', (U', R', U', R2, U, R2, U, R2, U2, R', U, R' U, R),R, L

UF-> BD -> UR (In this edge permutation, the setup will bring BDL to the U layer, and we use UFR as a buffer, Since, BDL needs a CW twist, we will use an algorithm from the L set.)

D, L2, U', (R, U2, R, U, R2, U, R', U', R, U, R', U2, R', U, R', U2) U, L2, D'

UF-> DL -> UB (No ZBLL is needed, and a simple set up and edge cycle will suffice)

L2, U', (M2, U', M, U2, M', U', M2) U, L2

UF -> UL -> FR (since UBL needs a CCW twist, and the set up convieniently places the UFR piece, we can use a fast T set ZBLL)

R, (U', R', U', R2, U, R2, U, R2, U2, R', U, R' U, R) R'

There is now a parity, and so we save that for last.

Now we can solve corners in a simple 3 cycle way.

UFR -> BDL -> UBL

z2, Y, (R, U, R', U',)x3 (D2) (R, U, R', U',)x3 Y', z2

UFR -> DFL -> URB

L2 ( R', F, R', B2, R, F', R', B2, R2) L2

My fix for parity is very inefficient, but I would do R2, and then U' and then do the most common T perm(R, U, R', U', R', F, R2, U', R', U', R, U, R', F'), then undo the setups with U, R2.

From there, I can do L, and then D, R2, and then an H perm, followed by undoing the setups with R2, D', L'.

The 2-cycle variation is the next step in difficulty from pochmann's classic method for edges.
It also orients corners, but does not need preorientation of edges. It replaces the T, and J perms of classic pochmann with the 2 swap algorithms from ZBLL.

It uses slightly less algorithms than 3-cycle ZBLD, but is not 2 gen.
It also uses the same setup moves as classic pochmann.

ZBLL

2009-08-29T04:44:28Z

MisterZB: /* Edge recognition */

'''ZBLL''' (short for ''[[Zbigniew Zborowski|Zborowski]]-[[Ron van Bruchem|Bruchem]] Last Layer'') is a step of a method which involves solving the entire [[last layer]] in one step, assuming that the [[edge]]s are already oriented. This is part of the [[ZB method]], but it can be useful for any other method which leaves the edges of the last layer oriented after F2L is solved (such as the [[Petrus method]]).

ZBLL indeed sounds like a very useful step to learn, but the main reason that it is not in wide use is that it involves a massive 177 algorithms (counting inverses and mirrors are the same), or a total of 493 cases. Only a handful of people have ever learned this step in its entirety. If you wish to learn it, it is useful to start by learning either [[OCLL]]/[[PLL]] or [[COLL]]/[[EPLL]], so that you will always be able to finish the cube relatively quickly even if you do not yet know the ZBLL case.

===Learning Approach===

The ZBLL cases are divided into 7 sets: T, U, L, Pi, Sune, Anti-sune, H, and the Pll cases, in which all pieces are oriented. The sets are then divided further into 40 subsets. They are recognized by their [[COLL]] case as well as a corresponding edge cycle. Every subset contains 12 cases, which are all different edge cycles possible with the COLL case of that set. Many people recognize ZBLL by looking at the UFR corner, and its neighboring stickers. Whether the stickers are adjacent, or opposite allows for a quick recognition. However, this method only works for the T, U and L subsets of ZBLL, because in the other cases the UFR corner is not correctly oriented. Another way to recognize is through blocks of colour or simply the edge cycle.

===Edge recognition===

For the T, U and L cases (there are 3*6*12=216 algorithms in this set) recognition goes as follows:

1. Recognize the orientation case.

2. Recognize the [[COLL]] case.

3. Recognize the edge cycle by looking at the UFR corner and the edge stickers around it.

4. Apply the corresponding algorithm.

Step 3 may look a little complicated, but it's actually not too bad. In total there's 12 cases, but those are recognized by 2 minor sub-cases, of which there are 3:

C: If the FU sticker is the same as the FRU sticker, and if the RU sticker is the same as the RUF sticker.

A: If the FU sticker is an adjacent color to the FRU sticker, and if the RU sticker is an adjacent color to the RUF sticker.

O: If FU and FRU are opposite, and if RU and RUF are opposite.

A case is recognized by the combination of those. First comes the FU/FRU relation, then the RU/RUF relation, divided by a slash. That means there are 9 possibilities with these cases: C/C, C/A, C/O, A/C, A/A, A/O, O/C, O/A, O/O. However, there are 12 cases. That's because the A case can mean 2 stickers. That's why the last 3 cases are known as C/OX, O/CX and OppX. This means that you don't look for the relation between FU/FRU and RU/RUF, but between FU/RUF and RU/FRU. In the C/OX case, FU and RUF are the same, and RU and FRU are opposite to each other. The same goes for the O/CX case, but vice versa. In the OppX case, both FU/RUF and RU/FRU are opposite. This looks like a Z-permutation. Note that all of these cases can be seen as A/A cases at first, but whenever you have an A/A case, you should always look if it isn't the other one.

[http://www.speedsolving.com/wiki/index.php/H_ZBLL H ZBLL Algorithms]

[[Category:Cubing abbreviations and acronyms]]

H ZBLL

2009-08-29T04:43:12Z

MisterZB: New page: By mirroring these algorithms, you can solve any H orientation case in one step. (You will have to find out the cases yourself, because I dont know a good way to make images.) Vertical b...

By mirroring these algorithms, you can solve any H orientation case in one step.
(You will have to find out the cases yourself, because I dont know a good way to make images.)

Vertical bars:

F R U R' X U R' U' R X' U' R U R' X U R' U' R X U F'

U R' U' R U' R' U2 R' Y R U2 R' U' R U R'

U2 R U2 R' U' R U' R' U' R' U' R U' R' U2 R

U R U R' U R U' R' U R U2 R'

R U2 R' U' R U R' U' R U' R'

Double horizontal bars:

R (U R' U) y' (R' U) (R U') (R2 F) (R F' R)

R U2 R2 X U2 L F2 R' F2 R2 U2 L'

U' R' U L' U' L U' F2 R' F2 R2 U' R' U2 R

F U F2 R U' R2 F R2 U R' F L' U2 L

Side bar:

(R B') (R' B) U2 R2 F' (r U') r' F2 R2

U' R' F R' U' F2 R F' R' F U R2 U2 Y' R U2 R'

R' U' Y L' U L F R' U' R U R B' R B

U' F' U B L2 U2 R U' L2 U R' U2 L2 F B'

F' R' Y' R2 U R2 U R2 U2 R2 U B R

U R F R2 U' R2 U; R2 U2 R2 U' F' R'

R U2 R2 F U' R2 U' R2 U' F' U R

U2 R U R2 F2 D' L2 D' L2 D2 F2 R

X' F' U F' U R2 X F' L2 F' D B2 L2 F' R2 F'

U' R U2 R' U' B' R U R' Y R U' R' U2 R

L' U' L2 X U2 F R2 X U R2 U2 X' U2 L'

Back bar:

F U2 L F' L' U2 R' L2 F' R F L2 F'

y R (U R' U) R U (r' F) R' (F' r)

U X U R' U' L U2 R U L U L2 X' B' U2 B

U' R2 D L' B2 L D' R U' R2 U' R2 U2 R

U2 R U' L' U R2 U' L R U2 R' U R

U2 R2 U' R2 U F R2 U R2 U' F' R2 U R2 U2

R' U L' D B2 D' L U2 R U R2 U2 R' U2

ZBLL

2009-08-14T05:33:21Z

MisterZB: