Difference between revisions of "2GB"
m |
|||
Line 46: | Line 46: | ||
[https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/post-1318959 Original Proposal] | [https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/post-1318959 Original Proposal] | ||
− | =Other Methods by This Proposer== | + | ==Other Methods by This Proposer== |
* [[HSC]] | * [[HSC]] | ||
Revision as of 17:07, 24 March 2020
|
2GB, short for 2-Generator Blockbuilding, is similar to RUP/PRUM/RUPM method by Tsung-Yen Wu, and also Heise.
But unlike all other Blockbuilding methods (except Heise), 2GB method utilizes blockbuilding techniques throughout the solve from start to finish. And unlike all other 2-generator methods, it is possible to solve the cube with 2GB method without using any predetermined/memorized Last Layer algorithms.
Another unique feature is 2GB can be implemented in such a way that it does not require previously built blocks to be broken at any point in the solve, not even momentarily.
Contents
Method Overview
Similar to Heise, 2GB is quite intuitive (in the sense that the cuber is fully aware of every move that are being made and understands what each turn is doing, and relies less on rote memorization).
With relatively few algorithms (mostly common triggers) and tolerably low move count, beginner 2GB is easy to understand and easy to implement.
It is also one of the most flexible methods (both steps have several alternative routes to adjust for the objective/situation/scramble), making it particularly appealing to those who enjoy fun, novel and elegant ways to solve. This feature also makes 2GB a good option for FMC style solving (serving as a Skeleton in particular).
General Structure
- Blockbuild to 2-Gen
- Blockbuild as 2-Gen
Pros
- Ergonomic, only <R, U> after first step
- Low algorithm count compared to more popular speedsolving methods
- First step has easy transition from other popular methods
Cons
- Block building can be difficult for a beginner to get used to
- Every turn has to be planned out because there are almost no algorithms, so fast turners will be disappointed
- Some parts of the solve, especially the second step, can be difficult to get used to
See Also
- RUP/PRUM/RUPM method by Tsung-Yen Wu
- Heise