Speedsolving.com Wiki - User contributions [en]

Uwe Mèffert

2026-06-10T21:09:28Z

RedstoneTim: Moved date of death to infobox

{{Infobox
|NAME=Uwe Mèffert
|IMAGE=Uwe-meffert.jpg
|IMAGEYEAR=
|ALIASES=
|COUNTRY=Germany
|BIRTHDATE=28 November 1939
|DEATHDATE=30 April 2022 [https://twistypuzzles.com/forum/viewtopic.php?p=418389]
|AGE=
|JOBS=
|YEARSACTIVE=
|ID=
|FAMOUSFOR=Pyraminx inventor; puzzles manufacturer
}}
'''Uwe Mèffert''' was a German-born puzzle inventor and marine biologist. He was the designer of many [[puzzle]]s such as the [[Pyraminx]]. He has also helped to produce many puzzles that he did not design, such as the [[Megaminx]], [[Pyraminx Crystal]], [[Tony Durham]]'s [[Skewb (puzzle type)|Skewb]], and [[Tony Fisher]]'s [[Golden Cube]]. Mèffert also operated an online store ''[[Meffert's]]'' containing puzzles he produced, although his store also contained products that Mèffert neither designed or actively produced, such as the [[Master Pyramorphix]].

==Life==
Mèffert was born in Wernigerode in the Harz Mountains of Germany. He was educated in Heidelberg, Germany; Geelong, Australia; and Bern, Switzerland. He lived in Asia since the 1970s, especially Hong Kong. He also worked in Australasia, doing private research into human and animal nutrition. He wrote several books on Nutrition & Tai-Chi Chi-Gung, Long life Health & Beauty exercise.

In the early 1970s he experimented with slicing polyhedra into symmetric slices and attaching them with rubber bands to a center ball. Part of his interests were in supposed "energy flows" inside the human body and the mystical power of the pyramid and other shapes. His wooden puzzles eventually end up in a drawer, half-forgotten.

In 1980 the [[Rubik's Cube]] was launched upon the world leading to a mass craze. Urged on by his friends, he agreed to show his puzzles to Tomy Toys of Japan in early 1981. Tomy liked the puzzles and selected the [[Pyraminx]]. Over 10 million pieces where sold through toy stores by Christmas 1981, (and 90 million within 3 years). Following this initial success, he also supplied 4x4x4 & 5x5x5 cubes to Ideal toys and their subsidiaries from his Hong Kong base. He also produced a [[Megaminx]] (getting "his impulse from Kersten Meier and [[Udo Krell]]")[http://www.mefferts.com/page.php?lang=en&theme=puzzle_history]; and the [[Skewb]], invented by Tony Durham, and originally sold as the "Pyraminx Cube" (to associate it with his best-selling product).

The puzzle market went very quiet in the aftermath of the cube craze in 1982. In the 1990s and 2000s Mèffert began releasing puzzles from his online store ''[[Meffert's]]'', including 4x4x4 & 5x5x5 cubes, but especially a large range of unusual twisty puzzles sourced from puzzle designers.

==External links==
*[http://www.mefferts.com/page.php?lang=en&theme=about_uwe About Uwe Meffert & Meffert's Puzzles]
*[http://www.mefferts.com Meffert's] Home page

[[Category:Puzzle inventors|Meffert, Uwe]]
[[Category:Cubers|Meffert, Uwe]]
[[Category:Puzzle hardware]]
[[Category:Meffert's Puzzles]]

David Singmaster

2026-06-10T21:05:13Z

RedstoneTim: Moved date of death to infobox and gave more accurate date of birth

{{Infobox
|NAME=David Singmaster
|IMAGE=David Singmaster.jpg
|IMAGEYEAR=
|ALIASES=
|COUNTRY=USA
|BIRTHDATE=14 December 1938 [https://ww2.ams.org/journals/notices/202307/noti2744/noti2744.html]
|AGE=
|DEATHDATE=13 February 2023
|JOBS=Mathematics professor
|YEARSACTIVE=1978-2000s; 2012
|ID=2012SING03
|FAMOUSFOR=[[Layer by layer|Layer by layer method popularization]], [[3x3x3 notation|Singmaster notation]]
}}

'''David Breyer Singmaster''' was an American mathematics professor at London South Bank University in the United Kingdom. He was most famous for being an early adopter and enthusiastic promoter of the [[Rubik's Cube]]. His ''Notes on Rubik's "Magic Cube"'' which he began compiling in 1979 provided the first mathematical introduction to the Cube as well as providing one of the first published solutions. The book contains the [[3x3x3 notation|cube notation]] which has become standard. He also owned a huge collection of mechanical puzzles, which he stated in 2002 contained "perhaps 3000 puzzles, of which about 400 are Rubik Cubes and variants".

==History==
Singmaster's association with Rubik's Cubes dates from August 1978, when he saw a Cube (at that time a rarity) at the International Congress of Mathematicians in Helsinki. Some other mathematicians at the conference, including John Conway and [[Roger Penrose]], already had one. Singmaster acquired a Cube from Hungarian mathematician Tamás Varga, and was able to solve it by early September 1978, taking about two weeks to develop a general solution. He devised his notation for recording moves (now known as the [[3x3x3 notation|Singmaster notation]]) in December 1978. In June 1979 he wrote the first (non-Hungarian) newspaper article about the Cube in ''The Observer'' newspaper. He became one of the most enthusiastic and prolific promoters of Rubik's Cube during the early 1980s, and for two years even ran his own puzzle company, David Singmaster Ltd, which stocked puzzles and books. Throughout this period he shared an office with [[Morwen Thistlethwaite]] another prominent Rubik's Cube theorist.

==''Notes on Rubik's "Magic Cube"''==
By February 1979 Singmaster had written in manuscript form the first version of his ''"Notes on the 'Magic Cube'"''. The booklet contained his mathematical analysis of Rubik's Cube using basic group theory. The first edition became available (by mail-order) in October 1979. The book was subsequently expanded as results of his correspondence with other "cubologists" came in. The 5th edition was published in August 1980 and was retitled as ''Notes on Rubik's "Magic Cube"''. Although self-published, it was one of the few resources available for cubers until mid-1981 when there was an explosion in cubing books. Even then it was still considered by many "THE book" on the Rubik's cube, with "the history, anecdotes, the math theory, and a solution."[http://www.cube20.org/cubelovers/CL02/105.txt] The book included a variant of the [[Layer by layer]] approach for solving the cube based on other Layer by Layer solutions at the time and played a major part in the popularization of the method.[https://sites.google.com/view/methodlibrary/3x3-methods/layer-by-layer] In 1981, at the height of the Rubik's Cube craze, the book was formally published by Penguin Books (UK), with a US edition by Enslow Publishers. There were also Dutch and Spanish translations. He estimated that he sold around 50 to 60,000 copies of his book. Much of the mathematical content of the book was later reworked by Alexander H. Frey in collaboration with Singmaster to create their ''Handbook of Cubik Math'' published in 1982.

===Contents===
The first edition (October 1979) contained 10 sections plus an addendum totalling around 30 pages. Section 4 contained the group theory and the reader was advised to "skim through it" on first reading. For those wishing to solve the Cube the most important parts were: section 3 which described the [[3x3x3 notation|notation]]; section 6 which described some basic [[commutator]]s demonstrating how algorithms can be constructed; and section 9 which outlined the Layer-by-layer approach and provided some improved processes. Editions two, three and four followed in quick succession (Oct 1979 to Jan 1980) and contained new material in three short addendums as information from his correspondents came in.

The most important update came in August 1980 with the fifth edition. This nearly doubled the size of the book with a lengthy Fifth Addendum. This contained many new anecdotes, processes, and other theoretical results including some details of the [[Thistlethwaite Algorithm]]. Important for cubers was a small catalogue of algorithms, many just for the upper layer including 2-cycles, 3-cycles, flips and twists. There was also a list of pretty patterns (including his "cube in a cube in a cube" pattern which he had discovered himself). For the first time there was a separate step-by-step solution guide in its own section.

===Singmaster method===
Singmaster had initially solved the Cube using a [[Corners First]] method (using basic [[Commutators and Conjugates|commutators and conjugates]]) but by 1979 he had developed a variant of the [[Layer by layer]] method. In the first edition of his ''Notes'' (October 1979) he provided an outline of the method, together with suggestions for various algorithms. His solution steps are:

* 1) Put all bottom edges correctly in place.
* 2) Put all bottom corners correctly in place.
* 3) Put middle slice edges correctly in place.
* 4) Flip top edges so all U faces are up.
* 5) Make top orientations correct. [i.e. making a single U move]
* 6) Put top edges correctly in place.
* 7) Put top corners in their right positions.
* 8) Twist top corners into their correct orientations.

For the step-by-step solution from the 5th edition see this [https://web.archive.org/web/20070603094148/http://www.linkedresources.com/teach/rubik/solution.php David Singmaster's Solution] as webified by Jeffrey W Baumann.

==''Cubic Circular''==
Singmaster is also famous for his ''Cubic Circular'' newsletter published 1981-5. In total five magazines were published, of which three were double issues. The newsletters, which he considered as further addenda to his ''Notes'', are an unparalleled source of historical information about Rubik's Cube and other [[twisty puzzles]] during the 1980s Cube craze.

==Publications==
===Books===
* ''Notes on Rubik's "Magic Cube"'', David Singmaster. 1981. Penguin Books ISBN 0-140-06149-5 / Enslow Publishers ISBN 0-89490-043-9
* ''Handbook of Cubik Math'', David Singmaster and Alexander H. Frey. The Lutterworth Press, 1982. ISBN 0-7188-2555-1
* ''Rubik's Cubic Compendium'', by [[Ernő Rubik]] and four others. Edited with an Introduction and Afterword by David Singmaster. Oxford University Press, 1987. ISBN 0-19-853202-4
* ''The Cube: The Ultimate Guide to the World's Bestselling Puzzle'', Jerry Slocum, David Singmaster, Wei-Hwa Huang, Dieter Gebhardt, Geert Hellings, Ernő Rubik. Black Dog & Leventhal, 2009. ISBN 157912805X

===Newsletters===
*''Cubic Circular'' magazine published 1981-5 by David Singmaster ([http://www.jaapsch.net/puzzles/cubic.htm available online at Jaap's Puzzle Page])

===Articles===
*Singmaster, D. "The Hungarian Magic Cube." ''Mathematical Intelligencer'' 2:1. (1979) p. 29-30
*Singmaster, D. "Six-sided magic." ''The Observer''. (17 June 1979) p. 40.
*Singmaster, D. "The Magic Cube." ''Games & Puzzles'' 76. (Spring 1980). p. 4-6.
*Singmaster, D. "The educational value of the Hungarian Magic Cube. In: ''Proceedings of the Fourth International Congress on Mathematical Education: Berkeley, California, U.S.A., 10-16 August 1980''. Published: Boston: Birkhäuser, (c. 1983).
*Singmaster, D. "The incredible cube." ''Games & Puzzles'' 81. (Summer 1981) p. 4, 5, 10.
*Singmaster, D. "Cube news again." ''Mathematical Intelligencer'' 3:3. (1981) p. 107-108.
*Singmaster, D. "[https://books.google.co.uk/books?id=_n1vr0_RbXoC&pg=PA786 Moral and mathematical lessons from a Rubik Cube]". ''New Scientist''. (23/30 Dec 1982) p. 786-791.

==External links==
* [http://en.wikipedia.org/wiki/David_Singmaster Wikipedia entry on David Singmaster]
* [http://www.twistypuzzles.com/articles/spotlight-singmaster/ Interview with David Singmaster] at ''Twisty Puzzles''. Originally published c. 2002 ([https://web.archive.org/web/20020403133052/http://www.zeta.org.au/~sausage/twistymegasite/interview-singmaster.html archive]).

*Video: [https://www.youtube.com/watch?v=DtYr_3h0Ubw David Singmaster talks about Rubik's Cubes], ''Gathering 4 Gardner - Celebration of Mind'', 23 March 2014
*Video: [https://www.youtube.com/watch?v=VDwSaCB3UbM Cubic Tales], Erno Rubik, David Singmaster, Jeffrey Varasano, at ''Gathering 4 Gardner'', April 2018

[[Category:Puzzle theorists|Singmaster, David]]
[[Category:Method inventors|Singmaster, David]]
[[Category:Cubers|Singmaster, David]]

Template:Infobox

2026-06-10T20:57:00Z

RedstoneTim: Added optional date of death

MegaZZ

2026-06-10T20:32:03Z

RedstoneTim: Removed from "Infobox templates" category

{| border="1" class="infobox-template" style="float: right; border-collapse:collapse; width: 22em; font-size: 90%; margin: 0 0 10px 10px;"
|
{| border="0" cellpadding="3" bgcolor="#F0F0F0" cellspacing="2" style="color:black; text-align:center; width: 100%"
|-
| bgcolor="#D0DFEE" colspan="2" style="font-size: 125%;" | '''{{{name|}}} MegaZZ'''
|-
| bgcolor="#E0E8EF" colspan="2" | '''Information about the method'''
|-
| bgcolor="#F0F0F0" align="right" | '''Proposer(s):'''
| align="left" | {{{proposers|Ryan Kennelly}}}
|-
| bgcolor="#F0F0F0" align="right" | '''Proposed:'''
| align="left" | {{{year|2021}}}
|-
| bgcolor="#F0F0F0" align="right" | '''No. Steps:'''
| align="left" | {{{steps|4}}}
|-
| bgcolor="#F0F0F0" align="right" | '''Purpose(s):'''
| align="left" | {{{purpose|Megaminx Speedsolving}}}
|-
|}
|}
MegaZZ is a method for Megaminx created as a Megaminx version of ZZ apart from [[ZZ-Spike]]. This method bassically reduces a megaminx to 6 gen compared to the 4 gen of ZZ spike.

==The Steps==
* '''Helix:''' This is a series of 5 edges that form what is one continuous stripe or "Helix". This is similar to ZZ's EOLine, though the Edge Orientation is done afterwards
* '''Edge Orientation:''' Edge Orientation or "EO" involves reducing all edges on the puzzle to a 6-gen state which will leave you with a star on the last layer every solve. The execution of this step is fairly similar to ZZ-Spike EO, just with more edges needed to be oriented.
* '''Blockbuilding to Last Layer:''' This is pretty straight forward. The goal of this step is to blockbuild, as in 3x3 ZZ until there is only one layer left to solve.
* '''Last Layer:''' Just as with ZZ-Spike or Petrus, you solve the last layer with the advantage of all the edges being oriented.

== Pros ==
* '''2LLL''': The last layer can be solved in only two looks without any influencing from last slot and slightly less algorithms than for standard 3LLL.
* '''Early EO''': As opposed to ZZ-Spike or Petrus, Edge Orientation is done really early on in the solve and could potentially even be inspected in 15 seconds along with the Helix.

== Cons ==
* '''Edge Orientation''': Edge Orientation can take a while to get used to and even if mastered, the solver needs to spend time on recognition and execution while other pieces could have been solved in the mean time.
* '''Fixed Order''': Because the solver usually only learns EO recognition for six specific sides, the Helix always needs to be built at the same position, which can sometimes be inefficient.

== See also ==
* [[ZZ-Spike]]
* [[Edge Orientation]]
* [[ZZ]]
* [[GenTheThief]]

== External links ==
* YouTube: [https://www.youtube.com/watch?v=T9tFQhURYqc Video Tutorial]

ZB method

2026-06-10T20:14:19Z

RedstoneTim: Wording/Grammar

{{Method Infobox
|name=ZB
|image=ZBLS_representation_imageV2.png
|proposers=[[Zbigniew Zborowski]] [[Ron van Bruchem]]
|year=2002
|anames=
|variants=[[VH]]
|steps=3
|algs=798 ZBLS: 305 ZBLL: 472 (+ 21 inc. [[PLL]])
|moves=Speedsolving: 48
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}

'''ZB''' (short for ''Zborowski-Bruchem'' after its proponents, [[Zbigniew Zborowski]] and [[Ron van Bruchem]]) is a very efficient but algorithm-intensive method which is a variation of advanced [[LBL]] methods such as the [[Fridrich method]]. After solving the F2L minus one [[corner-edge]] pair in whatever method the solver wishes, there are just two more steps: [[ZBLS]] (originally called ''ZBF2L''), which finishes F2L while simultaneously orienting the edges of the [[last layer]], and [[ZBLL]], which finishes the last layer in one algorithm.

ZB averages fewer moves than CFOP and reaches the all last layer edges oriented state without requiring the use of edge control. Unfortunately, because this method has a total of 300 algorithms or 795 total cases, it would take a very long time to learn the entire method. The ergonomics of the ZBLS algorithms are also mostly unknown.

The method has historically been regarded as difficult to learn due to its high algorithm count, requiring solvers to memorize approximately 800 algorithms (798 algorithms including [[ZBLS]] and [[ZBLL]]). As a result, many speedcubers have not adopted the method entirely, instead incorporating selected ZB techniques (mostly [[ZBLL]]) into [[CFOP]], with which it is highly compatible. In recent years, the method has gained increased attention within the speedcubing community. This growth has been associated with the success of Chinese speedcubers such as [[Xuanyi Geng]] and [[Qixian Cao]], both of whom use the [[ZB]] method. This later inspired [[Tymon Kolasiński]] to switch to the ZB method in its entirety. As of 2026, the 3x3 average World Record is currently held by [[Xuanyi Geng]], who uses the ZB method.

== See also ==
* [[ZBLS]]
* [[ZBLL]]
* [[VH]]
* [[Fridrich Method]]
* [[ZZ Method]]

== Resources ==
* [http://www.zborowski.republika.pl/expert3x3x3method.html Zbigniew Zborowski's ZB Page]
* [http://www.speedcubing.com/chris/zb.html Chris Hardwick's ZB Page]
* [http://jmbaum.110mb.com/zb.htm Jason Baum's ZB Page]
* [http://www.cubestation.co.uk/cs2/index.php?page=3x3x3/zb/zb Dan Harris's ZB Page]
* [https://pepkin88.me/zbll-explorer/ pepkin88's ZBLL Explorer, compiles algorithms from many different resources]
* [http://lar5.com/cube/270/index.html Lars Petrus's ZBLL Algs]
* [http://www.cubezone.be/zbf2l.html Lars Vandenbergh's ZB F2L Algs]
* [https://archive.ph/f6YtJ CE's ZB F2L Algs] (OH)
* [https://archive.ph/tmQyo Tading's ZBLL Algs]
* [https://www.speedcubingtips.eu/methode-zb/ speedcubingtips.eu's ZB method in French]
* [https://www.speedcubingtips.eu/zbll-zborowski-bruchem-last-layer/ speedcubingtips.eu's ZBLL Algs]
* [https://www.speedcubingtips.eu/zbls-zborowski-bruchem-last-slot/ speedcubingtips.eu's ZBLS Algs]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Advanced methods]]

Sexy Method

2026-06-10T20:09:54Z

RedstoneTim: Added back link to tutorial (url has been moved)

{{Method Infobox
|name=Sexy
|image=Sexy_method.gif
|proposers=[[Conrad Rider]]
|year=2010
|anames=SAM (Single Alg Method), 1234 method
|variants=[[8355]], [[MirIS]], [[Y-Move Method]], [[Less is More]]
|algs=1
|steps=7
|moves=100+
|purpose=
* [[Beginner Method]]
}}

'''Sexy Method''' is a variant of the [[8355 Method]] specifically designed for ease of learning, using a single algorithm: the [[sexy move]].

== Steps ==
* Intuitively solve the [[Cross]]
* Intuitively solve 3 of the E-slice edges, leaving a [[keyhole]].
* Use the sexy move to solve the corresponding 3 D-layer corners by passing them from the U-layer through the keyhole.
* Intuitively solve 3 U-layer edges.
* Solve the last 2 edges, using intuition or algorithms.
* Turn the cube over.
* Solve 3 more corners with the sexy move as before. To avoid confusion, leave the corner under the keyhole unsolved.
* Continue sexy moves as necessary until the cube is either solved, or is solved with the exception that two corners are misoriented.
* If two corners are misoriented, rotate the cube to put those corners at DF. Solve them with the sexy move as before.

== See also ==
* [[Sexy Move]]
* [[MirIS]]
* [[8355]]
* [[LBL]]
* [[Y-Move Method]]
* [[Less is More]]

== External links ==
* [https://cube.rider.biz/miris.html Main tutorial]
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=22275 Beginner 3x3 Tutorial (1 alg solution)]

[[Category:3x3x3 methods]]
[[Category:3x3x3 beginner methods and substeps]]

Tripod Method

2020-02-15T15:44:22Z

RedstoneTim: Added ZZ-Tripod as a variant

{{Method Infobox
|name=Tripod
|image=Tripod_method.gif
|proposers=[[Ryan Heise]], [[Michael Gottlieb]], [[Mirek Goljan]]
|year=2002
|anames
|variants= [[Petrus]], [[ZZ]]-Tripod
|steps=4
|algs=58
|moves= ~50
|purpose= [[Speedsolving]]
}}

A blockbuilding approach to solving the 3x3x3, first proposed by [[Ryan Heise]] and developed by [[Michael Gottlieb]] and [[Mirek Goljan]]. The method is characterized by the final steps, which involve solving a 'tripod' composed of the three 1x1x2 columns connected to the URF corner piece.

== The Steps ==

1. Build a 2x2x2 block. This is an intuitive step.

2.Build 3 1x2x2 block side by side the 2x2x2 block. This is also an intuitive step.

3. Insert the last F2L slot.

4. Finish the last layer using one of 58 algorithms.

== Variants ==
* '''[[ZZ]]-Tripod:''' ZZ-Tripod, invented by Neuro in 2017, is an attempt at combining [[ZZ]] with Tripod, resulting in a normal ZZ solve up to F2L-1 when a 1x2x2 block is built on the top face. This is followed by NLS to insert the last F2L pair while preserving edge orientation. After that, the last layer is solved using TELL, which is a subset of both [[Tripod LL]] and [[ZBLL]] with very few algorithms.

== Pros ==

Like many other blockbuilding methods, this method uses less moves than the ever popular CFOP method.
The steps are all fairly simple and easy to execute, allowing for good lookahead.
The method has a low algorithm count compared to most mainstream methods such as CFOP or ZZ.

== Cons ==

The blocks, particularly the U layer block, are quite restrictive to the construction of the final F2L slot.
Recognition for the final step is not excellent and could be compared to that of COLL.
Beginners may find blockbuilding to be difficult.

== Example solve ==

Scramble (white on top, green in front): L' F2 R U B R2 D' F2 L' B U' R2 F2 B2 U L2 U' R2 L2

x2 R U' D R' D' - 2x2x2

y' L' F U' F2 L F' - First 2x2x1 block

L2 D L' U2 L D' - Second 2x2x1 block

U F R U' R' F' L' U' L U2 - Final 2x2x1 block

U' R F' U' F' U F R' F2 U' F2 U2 - F2L slot

L' U R U' R' U R U' R' L R U R' U' R U R' U' - Last 5 pieces

== External links ==
* [http://web.mac.com/teisenmann/Tripod/main.html Web-based tutorial]
* [http://www.ws.binghamton.edu/fridrich/L1/ece.htm Mirek Goljan's tripod algorithms]
* [http://games.groups.yahoo.com/group/speedsolvingrubikscube/message/2234 Ryan Heise's Post]
* [https://docs.google.com/spreadsheets/d/1dPeO6UkCF4QsyineVvHr6wZOcBkVmfTZnMA42KM92to Neuro's ZZ-Tripod algorithms (includes NLS and TELL)]
* YouTube: [https://youtu.be/nMlEQ9M6Xcg Neuro's ZZ-Tripod tutorial]
* Speedsolving.com: [http://www.speedsolving.com/forum/threads/bindedsas-algorithms.55518/ BindeDSA's Algorithms]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]

SSC

2020-02-15T15:18:03Z

RedstoneTim: Added link to a PDF containing SqAree's OL5C algorithms and another one with EZD algorithms

{{Method Infobox
|name=Shadowslice Snow Columns
|image=ECE-finalstep.png
|proposers= [[Joseph Briggs]], [[Julien Adam]]
|year= 2015
|anames= ECE, Briggs-Adam
|variants= Original variant, L6E variant, Broken variant, Permute-last variant, EZD variant, NoEO variant
|steps= 4 major though lots of flexibility. Depends on variant
|algs=around 50 depending on variant, 10 min.
|moves= ~40-50 depending on variant [[STM]]
|purpose=
* [[Speedsolving]], [[FMC]]
}}
'''SSC''', short for '''Shadowslice Snow Columns''',(a variant with misoriented edges is called '''ECE'''), is a method that has variously been described as a variation on [[Orient First]], an improved version of the [[Human Thistlethwaite Algorithm]], an advanced [[Belt Method]] and a [[Columns first]] method. It is a method that requires few (28) algorithms but requires proficiency in various relatively advanced techniques such as the [[EOLine]] (which is rotated 90 degrees to create an EOEdge) as well as being able to efficiently orient corners while placing an edge. It is an efficient method which averages below 50 [[STM]] in the hands of an expert.

Intially, it was proposed simply with the '''SSC-WV''' variant though this quickly became the set of methods which is known today. After the '''SSC-M''' variant was introduced, the idea was quickly expanded on by [[Julien Adam]] who created what is collectively known as the '''ECE''' variants which, while following the same basic steps as vanilla SSC-M have various advantages depending on the method. Notable variants include '''SSC-O''' and '''EZD''' for [[speedsolving]] and '''SSC-Domino''' as an [[FMC]] alternative.

==Method Overview==
This method has been independently proposed by at least 3 people though it was perhaps developed most by [[Joseph Briggs]] and [[Julien Adam]]. It is one of the most move efficient methods that has been developed; potentially on par with [[Heise]], [[Human Thistlethwaite Algorithm]] and [[ZB]] depending on the variant. Also similar to Heise, it is quite intuitive and has a low algorithm count though in terms of procedure it is more similar to HTA or [[PCMS]].

==General Structure==
# Solve EoEdge ([[EOLine]] but placing FL and BL rather than DF and DB).
# Orient corners and edges and place FR and BR edges.
# Solve the rest of the cube using one of many variants.

==Pros==
* Low movecount
* Ergonomic- mostly {R,U,D,M}
* Low algorithm count compared to more popular speedsolving methods

==Cons==
* Can be difficult to transition from other popular methods as it does not directly solve many pieces until the final few steps.
* Pseudopairs can be difficult to get used to.
* Lookahead can be made difficult due to the lack of direct solving
* It is generally acknowledged that the current last step variants are not the best and so it is an area of constant development so any variant learned may be out of date or superseded by better variants relatively quickly.

==Beginner's SSC==
# Solve EoEdge and place one additional E-slice edge
# Orient 3 D-layer corners and create a pseudopair to insert the final E-slice edge
# [[OCLL]]
# Separate corners
# Solve corners
# LEE (last eight edges)

==Intermediate SSC==
# Solve Eoedge and place one additional E-slice edges
# Orient 3 D-layer corners and create a pseudopair
# [[WV]] (winter variation) using the pseudopair
# Separate corners
# Solve corners
# LEE (last eight edges)

There are actually quite a few ways to go about intermediate SSC however the above is the one most frequently recommended by those most familiar with the method.

==Advanced SSC==
# EoEdge
# Orient corners
## Create a pseudopair and pseudotriplet using the remaining E-slice edges
## [[OL5C]]
# Solve corners
# LEE

In fact there are many different last two steps for Advanced SSC similar to Intermediate and by the time one attains this level they should evaluate all the options in order to find the variant most suited to them.

==Variants==
There are quite a few variants to SSC, mostly to do with differences in the solving of the final step(s)
* EZD
** For LEE, the edges are separated before being permuted with a set of algorithms.
** This is the variant used by [[Julien Adam]] to obtain his sub-13 averages.
* Broken
** Similar to the Belt method, the F2L is solved after step 2 using {R2,L2,M2,U,D}
** [[PLL]]
* Permute last
** This is even more similar to the Belt method where edges are separated then PLL is applied to both sides.
* FR
** The FR(or BR) is left out of the E-slice(only making a pseudotriplet abd positioning one corner in LUF) and solve it later.

** This helps with lookahead in the first few steps and you can influence the UL and Ur edges while solving the FR edge
(SSC-FR : orientated edges)

(ECE-FR : misoriented edges)

==See Also==
*[[Kociemba]]
*[[Human Thistlethwaite Algorithm]]
*[[Orient First]]
*[[PCMS]]
*[[Belt]]
*[[ZZ]]

==External links==
*[https://www.speedsolving.com/forum/showthread.php?54056-SSC-(Shadowslice-Snow-Columns)-3x3x3-Method/ Original proposal](includes SSC-M and SLS)
*[https://www.speedsolving.com/forum/threads/ece-new-3x3-solving-method.55898/ Crafto22 (Julien Adam)'s ECE proposal]
*[http://imgur.com/FoUYLWg/ SqAree's OL5C algorithms]
*[https://drive.google.com/file/d/1YMMZ7wpwO3208J3MnV4t3fZXUphIkazx SqAree's OL5C algorithms in PDF form]
*[https://drive.google.com/file/d/1SJNZlQABc3mNd6DhCiiLnpQ7FgAb-MNQ EZD algorithms]
*[https://youtu.be/UakJ9H0CdBs Shadowslice's walkthrough]

[[Category:Experimental_methods]]
[[Category:3x3x3_speedsolving_methods]]
[[Category:3x3x3_methods]]
[[Category:Fewest_Moves_Methods]]

LEOR

2020-02-10T08:59:30Z

RedstoneTim: Added that the moveset is especially good for OH solving

{{Method Infobox
|name=LEOR
|image=Leor.gif
|proposers= Arc, Pyjam
|year=2017
|anames= LEORa
|variants= LEOR-b, EOMR
|steps= 4
|moves= 48 with [[ZBLL]]
|algs= 4-497
|purpose=
* [[Speedsolving]]
* [[One-Handed Solving]]
}}

LEOR (Left, EO, Right) is a method that is a mix between ZZ and Roux that allows for ergonomic steps with the mindset of speed and move count.

==Steps==

1. FB/LB: Build a 1x2x3 block on the left side of the cube.

2. EOStripe: Solve EO for all the other edges while solving the DFDB edges.

3. SB/RB: Build a second 1x2x3 block on the right side of the cube.

4. [[ZBLL]]: Finish the last layer in 1 step.

==Pros==

* Ergonomic movesets after FB, especially for [[OH]].

* Low move count - similar to that of [[Roux]].

* No rotations required.

==Cons==

* Steep learning curve - planning both FB and EO is very difficult.

* Difficult to smoothly solve EO and the DFDB edges at the same time.

==Advanced Techniques==

* '''Corner control''': it is easy to control the [[OCLL]] of the last layer which can be used to force easier ZBLL subsets.

==Big Cubes==

1. L and R centers

2. 1x3x4 block on L (like in [[Meyer]])

3. Last 4 Centers

4. Place the block on D, with the unsolved 1x1x4 in DF, then pair up any edge and place it in DF

5. Pair up the last 8 edges (the fastest way is probably with 3-2-3 edge pairing)

6. EOStripe + parity

7. Right block

8. COLL

9. EPLL + parity

nb. If you're solving odd layered cubes, use ZBLL instead of COLL then EPLL + parity.

==Variants==

LEOR-b:

1. Solve a 2x2x2 in DBL

2. Solve the FL pair

3. EODF (EOStripe but only with the DF edge)

4. Right block

5. ZBLL

EOMR:

1. EOFB

2. Stripe while preserving EO

3. Right block

4. ZBLL

== External links ==

[https://docs.google.com/spreadsheets/d/1o8J6MyjLb7sk9mWEQIA-ElMH5IlAeiq_DEnxPVbtujo/edit?usp=sharing EO algsheet]

Skis method

2020-02-09T14:16:08Z

RedstoneTim: Added explanation, steps, pros, cons and possible improvements

{{Method Infobox
|name=Skis
|image=Skis_method.png
|proposers=[[WoowyBaby]]
|year=2019
|anames
|variants
|steps=4
|algs=9-42
|moves=<50
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}

The Skis method was proposed by [[WoowyBaby]] in 2019 as a speedsolving method. It could be described as a mix of [[Corners First]] and [[Roux]] and was developed to allow for high [[TPS]] while maintaining a low movecount and keeping [[blockbuilding]] to a minimum. In spite of its potential, it currently doesn't have any active users.

== Steps ==
'''Skis:''' Two 1x1x3 blocks ("skis") are built in DL and DR, respectively. Centers can be ignored here.

'''CLL:''' The remaining four corners on the top are oriented and permuted in one of 42 algorithms while preserving the DL and DR edges. Most [[CLL]] algorithms for 2x2 apply here, although one might also use [[CMLL]] (or any other [[CxLL]] subset that doesn't destroy DL and DR).

'''LR:''' The four edges in the E-slice are solved in pairs. (Similar to 4b of [[Roux]].)

'''LSE:''' The last six edges on the M-slice and the U-layer are solved <MU>-gen, usually in multiple steps. Roux LSE is most common, although different approaches (listed in [[LSE]]) can be used here as well.

== Pros ==
* '''Inspection:''' Due to the Skis step, most of the solve can be planned in inspection. Therefore, it is sometimes possible to plan up to CLL. This prevents pauses mid-solve due to recognition (which is considered one of the biggest problems in Roux).

* '''High TPS:''' Except for LR, every other step is either planned in inspection or algorithmic, which allows for very high TPS.

* '''Less blockbuilding than Roux:''' Compared to Roux, the Skis method needs comparable or even less blockbuilding at the beginning and none in the middle of the solve. Therefore, less blockbuilding skills and intuitivity are required. This also gives beginners an easier learning curve than [[Roux]] does.

* '''Algorithms:''' Only 42 algorithms need to be learned, which is the same as [[Roux]] and less than in other popular speedsolving methods like [[CFOP]]. Since only the DL and DR edges need to be preserved, most of the very well developed 2x2 [[CLL]] algorithms transfer here.

* '''Very ergonomic:''' The Skis step and CLL are mostly <RUF>-gen and LSE is completely <MU>-gen, so turn speed can be very high and there are no rotations.

== Cons ==
* '''LR:''' LR can be harder to learn as it is very intuitive and edges can be almost everywhere. This causes worse lookahead and low TPS. It also doesn't have great ergonomics, so one needs to be able to switch between R, U, F, M and E moves.

* '''Slice moves:''' Because of LR and LSE, this method heavily relies on slice moves, especially M, which can be hard for beginners to get used to and also aren't very easy to execute on [[big cubes]]. Since LSE is performed at the end of the solve, there is a higher chance to get a [[DNF]] instead of a [[+2]].

* '''Very new:''' As the Skis method is very recent, it hasn't been developed as much as other big speedsolving methods like [[CFOP]], [[Roux]] and [[ZZ]] and thus has a lot less resources.

== Possible improvements ==
* '''E2L:''' To improve LR, [[LMCF]]'s algorithmic E2L step can be used to allow for better ergonomics and higher tps because of the pre-made algorithms, although this will highly increase the amount of algorithms that need to be learned.

== See also ==
* [[WoowyBaby]]
* [[Corners First]]
* [[Roux]]
* [[CxLL]]
* [[LSE]]
* [[LMCF]]

== External links ==
* [https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/page-254#post-1317365 Original proposal with example solves]
* YouTube: [https://www.youtube.com/watch?v=v5fwjWhyzZ8 Video walkthrough]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

Roux method

2020-02-09T12:36:13Z

RedstoneTim: Added "One-Handed Solving" as a purpose of Roux

{{Method Infobox
|name=Roux
|image=Roux_method.gif
|proposers=[[Gilles Roux]]
|year=2003
|anames
|variants
|steps=4
|algs=9-42
|moves=[[Speedsolving|Speed]]:48, [[FM]]:28-
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
* [[One-Handed Solving]]
}}

'''Roux''' (French pronunciation: [ʁu]) is a [[Rubik's cube]] speedsolving method invented by [[Gilles Roux]]. Unlike the [[CFOP method|CFOP]] and [[Petrus method|Petrus]] methods, the inventor of this method has used it to achieve an official sub-15 [[average]]. It is the favorite method of many top OH solvers. Similarities can be drawn to the Petrus method's block building and the [[Waterman method]]'s layer-on-the-left and edges-last aspects.

==Steps==

1. Build a 1x2x3 block anywhere on the cube.

2. Build a second 1x2x3 block opposite of the first 1x2x3 block, without disrupting the first 1x2x3 block. After this step, there should be two 1x2x3 blocks: one on the lower left side, and one lower right side, leaving the U slice and M slice free to move.

3. Simultaneously [[orient]] and [[permute]] the remaining 4 corners on the top layer (U-slice). You can use [[CMLL]],[[COLL]], or Corner OLL's (along with the T or J, and Y permutation) to do this.

4a. [[Orient]] the 6 remaining edges using only M and U moves (UF, UB, UL, UR, DF, DB need to be oriented correctly).

4b. Solve the UL and UR edges, preserving edge orientation. After this step, both the left and right side layers should be complete.

4c. Solve the centers and edges in the M slice, ''see [[Last Six Edges]]''.

: ''See also: [[L5E]]''

==Pros==

*Like the Petrus method, the Roux method uses fewer moves than the popular Fridrich method.
*It is also more intuitive and requires fewer algorithms.
*After the first block is built the rest of the cube can be solved mostly with R, r, M and U moves thus eliminating rotations.
*CMLL is one of the best algorithm sets as there are only 42 cases and most algorithms are fast OLLCPs from CFOP
*The blockbuilding and intuitive nature of the method allows for rapid improvements in lookahead and inspection
*The LSE step of Roux is very easy to master, as it has easy lookahead and allows for fast, 2-gen MU TPS.

==Cons==

*Block building can be difficult for a beginner to get used to. The reliance on r and M moves may also be difficult for some people, so much so that cubers who have trouble with M turns should probably not use this as their main method (or better, practice the M moves).
*Since the M-slice is used often, especially in the final stages, there is a larger chance of a [[DNF]] rather than a [[+2]] if the solver misses the second flick in an M2, or if the solver misses the last M move. It is a DNF because M uses both the R and L face in one.
*The M-slice becomes increasingly difficult with higher [[order]] puzzles. With [[7x7x7]] and [[6x6x6]], many argue that Roux is essentially unusable; however, with practice, one may be able to do well with it on [[big cubes]].
*The M-slice is very difficult with [[OH]], and OH Roux solvers almost always need to utilize [[table abuse]] and therefore can pretty much never solve one-handed away from a table or other surface. However, if one practices doing one-handed M-slices, it can be done very well but only with a table (which shouldn't be a concern in competitions).

==Improvement==

Free/non-linear blocks: The first block and second block do not need to be built in that order. You can build part of one and finish the other later. This is very useful when there are a lot of free, pre-built blocks and pairs.

Non-matching centres: The first two blocks can be built around incorrect centres. This allows for more efficiency and allows rouxers to take advantage of pre-built blocks. The centres are corrected directly before CMLL with either u M' u' or u' M' u.

Some Roux users have learned multiple algorithms for each CLL case, each affecting edges in a different way. This allows for manipulation of edge orientation, leading to an easier LSE. This is called CMLLEO.

Possibly another improvement is to expand to solving any of the four second blocks. This means that the D-layer colors of the two blocks don't have to match. This is called non-matching blocks. One negative, if someone has already learned a recognition method for CLL, is that to easily use the full range of second block options, a switch to [[NMCLL]] recognition is necessary. Another is that LSE EO is a bit more difficult to recognize in some solves.

Pinkie Pie: a variant proposed by Alex Lau in 2016, it involves orienting the UL/UR edges on the D layer while using an OLLCP algorithm to orient the remaining edges and solving the remaining corners. The user then will get a 4a skip and a very easy 4b step. While this may seem good, many faster Rouxers are of the opinion that it is simply better to influence the EO step and not go to all the hassle of placing UL/UR on D and having to recognise an OLLCP. There is also the reason that many Roux solvers use the method to have less algorithms and do not want to learn the huge OLLCP algset.

EOLR: a variant proposed by Gilles Roux and further documented by Alex Lau, Kian Mansour, and Iuri Grangeiro. It combines steps 4A and 4B of the method, orienting edges and placing ULUR on the D layer simultaneously. The cases are all intuitive, as they involve performing the EO case from different angles to set up a "good arrow" where ULUR can then be placed on bottom.

UFUB: Instead of solving ULUR edges in 4B, UFUB are solved. This can lead to more efficient solutions, but lookahead becomes much more difficult. It is most useful for skipping the "dots" 4C case, but requires center recognition and more lookahead.

Misoriented centres: Standard roux involves orienting all 6 edges relative to the centre colour that is on the bottom of the blocks. Instead, we can orient them relative to the front colour. As with UFUB, efficiency is improved, but lookahead is hindered. This is most useful for known EOLR cases.

== Notable users ==
* [[Gilles Roux]] [http://www.worldcubeassociation.org/results/p.php?i=2004ROUX01]
* [[Thom Barlow]] (Kirjava) [http://www.worldcubeassociation.org/results/p.php?i=2006BARL01]
* [[Austin Moore]] (BigGreen) [http://www.worldcubeassociation.org/results/p.php?i=2009MOOR01]
* [[Jules Manalang]] (Waffo) [http://www.worldcubeassociation.org/results/p.php?i=2008MANA02]
* [[Alexander Lau]] (5BLD) [http://www.worldcubeassociation.org/results/p.php?i=2011LAUA01]
* [[Kaijun Lin]] (林恺俊) [https://www.worldcubeassociation.org/results/p.php?i=2013LINK01]
* [[Mitsuki Gunji]]
* [[Artur Kristof]] (Arcio) [http://www.worldcubeassociation.org/results/p.php?i=2012KRIS12]
* [[Kian Mansour]] [https://www.worldcubeassociation.org/results/p.php?i=2015MANS03]
* [[Kavin Tangtartharakul]] (GuRoux) [https://www.worldcubeassociation.org/results/p.php?i=2014TANG03]
* [[Vincent Wong]] (Kangaroux) [https://www.worldcubeassociation.org/results/p.php?i=2014WONG08]
* [[Sean Patrick Villanueva]] [https://www.worldcubeassociation.org/persons/2017VILL41]

==Forum links==
* [https://www.speedsolving.com/forum/showthread.php?3842-Roux-Help-and-Discussion-thread.html Roux help and discussion thread]
* [https://www.speedsolving.com/forum/showthread.php?51553-One-Answer-3x3-Roux-Question.html One-question answer thread]
* [https://www.speedsolving.com/forum/showthread.php?50819-How-to-read-a-Roux-corners-table.html Reading Roux corners tables]
* [https://www.speedsolving.com/forum/showthread.php?47572-Video-Roux-as-a-Beginner-Method.html Beginner's Roux video tutorial]
* [https://www.speedsolving.com/forum/showthread.php?48028-The-Roux-quot-Example-Solve-quot-Game!.html Roux Example solves]
* [https://www.speedsolving.com/forum/showthread.php?35350-Roux-4b-to-4c-Transition.html Roux step 4b-4c transition help]

== External links ==
* [http://grrroux.free.fr/method/Intro.html Gilles Roux's tutorial]
* [https://sites.google.com/view/kianroux Kian's Roux Guide]
* [https://www.youtube.com/channel/UCdEm9-DsuOzNoWmTAYNLRoQ Kian's Youtube Channel]
* [http://wafflelikescubes.webs.com/ Waffle's Roux Site]
* Wikia: [http://rubiks.wikia.com/wiki/Roux_Method Roux Method]
* [http://www.speedsolving.com/forum/showthread.php?t=11506 Waffle's Roux Tutorial]
* [http://rouxtorial.webs.com/ 5BLD's and PandaCuber's Roux Tutorial]
* [http://www.speedsolving.com/forum/showthread.php?29123-The-reconstruction-thread&p=634675&viewfull=1#post634675 Reconstruction for BigGreen's unofficial Ao5 9.51]
* [http://games.groups.yahoo.com/group/speedsolvingrubikscube/message/5923 Original Method Proposal]
* [https://www.speedcubingtips.eu/methode-de-resolution-roux/ Tutorial in French]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

Skis method

2020-02-09T10:26:43Z

RedstoneTim: Created Skis method page

{{Method Infobox
|name=Skis
|image=Skis_method.png
|proposers=[[WoowyBaby]]
|year=2019
|anames
|variants
|steps=4
|algs=9-42
|moves=<50
|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
}}

== External links ==
* [https://www.speedsolving.com/threads/the-new-method-substep-concept-idea-thread.40975/page-254#post-1317365 Original proposal]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:Fewest Moves Methods]]

File:Skis method.png

2020-02-09T10:21:10Z

RedstoneTim: Image for the "Skis method"

== Summary ==
Image for the "Skis method"

L5E

2020-02-08T10:28:28Z

RedstoneTim: Added link to spreadsheet with L5E algorithms

{{Substep Infobox
|name=L5E
|image=
|proposers=
|year=
|anames=[[Last five edges]]
|variants=[[Sexy*+S(8355)]]n [[SexyM Beginner]], [[Commutators (pseudo EF)]]
|subgroup=
|algs= Unknown for 1 look, 5 for L5EO and 16 for L5EP
|moves= about 14
|purpose=
|previous=[[5 Corners Missing cube state]]
|next=[[Solved cube state]]
}}

'''L5E, Last five edges''', is an experimental method that solves five [[edges]], the four in U and one in the D layer, preserving all other pieces.

[[ELL]] is a sub group of L5E, all ELL's may be solved in two steps using this method.

== Description ==
There are two main sub-parts. First the edges are oriented using M'UM like in Roux; there are 5 cases for this, and the worst case in Roux (6 edges) is impossible. Then the edges must be permuted; you can place FD during orientation or right after using [U] M' U2 M (named 'P') and end with [[EPLL]], or just permute all five edges in one step.

L5E can be useful for [[Corners First]] if the E-slice, centres and three FL edges are solved after the corners. It is also useful in any method that starts with [[columns]], such as one which does the F2L pairs first and then finishes with [[CxLL|CMLL]], it is an alternative to the last step of [[Roux]] if the centres are placed together with the BD edge at first, also for any LBL style, cross minus one edge at first and then the LL corners have been finished with [[CLL]] or [[CMLL]] or the same for Fridrich with 2-look [[OLL]], corners first, then L5E orientation, place FD using P if it was not solved and end it all in PLL as usally.

==Intermediate system==

===Intuitive===
This style is not completely intuitive, because it is still necessary to know [[EPLL]]. First orient all unoriented edges, then place the FD edge to its correct position and finally end the solve in EPLL. The necessary intuitive steps are:

* P = M' U2 M
* O = M' U M
* O' = M' U' M

Using that plus some U turns you can solve any case, even all [[ELL]] case. For example, O U P = (M' U M) U (M' U2 M) is a sample algorithm which solves orientation, then places FD. There is a 1 in 12 chance that EPLL is skipped; otherwise there is one algorithm left.

There is another notation which can make it shorter to write algorithms:

* F(moves) = F2 (moves) F2

It is important here that the moves inside the parentheses keep the corners solved, so that they will still be correct after this algorithm. An example is the [[U-perm]], F(U P U) = F2 (U M' U2 M U) F2. F(O U') is a nice way to solve orientation and place FD all at once if the FD edge is in the middle of three unoriented edges in LL.

===Using algorithms===
The intuitive style lets you find and understand the orientation algorithms yourself. Another approach is to learn the algorithms instead of finding them; the cases are:

{| style="border: 1px solid #808080; color: black; background-color: #FAFAFA;" cellspacing="0" cellpadding="2"
| colspan="2" | <center>'''Basic orientations'''</center>
|---
|
{{Casebox
|IMAGE=[[Image:FUL Solved.jpg|80px]]
|NAME=''Intuitive solution''
|ALGO=''(Possibly optimised) alg''
|INFO=''Comment''
}}
|
{{Casebox
|IMAGE=[[Image:EO5 2 adjacent.jpg|80px]]
|NAME=O U2 O
|ALGO=(M' U M) U2 (M' U M)
|INFO=Orients UL and UB.
}}
|---
|
{{Casebox
|IMAGE=[[Image:EO5 2 opposite.jpg|80px]]
|NAME=O U' O
|ALGO=(M' U M) U' (M' U M)
|INFO=Orients UF and UB.
}}
|
{{Casebox
|IMAGE=[[Image:EO5 4.jpg|80px]]
|NAME=P U2 O'
|ALGO=(M' U2 M) U2 (M' U' M)
|INFO=Orients UR, UF, UL and UB
}}
|---
|
{{Casebox
|IMAGE=[[Image:EO5 1.jpg|80px]]
|NAME=O U O'
|ALGO=(M' U M) U (M' U' M)
|INFO=Orients FD and UB
}}
|
{{Casebox
|IMAGE=[[Image:EO5 3.jpg|80px]]
|NAME=O'
|ALGO=(M' U' M)
|INFO=Orients FD, UR, UF and UL
}}
|---
| colspan="2" | <center>''All images show white on top (U) and green in front (F).''</center>
|}
''More algs are at the [[L5EOP|L5EOP page]]''

Sometimes this will also solve the FD edge; the images show where the FD edge must be for the algorithm to solve it, but otherwise you should simply treat the yellow sticker as white. If you learn these positions, it can also be useful to learn the mirror algorithm for the case where FD is on the opposite side from the image. The easiest example is to use O' instead of O for the case with three flipped edges on U. Just like the intuitive step, if FD is not solved use P, and either way finish with [[EPLL]].

==Semi-advanced system==

[[L5EOP]] is an alternative to L5E, that always solves the FD edge while orienting ('P'lace). Then the last step will always be EPLL.

===FD placement + EPLL (L5EP)===
Another possibility for improving the intermediate style is to permutate the last five edges in one step. This only requires 16 algorithms in total, so counting the 5 orientations creates a system that solves L5E in two short steps. Even if you know this, it is still useful to place FD without extra moves if possible, since EPLL recognition is very fast.

We will introduce the following function:
* f(moves) = f2 (moves) [U] f2 ... This is the same as the F() function above, but with double layer f turns. Note that sometimes the adjusting U turns are not mentioned.

Here are the algorithms for permutation of all 5 edges; make sure to use AUF to place the FD edge at the position it has in the image.

{| style="border: 1px solid #808080; color: black; background-color: #FAFAFA;" cellspacing="0" cellpadding="2"
| colspan="2" | <center>'''Double two cycle permutations'''</center>
|---
|
{{Casebox
|IMAGE=[[Image:FUL Solved.jpg|80px]]
|NAME=''Intuitive solution''
|ALGO=''(Possibly optimised) alg''
|INFO=''Comment''
}}
|
{{Casebox
|IMAGE=[[Image:EP5 22 A.jpg|80px]]
|NAME=F(H-PLL)
|ALGO=(y') R U2 R2 U2 R2 U2 R
|INFO=Swaps UF<->DF and UR<->UL
}}
|---
|
{{Casebox
|IMAGE=[[Image:EP5 22 B1.jpg|80px]]
|NAME=F(Z-PLL)
|ALGO=(y') r2 U' 2x(M E2) U r2
|INFO=Swaps UR<->DF and UL<->UB
}}
|
{{Casebox
|IMAGE=[[Image:EP5 22 B2.jpg|80px]]
|NAME=F(Z-PLL')
|ALGO=(y') r2 U 2x(M E2) U' r2
|INFO=Swaps UL<->DF and UR<->UB
}}
|---
|
{{Casebox
|IMAGE=[[Image:EP5 22 H.jpg|80px]]
|NAME=[[PLL#H Permutation|H-PLL]]
|ALGO=Ra U2 Ra' (y) Ra' U2 Ra
|INFO=Swaps UR<->UL and UF<->UB
}}
|
{{Casebox
|IMAGE=[[Image:EP5 22 Z.jpg|80px]]
|NAME=[[PLL#Z Permutation|Z-PLL]]
|ALGO=M2 U' 2x(M E2) U M2
|INFO=Swaps UR<->UB and UL<->UF
}}
|---
| colspan="2" | <center>'''3-cycle permutations'''</center>
|---
|
{{Casebox
|IMAGE=[[Image:EP5 3 A.jpg|80px]]
|NAME=P
|ALGO= (M' U2 M)
|INFO=Cycles UF->DF->UB
}}
|
{{Casebox
|IMAGE=[[Image:EP5 3 B1.jpg|80px]]
|NAME=f(d' P)
|ALGO=(y') r2 U' (M' U2 M) U' r2
|INFO=Cycles UL->UB->DF
}}
|---
|
{{Casebox
|IMAGE=[[Image:EP5 3 B2.jpg|80px]]
|NAME=f(d P)
|ALGO=(y') r2 U (M U2 M') U r2
|INFO=Cycles UR->UB->DF
}}
|
{{Casebox
|IMAGE=[[Image:EP5 3 U1.jpg|80px]]
|NAME=[[PLL#U Permutation : b|U-PLL]]
|ALGO=F2 U (M' U2 M) U F2
|INFO=Cycles UF->UL->UR
}}
|---
|
{{Casebox
|IMAGE=[[Image:EP5 3 U2.jpg|80px]]
|NAME=[[PLL#U Permutation : a|U-PLL']]
|ALGO=F2 U' (M' U2 M) U' F2
|INFO=Cycles UF->UR->UL
}}
|<center> </center>
|---
| colspan="2" | <center>'''5-cycle permutations'''</center>
|---
|
{{Casebox
|IMAGE=[[Image:EP5 5 H1.jpg|80px]]
|NAME=P U P
|ALGO=(M' U2 M) U (M' U2 M)
|INFO=Cycles UF->UL->UR->DF->UB
}}
|
{{Casebox
|IMAGE=[[Image:EP5 5 H2.jpg|80px]]
|NAME=P U' P
|ALGO=(M' U2 M) U' (M' U2 M)
|INFO=Cycles UF->UR->UL->DF->UB
}}
|---
|
{{Casebox
|IMAGE=[[Image:EP5 5 Z1.jpg|80px]]
|NAME=P Z-PLL
|ALGO=2x(M2 U) (M U2 M')
|INFO=Cycles UF->UR->UB->UL->FD
}}
|
{{Casebox
|IMAGE=[[Image:EP5 5 Z2.jpg|80px]]
|NAME=P Z-PLL'
|ALGO=2x(M2 U') (M U2 M')
|INFO=Cycles UF->UL->UB->UR->DF
}}
|---
|
{{Casebox
|IMAGE=[[Image:EP5 5 U1.jpg|80px]]
|NAME=P U-PLL
|ALGO=(M' U2 M') U' (M' U2 M) U' M2
|INFO=Cycles UF->DF->UB->UL->UR
}}
|
{{Casebox
|IMAGE=[[Image:EP5 5 U2.jpg|80px]]
|NAME=P U-PLL'
|ALGO=(M' U2 M') U (M' U2 M) U M2
|INFO=Cycles UF->DF->UB->UR->UL
}}
|
|---
| colspan="2" | <center>''These images have white on top (U) and green in front (F). Darker pieces change positions.''</center>
|}

==Advanced system==
The most advanced system would be to simply solve in one step. Nobody has generated the algorithms for this yet, but it may not be a good idea because of the large number of cases and bad recognition. For the worst ones the algorithm will probably just be the same as in the 2-step solution, so the benefit will be small at best.

One case where this is useful (and doable) is to solve cases where at least one of the edges is solved at the start. Using setup turns and [[ELL]] this can be done in one step, although the recognition and setup moves might mean that this is not worth doing.

==See also==
* [[ELL]]
* [[PCMS]]
* [http://athefre.110mb.com/Step5.html Permutation of last 5 edges by Athefre]
* [https://docs.google.com/spreadsheets/d/1feWj3FOAc6cH4Zpt_zGxuwJt8w_4aSkkmxoxpYzWdBA/edit?usp=sharing L5EP Algorithm Spreadsheet]
* [https://docs.google.com/spreadsheets/d/1VPtGoN_yDoWbBnPVgPWkqlNfj9YjN4LykrpKvUjrw-g Spreadsheet containing L5E algorithms]

[[Category:Experimental methods]]
[[Category:3x3x3 other substeps]]
[[Category:Acronyms]]

Zipper Method

2020-02-08T10:26:17Z

RedstoneTim: Added Zipper-b, ZZ-Zipper and some algorithms

{{Method Infobox
|name=Zipper
|image= ZipperCoverPhoto3.PNG
|proposers=Justin Taylor
|year=October 2017
|variants=Zipper-b, ZZ-Zipper
|steps=4
|moves=Low 40s With Blockbuilding, 45 With CFOP Background, 23 For LS+LL
|algs=359 Total; 331 OLLCP, 28 L5E
|purpose=|purpose=
* [[Speedsolving]]
* [[Fewest Moves]]
* [[One-Handed Solving]]
}}

The '''Zipper Method''' is a speedsolving method created by Justin Taylor in 2017, several months after development of the [[Ribbon Method]]. The method was created as a Two-Look solution for the Last Slot and Last Layer without preorienting edges and maintaining a manageable algorithm count. This allows great versatility in approach for the [[F2L]], along with a smooth transition into LSLL. Additionally, this method has a very fast LS+LL, as it combines the well-established OLLCP step with L5E, a [[2gen]], low algorithm step with easy recognition and execution. The method retains every ergonomic advantage of [[CFOP]], while containing one fewer "look" in the solve and saving an average of 9 moves with a CFOP-like approach to F2L. Zipper can either be used as a standalone method, or in conjunction with other CFOP subsets whenever a corner solves itself during F2L.

==The Steps==
* '''''Cross + 1 Corner (Fish):''''' This is the most distinctive part of the Zipper Method. Taking an average of 6 moves and no more than 9 moves, this step solves the [[Cross]] on the bottom and any first layer corner, forming a "fish" on the bottom layer. This slot is referred to as the Zipper Slot. Technically, the Zipper Slot can be solved at any point during the F2L, such as using [[Multislotting]] to insert the lone corner during the solving of another slot. This is done whenever is easiest during F2L execution.
* '''''F2L:''''' There are three remaining F2L slots to be solved. Typically, this is done using pairs as in CFOP. However, any approach can be taken to solve the cube up to F2L-1 Edge. First Block, carried over from [[Roux]], may be used in conjunction with <RrUM> for the rest of F2L to provide an efficient and rotationless option to finish F2L.
* '''''[[OLLCP]]:''''' This is the first algorithm set of the Zipper Method. There are 331 algorithms to orient the last layer of the cube and permute the remaining corners in an average of 11 moves with as few as 6. Although OLLCP algs are often used as an extension of CFOP, the full set must be used with Zipper in order to guarantee that the corners are permuted. In order to correctly use OLLCP in Zipper, the orientation of the edge in the Zipper Slot must be accounted for. Using a similar recognition style as [[ZZ]], the Zipper Slot is placed in either the FR or BR position. Using this, the edge that belongs in the Zipper Slot is treated as any other LL edge, and the OLLCP alg is executed.
* '''''[[L5EP]]:''''' This step solves the remaining 5 oriented edges of the cube, containing the LL edges and either the FR or BR edge. This step is executed in an average of 10 moves with as few as 6. There are 12 algs for each slot, as well as the 4 standard EPLL algs. This set can be executed using exclusively the <RU> move group, but many of the fastest algs for each case use other move groups.

==Zipper-b==
Instead of OLLCP and L5EP, CFRLL ([[CLL]] without preserving the FR edge) and [[L5E]] can be used to finish the solve. This approach is generally thought of being superior to standard Zipper.

==ZZ-Zipper==
Zipper can also be applied to the [[ZZ method]] by using algorithms that preserve [[EO]].

In an intermediate variant, the last D-layer corner is solved. This is followed by [[COLL]] (algorithms that don't preserve the FR edge but do preserve EO may be used instead) and [[L5EP]].

The most advanced version of this would be to solve the the last five corners in one step using one of 614 [[L5CO]] algorithms (Last 5 Corners with (edge) Orientation).

==External links==
* [https://docs.google.com/spreadsheets/d/1rnTlbYK3nWsFi743198UZMltqU_WtcIIasC_8EGUjhA L5EP algorithms]
* [https://docs.google.com/spreadsheets/d/1UfRh2qMzYRK5TmnN33lrkOtbI818hVltHLPpQs1wqQA L6EP algorithms (includes L5EP)]
* [https://docs.google.com/spreadsheets/d/1VPtGoN_yDoWbBnPVgPWkqlNfj9YjN4LykrpKvUjrw-g CFRLL and L5E algorithms for Zipper-b]
* [https://docs.google.com/spreadsheets/d/1Gixw2F32jmKiPIJIpaY7-6Ionsx1z6iphZdJgBEVTWI Unoptimized L5CO algorithms for ZZ-Zipper]
* [https://sites.google.com/view/zzmethod/solving/variants Explanation of ZZ-Zipper (under "Miscellaneous variants")]

[[Category:3x3x3_speedsolving_methods]]
[[Category:3x3x3_methods]]

Zipper

2020-02-08T09:53:22Z

RedstoneTim: Redirected page to Zipper Method

#REDIRECT [[Zipper Method]]

EOLine

2020-02-08T09:14:15Z

RedstoneTim: Replaced outdated EOCross information with links to EOCross, EOArrow and EODB/Portico

{{Substep Infobox
|name=EOLine
|image=Visualcube_eoline.png
|proposers= [[Zbigniew Zborowski]]
|year=2006
|anames=
|variants= [[Cross]]
|subgroup=
|algs=0
|moves= 6.1 HTM
|purpose=
|previous=[[Scrambled cube state]]
|next=[[EOline cube state]]
}}

The first and most important step of the [[ZZ Method]]. It involves orienting all 12 edges, while simultaneously placing the ''line edges'' (DF and DB). After the [[EO]] part, the cube is reduced to <R, U, L, D, F2, B2>. After placing DB and DF, the cube is reduced to <R, U, L>, meaning it can be solved completely by turning only the R, U and L layers.

== Solving Procedure ==
=== EO Detection ===
Looking at the edges on the U face, D face, F face of the E-slice, and B face of the E-slice:
* If the sticker has L/R color it's a bad edge.
* If the sticker has F/B color, look at the sticker on the other side of the edge.
: * If the side sticker has U/D color, it's a bad edge.

=== Orienting 2 Bad Edges ===
Place one bad edge on F/B using <R, U, L, D, F2, B2> and then do a F/B quarter turn. Repeat with Orienting 4+ bad edges approach.

=== Orienting 4 + Bad Edges ===
Place four bad edges on F/B using <R, U, L, D, F2, B2> and then do a F/B quarter turn. Repeat until there are no more bad edges.

=== Orienting 6 Bad Edges ===
Often, 6 bad edges can be oriented more efficiently by placing 3 bad edges into F/B using <R, U, L, D, F2, B2>, performing an F/B quarter turn, and then using the 4 + approach to correctly orient the remaining 4 bad edges.

=== Solving the Line ===
Place DF and DB in their solved positions using <R, U, L, D, F2, B2>.

== EO+Line ==
In order to improve ease of learning and simplify the planning step, beginners may treat EOLine as two steps - EO+Line. Using this approach only EO is planned during inspection. The solver looks-ahead for the line edges during EO execution to plan for placement of the line. Although sometimes a useful fallback for difficult EOLine cases, EO+Line causes the solver to focus on the line edges during the inital steps, rather than looking ahead for the first 1x2x2 block. This significantly reduces the likelyhood of a smooth transition from EOLine to F2L.

== Other EO steps solving edges ==
Over time lots of viable EOLine variants have been invented. The most significant ones are:
* [[EOCross]], commonly used for two-handed solving (EO and solve DF, DB, DL and DR edges)
* [[EOArrow]], used for two-handed solving, although not as often as [[EOCross]] (EO and solve DF, DB and DL edges)
* EODB, used in the [[Portico]] method (EO and solve DB edge)

More information on these variants can be found on their respective articles.

== External links ==
* [http://cube.crider.co.uk/zz.php?p=eoline EOLine Tutorial] (text based)
* [http://www.youtube.com/watch?v=a6tkUlkjnOE EOLine Tutorial] (youtube)

== See also ==
* [[ZZ Method]]
* [[Edge Orientation]]

[[Category:3x3x3 methods]]
[[Category:3x3x3 speedsolving methods]]
[[Category:3x3x3 first substeps]]

Speedcubing

2020-02-08T09:01:19Z

RedstoneTim: Moved 3x3x3 with feet to previously regulated events

'''Speedcubing''' or '''speedsolving''', sometimes shortened to just '''cubing''', is a sport in which one tries to solve the [[Rubik's cube]] or other [[puzzle]]s, typically either any type of [[twisty puzzle]] or, less frequently, a [[Rubik's Clock]], as fast as possible. There is a wide range of variants to this such as [[Blindsolving]], [[One-Handed Solving|One-Handed solving]] or [[3x3 with feet|Feet solving]]. A person practicing this sport is called a [[speedcuber]]. The administrative body is the [[WCA]].

==Regarding FMC==
While FMC or the [[Fewest Moves Challenge]] is not a contest of the fastest solve, it is still considered by many to be part of the speedcubing sport as it is officially regulated by the [[WCA]] (World Cube Association).

==Regulated events==
*2x2x2 speedsolving
*3x3x3 speedsolving
*4x4x4 speedsolving
*5x5x5 speedsolving
*6x6x6 speedsolving
*7x7x7 speedsolving
*3x3x3 One-handed
*Megaminx
*Pyraminx
*Skewb
*Clock
*3x3x3 Blindfolded
*4x4x4 Blindfolded
*5x5x5 Blindfolded
*3x3x3 Multiple Blindfolded
*3x3x3 FMC

==Previously regulated events==
This is a list of events which the WCA used to hold at competitions and a record of them was kept in the WCA Database but have since been removed.
*Magic
*Master Magic
*3x3x3 with feet

==See also==
*[[Speedsolving methods]]
*[[WCA]]
*[https://www.worldcubeassociation.org/ WCA official website]

[[Category:Terminology]]

EOCross

2020-02-02T16:48:16Z

RedstoneTim: Changed explanation and added some external links

{{Substep Infobox
|name=EOcross
|image=EOcross.png
|proposers=?
|year=?
|anames
|variants=[[EOline]]
|subgroup=
|algs=0
|moves=9
|purpose=
* [[Speedsolving]]
|previous=[[Scrambled cube state]]
|next=[[EOcross cube state]]
}}

EOCross is a variant to [[EOLine]]. In this variant, instead of an EOLine, an EOCross is built, which orients all the edges and permutes the ones on the D-layer (so that a [[Cross]] is formed). This variant makes the move count of [[ZZ]] slightly higher and inspection harder, but at the same time allows for better lookahead, almost no regrips and higher TPS.
It is considered to be superior to [[EOLine]] for two-handed solving by most ZZ solvers.

== External links ==
* [https://sites.google.com/view/zzmethod/solving/advanced?authuser=0#h.p_HXuoi0EvlpP6 ZZ website explaining EOCross in detail]
* YouTube: [https://www.youtube.com/watch?v=rMm3Bs5N01g 6 ZZ method example solves with EOCross]

EOArrow

2020-02-01T16:58:26Z

RedstoneTim: Added a description of EOArrow in a ZZ context

{{Substep Infobox
|name=EOArrow
|image=
<nowiki>
</nowiki>
{{CubeImage
|grey|"#CCCCCC"|grey
|"#CCCCCC"|blue|"#CCCCCC"
|grey|blue|grey
|grey|"#CCCCCC"|grey|grey|white|grey|grey|"#CCCCCC"|grey
|"#CCCCCC"|orange|orange|white|white|"#CCCCCC"|"#CCCCCC"|red|"#CCCCCC"
|grey|"#CCCCCC"|grey|grey|white|grey|grey|"#CCCCCC"|grey
|grey|green|grey
|"#CCCCCC"|green|"#CCCCCC"
|grey|"#CCCCCC"|grey
|grey|"#CCCCCC"|grey
|"#CCCCCC"|yellow|"#CCCCCC"
|grey|"#CCCCCC"|grey
}}
<nowiki>
</nowiki>
|proposers= [[Michael Humuhumunukunukuapua'a]], [[Brayden Mossey]], [[Alex Maass]]
|year=2016
|anames=[[EO Mock Cross]], [[EO Cross-1]]
|variants= [[EOLine]], [[Mock Cross]]
|subgroup=
|algs=0
|moves=
|purpose=
|previous=[[Scrambled cube state]]
|next=[[EOarrow cube state]]
}}

The first step of the [[Hawaiian Kociemba Method]]. It involves orienting all 12 edges, while simultaneously placing the ''arrow edges'' (DL, DF and DB).

After the [[EO]] part, the cube is reduced to <R, U, L, D, F2, B2> . After placing arrow edges, the cube is reduced to <R, U, L>, meaning it can be solved completely by turning only the R, U and L layers. (see also [[EOLine]])

==In ZZ==
In a [[ZZ]] context, EOArrow is a two-handed technique used to solve the first two layers with better ergonomics than [[EOLine]] while still maintaining a lower movecount than [[EOCross]].

In order to achieve this, one must first solve the two [[F2L pair]]s on the left side followed by a block on the right side. (For left-handed people, all of this may be mirrored.)

This approach has the advantages of fewer regrips for the solver's non-dominant hand and less L/R switching.
The block at the end also allows the solver to perform [[blockbuilding]] with less blindspots and better ergonomics (<RU> compared to <RUL>) than [[EOLine]], which in turn allows for lower movecount and higher [[TPS]].

This, however, also has disadvantages because EOArrow isn't as ergonomic as [[EOCross]] and doesn't allow solving the pieces in a different order like [[EOCross]] and [[EOLine]] do, which prevents you from making use of some pre-built pairs/blocks.

[[Category:3x3x3 methods]]
[[Category:3x3x3 first substeps]]

HD Method

2019-12-25T10:30:15Z

RedstoneTim: Changed alg count as it's off by 7 for HD (the 7 OLLs weren't included?) and off by 10 for HD-G (possibly a typo?)

{{Method Infobox
|name=HD
|image=Ss_method.gif
|proposers=V. Higgs, J. Demars
|year=2017
|anames=EG-VOP
|variants=[[VOP]], HD-G
|steps=3, 2 (HD-G)
|algs=59, 51 (HD-G)
|moves= 15-16, ~13.53 (HD-G)
|purpose=
* [[Speedsolving]]
}}

The HD method (short for the Higgs-Demars method, named after its creators) is an intermediate 2x2 method that is similar in speed to CLL. The HD method has three steps:

:1. Solving the V (solving 3/4 of an Ortega face on the D-layer)
:2. LOLS (orienting the remaining 5 corners of the cube)
:3. NLL (solving the rest of the cube in one algorithm)

== The V ==
The V is the first step of the HD method and by far the easiest. For this step you intuitively build 3/4 of a face on the D-layer. The V requires no algorithms and averages about 1.5 moves per solve. The maximum number of moves for a V is 3. Here are [https://docs.google.com/spreadsheets/d/1A1kCVmEEwaXhpZbTkbYLhKRQDmTMSDCKK-tj0QpqvI8/edit#gid=2077631397/ 50 sample V's] provided by Jonathan Lewis.

== LOLS ==
LOLS (short for Lewis Orientation of the Last Slot) is the second step of the HD method and consists of 16 algorithms (plus the 7 well-known OLLs). The aim of this step is to have the u or d-layer color facing up on the remaining five unoriented pieces. The algorithms for this step were created by Jonathan Lewis (also known as Shiv3r) and V. Higgs (also known as Thermex) and the algsheet can be found [https://docs.google.com/spreadsheets/d/1A1kCVmEEwaXhpZbTkbYLhKRQDmTMSDCKK-tj0QpqvI8/edit#gid=670959495/ here]. The average movecount for an LOLS algorithm is about 5.5 moves and many of the algs are under 5 moves.

== NLL ==
NLL (short for Neuro Last Layers) is the last step of the HD method and requires the most algorithms of any step (36). The algorithms permute the V, place the DFR corner in its slot and also permute the u-layer corners. Just like the LOLS step, the unsolved D-layer corner should be held in the DFR position. Most of the [https://docs.google.com/spreadsheets/d/1A1kCVmEEwaXhpZbTkbYLhKRQDmTMSDCKK-tj0QpqvI8/edit#gid=2041376278/ NLL algorithms] were made by Neuro.

== HD-G ==
The HD-G, or HD-Guimond method is a variant of the HD method where the V and CO steps are done simultaneously and (semi) intuitively. This is done similarly to the first step of the [[Guimond Method]], hence the name. The biggest difference is that the last move of the CO case may be changed, or more may be added, to ensure that a V is formed on both opposite faces. This is an advanced variant, and less suitable for beginners.

== Pros ==
*The HD method contains a fairly reasonable number of algorithms; it only has a few more algorithms than CLL and far less than full EG. Plus, many of the algorithms are less than 5 moves, making them effortless to memorize.
*The HD method is pretty easy to one-look (see below) since the V is only 1 or 2 moves on average and the rest of the solve is algorithmic.
*HD has a pretty low movecount, comparable to [[CLL]] and [[EG]].

== Cons ==
*The HD method is very different from most mainstream methods and can be difficult to learn and master for someone transitioning over from a method like [[LBL]] or [[Ortega]].
*Nothing about HD really stands out, and there are other 2x2 methods with less algorithms that can achieve similar movecounts.
*The HD method is still in development, and many algorithms require improvement.

== One-looking ==
One of the main advantages of the HD method is how simple one-looking and two-looking a solve can be. The V can easily be one-looked as it is only one or two moves on average. After that, the solver should be able to see what LOLS case comes after solving the V. If the solver can see this far during inspection they can successfully two-look the solve, leaving only the NLL step, which can either be seen once the V and LOLS cases are executed (two-looking) or during inspection along with the other steps (one-looking). In order to one-look the solver needs to see the permutation of the pieces in the LOLS case and understand how the LOLS cases effect permutation of the pieces. The document showing how permutation is effected during LOLS can be found [https://docs.google.com/spreadsheets/d/1A1kCVmEEwaXhpZbTkbYLhKRQDmTMSDCKK-tj0QpqvI8/edit#gid=2041376278/ here].

== External links ==
*[https://www.speedsolving.com/forum/threads/hd-method-2x2-alternative-to-cll.65442/ HD discussion]

*[https://docs.google.com/document/d/14Er3Jl9AHy4es-6Sz9gU0RYgDmuBR1bFIUN-VThHAwc/edit/ HD method pdf]

*[https://www.speedsolving.com/forum/threads/hd-vs-eg-2x2-method-showdown.67124/ Movecount statistics and comparison to EG]

[[Category:2x2x2]]
[[Category:2x2x2 methods]]
[[Category:2x2x2 speedsolving methods]]