Speedsolving.com Wiki - User contributions [en]

User talk:Stannic

2017-06-20T16:14:04Z

Stannic: /* Re: Links ending with dots */

==Re: Links ending with dots==
Yes they are part of the forum index and I am going to at some point change the linking system though as of late I have not been able to make much progress with it so the dots were just working links atm.[[User:Shadowslice|Shadowslice]] ([[User talk:Shadowslice|talk]]) 13:33, 18 June 2017 (UTC)
: Do you have preference for any specific way to change the linking system? In particular, would you prefer [[CFOP (furum guide)]] or [[Beginner's forum guide/CFOP]] or something else? If we agree on this, maybe I could spend some time renaming pages consistently and linking them together. [[User:Stannic|Stannic]] ([[User talk:Stannic|talk]]) 13:38, 18 June 2017 (UTC)
: I think it would probably be best to with Beginner's forum guide(/index)/CFOP as then someone searching would be able to search "beginner's forum guide" and have the pages pop up [[User:Shadowslice|Shadowslice]] ([[User talk:Shadowslice|talk]]) 14:03, 18 June 2017 (UTC)
:: Well, I'll read though all those pages to make sure I do not miss anything. Then I'll probably just go ahead and rename them (not earlier than a few days later; any suggestions are welcome). One thing to consider is what happens with longer titles; is renaming [[3x3x3 (speed-includes OH and Feet).]] to [[Beginner's forum guide/index/3x3x3 (speed-includes OH and Feet)]] okay? [[User:Stannic|Stannic]] ([[User talk:Stannic|talk]]) 14:16, 18 June 2017 (UTC)
:: Yes that would be great :) [[User:Shadowslice|Shadowslice]] ([[User talk:Shadowslice|talk]]) 14:35, 18 June 2017 (UTC)
::: Done. [[User:Stannic|Stannic]] ([[User talk:Stannic|talk]]) 16:14, 20 June 2017 (UTC)

Beginner's forum guide/index/Petrus

2017-06-20T15:03:51Z

Stannic: /* By Step */ https://www.speedsolving.com/wiki/index.php?oldid=31364

This page is all about Petrus. It is currently categorised by step

==By Step==
* [[Beginner's forum guide/index/Petrus F2L|Petrus F2L]]
* [[Beginner's forum guide/index/ZZLL|ZZLL]]

Beginner's forum guide/index/3x3x3 (speed-includes OH and Feet)

2017-06-20T12:37:34Z

Stannic: + {{Main Article|Beginner's forum guide}}

{{Main Article|Beginner's forum guide}}

This sub-index lists the 3x3x3 speedsolving methods for 2-handed, 1-handed and feet disciplines. As these use basically the same methods they will be listed as one index.



==By Method==
* [[Beginner's forum guide/index/CFOP|CFOP]]
* [[Beginner's forum guide/index/Roux|Roux]]
* [[Beginner's forum guide/index/ZZ|ZZ]]
* [[Beginner's forum guide/index/Petrus|Petrus]]
* [[Beginner's forum guide/index/Other (non-experimental)|Other (non-experimental)]]
* [[Beginner's forum guide/index/Other (experimental)|Other (experimental)]]
* [[Beginner's forum guide/index/LS|LS]] (Last Slot)

==Method evaluation/comparisons==

==Fingertricks==
Or toetricks if you're doing Feet ;)

Template:Main Article

2017-06-20T12:36:57Z

Stannic: use first unnamed parameter if there is no "Article" parameter

{|style="font-family: Tahoma; font-size: 100%; line-height: 100%; border: 1px solid #CCC; border-collapse: collapse;" width="25%" valign="top" cellpadding="6"
| bgcolor="f4f4f4" valign="center" align="center"|''Main Article : [[{{{Article|{{{1|Article}}}}}}]]''
|}

Beginner's forum guide

2017-06-20T12:18:40Z

Stannic: https://www.speedsolving.com/wiki/index.php?oldid=31364

The Speedsolving.com Forum can be a big and confusing place for a newcomer so this is an index which will help a beginner speedcuber to find valuable resources that will help you to improve quickly and expand your knowledge of the cube.

The forum is currently indexed in the following manner: by event (this can be expanded upon)

==By Event==
* [[Beginner's forum guide/index/3x3x3 (speed-includes OH and Feet)|3x3x3 (speed-includes OH and Feet)]]
* [[Beginner's forum guide/index/3x3x3 (Blind)|3x3x3 (Blind)]]
* [[Beginner's forum guide/index/3x3x3 (FMC)|3x3x3 (FMC)]]
* [[Beginner's forum guide/index/2x2x2|2x2x2]]
* [[Beginner's forum guide/index/4x4x4|4x4x4]]
* [[Beginner's forum guide/index/Big Cubes (5x5x5+)|Big Cubes (5x5x5+)]]
* [[Beginner's forum guide/index/Big Cube BLD|Big Cube BLD]]
* [[Beginner's forum guide/index/Skewb|Skewb]]
* [[Beginner's forum guide/index/Square-1|Square-1]]
* [[Beginner's forum guide/index/Megaminx|Megaminx]]
* [[Beginner's forum guide/index/Pyraminx|Pyraminx]]
* [[Beginner's forum guide/index/Other|Other]]

Beginner's forum guide/index/3x3x3 (speed-includes OH and Feet)

2017-06-20T12:17:30Z

Stannic: Stannic moved page Beginner's guide/index/3x3x3 (speed-includes OH and Feet) to Beginner's forum guide/index/3x3x3 (speed-includes OH and Feet): oops

This sub-index lists the 3x3x3 speedsolving methods for 2-handed, 1-handed and feet disciplines. As these use basically the same methods they will be listed as one index.



==By Method==
* [[Beginner's forum guide/index/CFOP|CFOP]]
* [[Beginner's forum guide/index/Roux|Roux]]
* [[Beginner's forum guide/index/ZZ|ZZ]]
* [[Beginner's forum guide/index/Petrus|Petrus]]
* [[Beginner's forum guide/index/Other (non-experimental)|Other (non-experimental)]]
* [[Beginner's forum guide/index/Other (experimental)|Other (experimental)]]
* [[Beginner's forum guide/index/LS|LS]] (Last Slot)

==Method evaluation/comparisons==

==Fingertricks==
Or toetricks if you're doing Feet ;)

Beginner's forum guide/index/3x3x3 (speed-includes OH and Feet)

2017-06-20T12:14:15Z

Stannic: Stannic moved page 3x3x3 (speed-includes OH and Feet). to Beginner's guide/index/3x3x3 (speed-includes OH and Feet): https://www.speedsolving.com/wiki/index.php?oldid=31364

Beginner's forum guide/index/3x3x3 (speed-includes OH and Feet)

2017-06-20T12:04:22Z

Stannic: https://www.speedsolving.com/wiki/index.php?oldid=31364

Beginner's forum guide/index/LS

2017-06-20T11:59:41Z

Stannic: Stannic moved page LS. to Beginner's forum guide/index/LS: https://www.speedsolving.com/wiki/index.php?oldid=31364

This page is all about LS (Last slot techniques). While not technically methods by themselves, they can be used with so many methods and there is such a big variation that they deserve their own page.

==List of Last Slot Techniques==
* [[MGLS]]
* [[ZBLS]]
* [[VHLS]]
* [[EJLS]]
* [[WV]]
* [[SV]]
* [[SLS]]
* [[OLS]]
* [[CLS]]
* [[ELS]]

Beginner's forum guide/index/Other (experimental)

2017-06-20T11:59:01Z

Stannic: Stannic moved page Other (experimental). to Beginner's forum guide/index/Other (experimental): https://www.speedsolving.com/wiki/index.php?oldid=31364

This section is about method which have either been proposed very recently or have simply not been fully checked and developed.

==List of Methods==
* [[PEG]] (Pairs EG)
* [[PORT]] (Pairs Ortega)
* [[Orient First]]
* [[SSC]] (Shadowslice Snow Columns)
* [[RC]] (Ringed Columns)
* [[M-CELL]] (Missing Corner Edge Last Layer)
* [[Briggs Method]]
* [[B2 (Briggs2) Method]]
* [[Triangular Francisco]]
* [[Salvia]]
* [[E15/E35]]
* [[Zagorec Method]]
* [[3CFCEP]]
* [[3CFCE]]
* [[FRED]]

Beginner's forum guide/index/Other (non-experimental)

2017-06-20T11:58:20Z

Stannic: Stannic moved page Other (non-experimental). to Beginner's forum guide/index/Other (non-experimental): https://www.speedsolving.com/wiki/index.php?oldid=31364

This page is about methods which, while having been tested and checked, are not very commonly used when compared to "the big 4" of CFOP, Roux, ZZ and Petrus.

==List of Methods==
* [[Heise]] (and Speedheise)
* [[ZB]]
* [[PCMS]]
* [[Belt Method]] (also known as the ring or equator method)
* [[Snyder]]
* [[Waterman]]
* [[RICE]]
* [[Human Thistlethwaite Algorithm]]
* [[L2L]]
* [[Tripod]]
* [[Hahn]]
* [[LBL]], the most common beginner method
* [[Corners First]]
* [[CFCE]]
* [[Fail Method]]

These methods do not have their specific threads as such as many were established before the creations of the forums and were not popular enough to warrant their thread. There are some external links which may be useful though, especially for the Heise and ZB methods.

Beginner's forum guide/index/Petrus

2017-06-20T11:57:42Z

Stannic: Stannic moved page Petrus. to Beginner's forum guide/index/Petrus: https://www.speedsolving.com/wiki/index.php?oldid=31364

This page is all about Petrus. It is currently categorised by step

==By Step==
* [[Petrus F2L.]]
* [[ZZLL.]]

Beginner's forum guide/index/ZZ

2017-06-20T11:57:08Z

Stannic: Stannic moved page ZZ. to Beginner's forum guide/index/ZZ: https://www.speedsolving.com/wiki/index.php?oldid=31364

This page about [[ZZ]].
==Eoline==
Tutorials
*[https://www.speedsolving.com/forum/showthread.php?32650-ZZ-Edge-Orientation-Video-Tutorial Eo tutorial (video)]
*[https://www.speedsolving.com/forum/showthread.php?35856-Help-thread-ZZ-method-EOLine ZZ/EoLine discussion]
==ZZF2L==
Guides
*[https://www.speedsolving.com/forum/threads/zzf2l-openslotting-algorithms.22882/ Open slotting algorithms]
==ZZLL==
Guides
*General
** [https://www.speedsolving.com/forum/showthread.php?37796-ZBLL-discussion ZBLL discussion and help]
** [https://www.speedsolving.com/forum/showthread.php?55970-Learning-Full-ZBLL-My-Journey Thread detailing forum member's (as yet unfinished) journey to learning full ZBLL]
** [https://www.speedsolving.com/forum/showthread.php?53643-Interested-in-ZBLL-ZB-masterclass-at-Nats-2015 ZBLL seminar for US Nationals 2015]
** [https://www.speedsolving.com/forum/showthread.php?57226-COLL-Recognition-Help COLL help and discussion]
** [https://www.speedsolving.com/forum/showthread.php?693-Algorithm-Memorization-Discussion Algorithm memorisation]
** [https://www.speedsolving.com/forum/showthread.php?56617-Some-U-ZBLL-tutorials U ZBLL]
** [https://www.speedsolving.com/forum/showthread.php?16598-Video-Semi-intuitive-H-subset-ZBLL-Tutorial Semi-intuitive H ZBLL]
*Other Variants
** [https://www.speedsolving.com/forum/showthread.php?60281-A-Novel-ZZ-Variant-with-a-1LLL-72-cases-and-easy-recognition ZZ-HW]
** [https://www.speedsolving.com/forum/showthread.php?56421-Chris-Tran-Last-Slot-(CTLS)-Recognition-System Chris Tran Last Slot (CTLS) recognition system] (1-look LS+LL)
** [https://www.speedsolving.com/forum/showthread.php?43236-New-Approach-to-ZZ-d ZZ-D] (a new approach)
** [https://www.speedsolving.com/forum/showthread.php?45230-Proposed-ZZLS-and-VIM! ZZLS and VIM]
** [https://www.speedsolving.com/forum/showthread.php?14501-Phasing-Explained-(ZZ-b) Phasing (ZZ-B)]
*Algorithm lists
** [https://www.speedsolving.com/forum/showthread.php?49936-My-Full-ZBLL-List Full ZBLL 1]
** [https://www.speedsolving.com/forum/showthread.php?55518-BindeDSA-s-Algorithms BindeDSA's Algorithms] (includes ZBLL)
Discussions
* [https://www.speedsolving.com/forum/showthread.php?37796-ZBLL-discussion ZBLL discussion and help]** [https://www.speedsolving.com/forum/showthread.php?55991-The-Efficacy-of-ZBLL-on-Averages Discussion on how full ZBLL affects average times]
* [https://www.speedsolving.com/forum/showthread.php?55409-ZBLL-vs-OLL-and-PLL-Time-Comparison ZBLL vs OLL/PLL time comparison]
* [https://www.speedsolving.com/forum/showthread.php?5180-ZZ-speedcubing-method Original post and description of the ZZ method on Speedsolving.com]

==Discussion/ Question threads==
[https://www.speedsolving.com/forum/showthread.php?20834-ZZ-and-ZB-Discussion ZZ and ZB disscussion and help]

Beginner's forum guide/index/Roux

2017-06-20T11:56:24Z

Stannic: Stannic moved page Roux. to Beginner's forum guide/index/Roux: https://www.speedsolving.com/wiki/index.php?oldid=31364

This page is about [[Roux]].

==[[F2B]] (first two blocks)==
Guides
* [https://www.speedsolving.com/forum/showthread.php?50540-Transitioning-from-CFOP-to-Roux-Second-Block.php CFOP to Roux transition: Second block]

==[[CMLL]] (Corners Minus Last Layer)==

==[[LSE]] (Last Six Edges)==
*Guides
** [https://www.speedsolving.com/forum/showthread.php?50718-BU-method-in-step-4c-(Roux).php BU recognition method]
** [https://www.speedsolving.com/forum/showthread.php?38176-Roux-Misoriented-Centers-Table.php Misoriented centres table]
** [https://www.speedsolving.com/forum/showthread.php?41829-CheescakeCuber-s-Roux-Steps-4b-4c-Alternative.php CheesecakeCuber's LSE]
** [https://www.speedsolving.com/forum/showthread.php?50819-How-to-read-a-Roux-corners-table.php Reading Roux corners tables]
** [https://www.speedsolving.com/forum/showthread.php?35350-Roux-4b-to-4c-Transition.php Transition from 4b to 4c (Last 4 edge prediction)]
** [https://www.speedsolving.com/forum/showthread.php?54397-Sandwich-3x3-applications-to-Roux-style-L5E-and-L3E.php Applications of the Sandwich method in Roux]

*Dicussions
** [https://www.speedsolving.com/forum/showthread.php?54418-Alternating-Hands-VS-Same-Hand-M-Slice.php Alternating hands VS. Same hand for M-slice]

==Full Tutorial/reconstructions (All steps)==
* [https://www.speedsolving.com/forum/showthread.php?11506-Waffle-s-Roux-Tutorial.php Waffle's Roux tutorial]
* [https://www.speedsolving.com/forum/showthread.php?47512-Video-Roux-Walkthrough-Solves.php Walkthrough solves (video)]
* [https://www.speedsolving.com/forum/showthread.php?44672-3x3-Roux-example-solves-w-reconstructions.php Example solves with reconstructions]
* [https://www.speedsolving.com/forum/showthread.php?44347-Advanced-Roux-Tutorial.php Kirjava's Roux tutorial]
* [https://www.speedsolving.com/forum/showthread.php?41011-Video-Arvind-s-Roux-Method-Tutorial!.php Arvind's Roux tutorial]
* [https://www.speedsolving.com/forum/showthread.php?40797-A-Roux-guide-for-beginners Beginner's Roux guide (1)]
* [https://www.speedsolving.com/forum/showthread.php?39554-Roux-Tutorial-For-Chinese-Cuber-(Still-Updating).php Chinese Roux tutorial]
* [https://www.speedsolving.com/forum/showthread.php?40216-Video-How-to-Roux-with-Justin-Harder.php Justin Harder's Roux tutorial]
* [https://www.speedsolving.com/forum/showthread.php?38684-5BLD-and-PandaCuber-s-Roux-tutorial.php 5BLD and PandaCuber's Roux tutorial]
* [https://www.speedsolving.com/forum/showthread.php?38935-Roux-Tutorial-Video.php Roux tutorial (video)]
* [https://www.speedsolving.com/forum/showthread.php?37810-video-Look-out-Roux-s-about.php Cube-Fu's Roux tutorial (video)]
* [https://www.speedsolving.com/forum/showthread.php?56813-Roux-Tips-and-Tricks-Playlist GuRoux and PDF's Roux tutorial] (video series)

==Discussions/Questions==
* [https://www.speedsolving.com/forum/showthread.php?51553-One-Answer-3x3-Roux-Question.php One-Question Answer Roux thread]
* [https://www.speedsolving.com/forum/showthread.php?3842-Roux-Help-and-Discussion-thread.php Roux help and discussion thread]

Beginner's forum guide/index/CFOP

2017-06-20T11:54:44Z

Stannic: Stannic moved page CFOP. to Beginner's forum guide/index/CFOP: https://www.speedsolving.com/wiki/index.php?oldid=31364

This page is all about [[CFOP]]
==General==
[https://www.speedsolving.com/forum/showthread.php?50661-How-to-practice-individual-CFOP-steps Practising individual steps]

==[[LL]]==
[[PLL]]
*Guides
**[https://www.speedsolving.com/forum/showthread.php?41108-Two-sided-PLL-recognition-guide Two sided PLL recognition]
**[https://www.speedsolving.com/forum/showthread.php?47674-New-2-Sided-PLL-Recognition-Guide Two sided PLL recognition (2)]
**[https://www.speedsolving.com/forum/showthread.php?48651-CFOP-Last-Layer-Guide Full LL guide]
**[https://www.speedsolving.com/forum/showthread.php?52299-Full-PLL-Guide Full PLL guide]
**[https://www.speedsolving.com/forum/showthread.php?51987-All-the-PLLs-I-use-7-3x3-Walkthrough PLL alg set]
**[https://www.speedsolving.com/forum/showthread.php?54625-2-look-pll 2-look PLL]
**[https://www.speedsolving.com/forum/showthread.php?53104-Predicting-PLL-before-while-solving-OLL PLL prediction]
[[OLL]]
*Guides
**[https://www.speedsolving.com/forum/showthread.php?48179-video-Full-OLL-Tutorial-Series Full OLL tutorial]
**[https://www.speedsolving.com/forum/showthread.php?51629-Interactive-2-Look-and-Full-OLL-Guide 2-look and 1-look OLL]
**[https://www.speedsolving.com/forum/showthread.php?49501-OLL-Sheet OLL Alg Sheet]
**[https://www.speedsolving.com/forum/showthread.php?49724-Tips-to-learn-Full-OLL-in-1-3-days Speed learning OLL]
**[https://www.speedsolving.com/forum/showthread.php?49792-video-Easy-PLL-Skip-Cases-for-OLL PLL Skip OLL cases]
**[https://www.speedsolving.com/forum/showthread.php?53104-Predicting-PLL-before-while-solving-OLL Predicting PLL]
**[https://www.speedsolving.com/forum/showthread.php?41380-When-and-how-to-move-from-2-look-to-1-look-OLL Transition between 2-look and 1-look OLL]
Full LL
*Guides
**[https://www.speedsolving.com/forum/showthread.php?48651-CFOP-Last-Layer-Guide Full LL guide]
==[[F2L]]==
Guides
*[https://www.speedsolving.com/forum/showthread.php?47848-Algorithmic-F2L-Guide Algorithmic F2L]
*[https://www.speedsolving.com/forum/showthread.php?48182-Series-How-to-Get-Faster-at-F2L Getting faster]
*[https://www.speedsolving.com/forum/showthread.php?48767-Video-Easy-F2L-Cases Easy F2L alg cases]
*[https://www.speedsolving.com/forum/showthread.php?15213-Fridrich-F2L-Going-Slow-and-Looking-Ahead-(Tutorial) Lookahead in F2L]
*[https://www.speedsolving.com/forum/showthread.php?47650-Easy-to-follow-beginners-intuitive-F2L-tutorial-video Intuitive Beginner's F2L]
*[https://www.speedsolving.com/forum/showthread.php?43416-Video-Expert-F2L-(Russian)-by-Viktor-Danilov Expert F2L walkthroughs]
*[https://www.speedsolving.com/forum/showthread.php?54001-Intermediate-F2L Intermediate F2L]
*[https://www.speedsolving.com/forum/showthread.php?33035-Improve-Your-F2L-Look-Ahead-With-Turbo-Tracking Turbo Tracking for lookahead]
*[https://www.speedsolving.com/forum/showthread.php?54014-Beginners-F2L-3-easy-steps-for-every-case Easy steps for all F2L]
*[https://www.speedsolving.com/forum/showthread.php?53929-Advanced-F2L-Series-FailStoner Advanced F2L tutorial (FailStoner)]
*[https://www.speedsolving.com/forum/showthread.php?50816-Intuitive-F2L-Tutorial-for-Beginners! Intuitive beginner's F2L (2)]
Discussions
*[https://www.speedsolving.com/forum/showthread.php?9318-F2L-Intuitive-vs-Algorithm-Solving Intuitive vs Algorithmic F2L]
*[https://www.speedsolving.com/forum/showthread.php?813-Help-thread-F2L-Tips-and-Discussion-Thread F2L tips and discussion]

==[[Cross]]==
*[https://www.speedsolving.com/forum/showthread.php?2522-Cross-Help-Thread Cross help and discussion]

User talk:Stannic

2017-06-18T14:16:24Z

Stannic: /* Re: Links ending with dots */

Heise blocks

2017-06-18T14:04:52Z

Stannic: + Category:3x3x3 first substeps

{{Substep Infobox
|name=Heise blocks
|image=Heise method.gif
|proposers=[[Ryan Heise]]
|year=2003
|anames=
|variants=
|subgroup=
|algs=intuitive
|moves=
|purpose=
* [[Speedsolving]], [[FMC]]
|previous=[[Scrambled cube state]]
|next=[[Heise blocks cube state]]
}}

The '''Heise blocks''' is the first [[step]] for some cubing methods on [[3x3x3]], especially the '''[[Heise Method]]''', invented by [[Ryan Heise]], which is a intuitive [[method]] which requires no [[algorithm]]s. It uses extremely few moves, but it may be difficult to get fast times using this method. The step consists in creating four 1x2x2 [[block]]s, making sure that one color appears on none of the blocks. This color will be the color of the [[last layer]]. Note that these blocks do not necessarily have to be paired together when they are built. One of these blocks should be just two [[center]]s and an [[edge]].

== See also ==
* [[Heise blocks cube state]]
* [[Scrambled cube state]]
* [[Heise Method]]

[[Category:3x3x3 first substeps]]

User talk:Stannic

2017-06-18T13:38:38Z

Stannic: /* Re: Links ending with dots */

==Re: Links ending with dots==
Yes they are part of the forum index and I am going to at some point change the linking system though as of late I have not been able to make much progress with it so the dots were just working links atm.
: Do you have preference for any specific way to change the linking system? In particular, would you prefer [[CFOP (furum guide)]] or [[Beginner's forum guide/CFOP]] or something else? If we agree on this, maybe I could spend some time renaming pages consistently and linking them together. [[User:Stannic|Stannic]] ([[User talk:Stannic|talk]]) 13:38, 18 June 2017 (UTC)

Rubik's cube (puzzle type)

2017-06-18T13:28:46Z

Stannic: /* See Also */ + Rubik's Cube Fact sheet

{{Puzzle Infobox|
|NAME=Rubik's Cube
|IMAGE=Roux solved.jpg
|ALTERNATIVENAMES=Regular cube, 3x3x3, 3x3
|SHAPE=Cube
|MECHANISM=3x3x3
|INVENTOR=Erno Rubik
|YEAR=1974
|COMPANIES= [[Rubik's Brand]]}}

''This page is about the [[puzzle]]. For the Rubik's Brand 3x3x3 Cube, see [[Rubik's Brand Cube]].''

The '''Rubik's cube''' (also known as the '''3x3x3 cube''', and normally referred to in the cubing community as the '''3x3x3''' or '''3x3''') is a twistable [[puzzle]] in the shape of a cube that is cut two times along each of three axes. It is said to be the best-selling toy in history, with well over 300 million cubes sold, and because of this popularity it is the most commonly practiced cube in [[speedsolving]]. The most popular brand is [[Rubik's Brand Cube]], which was first patented by [[Erno Rubik]] in 1975, and which began being produced on a wide scale in the early 1980s. From around 2007 the cubing community has seen the development of speedcubes made in China.

This puzzle has 6 fixed [[center]]s, 12 [[edge]]s, and 8 [[corner]]s, and a total of 43,252,003,274,489,856,000 (or 4.3 x 10^19) positions. It has been proven that every position can be solved in 20 or fewer moves.

== See Also ==
* [[3x3x3 speedsolving methods]]
* [[Rubik's Brand Cube]]
* [[3x3x3 notation]]
* [[World Record | World Records]]
* [[Rubik's Cube Fact sheet]]

== External Links ==
* [http://en.wikipedia.org/wiki/Rubik's_Cube The Wikipedia article]

{{Regularcubics}}
{{Cubics}}

[[Category:Twisty puzzles]]
[[Category:Twisty puzzles used in WCA-official events]]

User talk:Shadowslice

2017-06-18T12:55:21Z

Stannic: /* Titles ending with dots. */ new section

I apologize for deleting those pages. Because of this event I will make sure to back up any pages that I may delete in the future. Unfortunately I do not have the power to recover deleted pages, so I can't do anything to fully recover them. But, if you can get in touch with anyone on [https://www.speedsolving.com/wiki/index.php?title=Special:ListUsers&group=sysop this list] they will be able to bring those pages back. Is there anything I could do to help with recreating those pages?
-Bryce Springfield

== Links not working ==
In response to [https://www.speedsolving.com/forum/showthread.php?15298-Wiki-Discussion-Thread&p=1101386#post1101386]. On the [[ringed columns]] article, one of your links is for a page called "The Meyer Method". That article doesn't exist; the correct one is [[Meyer method]]. Is that your question? [[User:Randomno|Randomno]] <nowiki>[</nowiki>[[User talk:Randomno|talk]]<nowiki>]</nowiki> 21:26, 18 July 2015 (UTC)

== SCOPE method ==

Hi, where else is that Sq1 method called SCOPE? Everyone calls it Vandenbergh. [[User:Randomno|Randomno]] <nowiki>[</nowiki>[[User talk:Randomno|talk]]<nowiki>]</nowiki> 19:36, 24 July 2015 (UTC)

== Titles ending with dots. ==

Hello Shadowslice, I noticed some wikilinks and pages with titles ending with dots. I saw [https://www.speedsolving.com/wiki/index.php?oldid=27295] but wanted to make sure I understand the idea. Does the dot at the end of the title ''mean'' that the page is part of [[Beginner's forum guide|the index to the forums]]? If so, my suggestion is to name these pages e.g. [[CFOP (forum guide)]] instead of [[CFOP.]] (Another possibility is [[Beginner's forum guide/CFOP]], as suggested by [[User:Randomno|Randomno]]). The reason is that when I see a page with title [[CFOP.]], it is not immediately obvious ''why'' the dot is there. I think something like [[CFOP (forum guide)]] would be clearer. What do you think on this? [[User:Stannic|Stannic]] ([[User talk:Stannic|talk]]) 12:55, 18 June 2017 (UTC)

Thistlethwaite's algorithm

2017-06-18T12:23:45Z

Stannic: /* Steps */ will need a page Square group (Singmaster 1981, p.18), aka Square subgroup, Squares subgroup

{{Method Infobox
|name=Thistlethwaite
|image=Thistlethwaite.gif
|proposers=[[Morwen Thistlethwaite]]
|year=1981
|anames
|variants=[[Human Thistlethwaite]]
|steps=4
|moves=45
|purpose=
* [[Computer Algorithm]]
}}
A computer cube solving algorithm, based on reducing the cube to subgroups.

==Steps==
# Reduction to <U,D,L,R,F2,B2>
#* [[Edge Orientation]]
# Reduction to <U,D,L2,R2,F2,B2>
#* placement of U/D edges in U/D faces
#* [[Corner Orientation]], and placement
# Reduction to [[Square group|<U2,D2,L2,R2,F2,B2>]]
#* Corners
#* Edges
# Final Solve Permutation of all pieces using only 180 degree faces turns

== See also ==
* [[Human Thistlethwaite]]
* [[Kociemba]]
* [[God's Algorithm]]
* [[Puzzle theory]]
* [[Rubik's Cube Group]]

[[Category:Computer algorithms]]

== External links==
* [http://www.jaapsch.net/puzzles/thistle.htm Jaap's Thistlethwaite page]
* Wikipedia: [http://en.wikipedia.org/wiki/Morwen_Thistlethwaite Morwen Thistlethwaite]

Category:Puzzle theory

2017-06-18T12:15:33Z

Stannic: /* External Links */ links to the forum

Theory relating to the Rubik's cube and other puzzles

== Links ==
* [https://www.jaapsch.net/puzzles/theory.htm Jaap's Theory Page]
* [//www.speedsolving.com/forum/forums/puzzle-theory.27/ Puzzle theory] subforum on [[Speedsolving Forums]]
* [//www.speedsolving.com/forum/threads/one-answer-puzzle-theory-question-thread.56699/ One-Answer Puzzle Theory Question Thread]

[[Category:Concepts and knowledge]]

Kociemba's Algorithm

2017-06-18T12:01:24Z

Stannic: make the wikilink text match the target; rm repeated wikilinks; https

A computer algorithm for solving the 3x3x3 cube, created by [[Herbert Kociemba]]. It is similar to the [[Thistlethwaite's algorithm]] though with fewer steps thanks to the improvement of computer memory storage and processing speed.

==Two Phase Approach==
Let's ignore group theory and use the first two layers as an analogy.

'''Two-Phase'''

The core of the 2-phase approach is this:
*Solve the cube into a state with a certain property.
*Solve the rest of the cube.

If we select F2L as our property, we get:
*Solve the first two layers.
*Solve the last layer.
**If you solve F2L with the fewest moves possible, then solve the resulting LL case optimally, you'll end up with a decently short solution. However, there might be a shorter solution: in that case, the first phase might take more moves, but get us an easy LL case (or an LL skip!).

Iterative Deepening (for Phase 1)
*Let's say our first solution took 15 moves for F2L and 11 moves for LL. That means that our cube takes at most 15 + 11 = 26 moves to solve.
*So let's try looking at all the solutions that take 15 moves for F2L. If any of them give us an LL that takes fewer than 11 moves, we can find a shorter solution. In fact, we can extend this and keep looking. Here's our plan:
**Try all the solutions that take 15 moves for F2L and fewer than 26 - 15 = 11 moves for LL.
**Try all the solutions that take 16 moves for F2L and fewer than 26 - 16 = 10 moves for LL.
**Try all the solutions that take 17 moves for F2L and fewer than 26 - 17 = 9 moves for LL.
**...
**Try all the solutions that take 25 moves for F2L and fewer than 26 - 25 = 1 moves for LL.
**Try all the solutions that take 26 moves for F2L and fewer than 26 - 26 = 0 moves for LL.

If there is a solution that takes fewer than 26 moves for the entire cube, F2L clearly has to be finished in at most 26 moves. Therefore, our optimal overall solution has to be in one of these cases.

Now let's say that along the way we find a solution that takes 17 moves for F2L and 8 moves for LL. Now we know that the entire cube can be solved in 17 + 8 = 25 moves. We abort the original 26-plan and continue our search wtih a new upper bound:
*Try all the solutions that take 17 moves for F2L and fewer than 25 - 17 = 8 moves for LL.
*Try all the solutions that take 18 moves for F2L and fewer than 25 - 18 = 7 moves for LL.
*...
*Try all the solutions that take 25 moves for F2L and fewer than 25 - 25 = 0 moves for LL.
If we keep going, we reach a point where any solution we haven't considered must be longer than the one we have -- so our solution is optimal.
For 3x3x3, we happen to know that the optimal solution must be at most 20 moves... but that's only because we know God's number. The approach works even if we don't know God's number (so can be used for any twisty puzzle).

==The Domino Phase (a.k.a. Group Theory is Awesome)==

Of course, Kociemba's Algorithm doesn't solve F2L first. Once you've solved F2L, you can only do U moves without breaking up your progress, which is counterproductive.

Instead, Kociemba gets the cube into one of the states in "G1", which means it has the following properties:
*All the corners are oriented (like in 3OP).
*All the edges are oriented (like in 3OP).
*All the middle layer edges are already in the middle layer.
From there, you can solve the cube by using only <U, D, F2, B2, R2, L2>. That is, you can basically pretend it's a 3x3x2 domino. (Try it!) (Aside: This means that you've put the cube into a subgroup which is its own puzzle.)
*The nice thing about this is that once the cube is in the G1/Domino, you can search for an optimal Domino solution.
*More importantly, every cube solution ends with some number of domino moves. That number might be 0, but there's a good chance that there is some optimal solution that uses a few. This means we can run the two-phase search similar to before, except we can restrict ourselves to a domino search in the second half.

There are a lots of details, including:

*Solving a cube into G1 is about as hard as solving the rest. This means that both parts of the search take roughly the same time. (If we tried to find an optimal solution using the F2L approach, we would have to spend way more time trying to solve F2L than a computer could ever handle. There are very few cube states where it's possible to find an optimal solution where F2L is solved early.)
*Since G1 is a group, there is a lot of symmetry in the search. This speeds things up by allowing you to search multiple things at once.
*You can take lots of shortcuts. Let's say you already have a solution of 26 moves, and are considering a solution that has taken 18 moves already. If you know that it takes at least 10 more moves to solve the corners, then you can stop searching for that solution. There are efficient ways to do this by using prune tables. The symmetry of G1 also allows these prune tables to be very efficient.
*If you run Kociemba for a short while, you can get a pretty short solution. If you run it for longer, you will quickly get some better solutions, and after a while verify the optimal solution. The choice of G1 really helps with this.
*Solvers for other puzzles usually use a similar approach, except they use more phases. This WCA scrambler for 4x4x4 uses 4 phases to generate a scramble for a random state (but it doesn't continue to find an optimal solution).
*Instead of iterative deepening, Kociemba implementations usually use IDA*, which is iterative deepening combined with a heuristic. Instead of going through the solutions blindly, the algorithm tries to go down path that look like they might have a shorter solution. This helps find shorter solutions earlier, which cuts down on the additional searching.

==Example Reconstruction==

Look at the reconstruction of Mats Valk's 5.55 WR. The scramble is:

D2 U' R2 U F2 D2 U' R2 U' B' L2 R' B' D2 U B2 L' D' R2

Notice that the first half uses only <U, D, F2, B2, R2, L2>. This is because TNoodle uses Shuang Chen's min2phase to do the following:

*Generate a random state.
*Solve the state using Kociemba.
*Invert the solution to get a scramble for the state.

The last half of the solution becomes the first half of the scramble, which is why the initial moves are in G1. And you can see that G1 is about half of the scramble (9 out of 19 moves).

== See also ==
* [[Cube Explorer]]
* [[SSC (Shadowslice Snow Columns)]]
* [[Human Thistlethwaite Algorithm]]

== External links ==
* [https://en.wikipedia.org/wiki/Optimal_solutions_for_Rubik%27s_Cube#Kociemba.27s_Algorithm Section on Wikipedia article]
* [http://kociemba.org/cube.htm Cube Explorer Website]
* [https://www.jaapsch.net/puzzles/compcube.htm#kocal Jaap's Computer Puzzling Page]

==Notes==
* With thanks and all credit for the description and example solves to [[Lucas Garron]]

[[Category:Computer algorithms]]

Thistlethwaite Algorithm

2017-06-18T11:56:37Z

Stannic: fix redirect

#REDIRECT [[Thistlethwaite's algorithm]]

Human Thistlethwaite Algorithm

2017-06-18T11:54:55Z

Stannic: fix wikilinks; remove repeated wikilinks; http(s)-preserving internal links; will need a page Square group (Singmaster 1981, p.18)

{{Method Infobox
|name=Human Thistlethwaite
|image=Thistlethwaite.gif
|proposers=[[Morwen Thistlethwaite]] [[Ryan Heise]]
|year=2002
|anames=HTA
|variants=[[Thistlethwaite Algorithm]]
|steps=4
|algs=Advanced method: Hundreds, Basic method: 3
|moves=Advanced method: 45.7, Basic method: ~100
|purpose=
* [[Fewest Moves]]
}}

The '''Human Thistlethwaite Algorithm''' (abbreviated to '''HTA''') is a human-usable version, proposed by [[Ryan Heise]], of the [[Thistlethwaite's algorithm]]. The solution is broken down into exactly the same basic steps of the computer Thistlethwaite algorithm, but each step in the human version is broken down into further sub-steps to make it managable for a human solver. The system proceeds as follows:

# Reduction to <U,D,L,R,F2,B2>
#* [[Edge Orientation]]
# Reduction to <U,D,L2,R2,F2,B2>
#* placement of U/D edges in U/D faces
#* [[Corner Orientation]], and placement
# Reduction to [[Square group|<U2,D2,L2,R2,F2,B2>]]
#* Corners
#* Edges
# Final Solve Permutation of all pieces using only 180 degree faces turns

== See also ==
* [[:Category:Computer algorithms]]
* [[Orient First]]
* [[SSC (Shadowslice Snow Columns)|SSC]]

== External links ==
* [http://www.ryanheise.com/cube/human_thistlethwaite_algorithm.html Ryan Heise's Thistlethwaite Tutorial]
* YouTube: [http://www.youtube.com/watch?v=xw5luzfkO48 Human Thistlethwaite Algorithm Rubik's Cube Tutorial]
* SpeedSolving.com: [//www.speedsolving.com/forum/showthread.php?24355-Human-Thistlethwaite-Help-Discussion Human Thistlethwaite Help/Discussion]

[[Category:3x3x3 methods]]
[[Category:Experimental methods]]

Thistlethwaite's algorithm

2017-06-18T11:41:59Z

Stannic: Stannic moved page Thistlethwaite to Thistlethwaite's algorithm: Thistlethwaite is a mathematician but the article is about the algorithm

{{Method Infobox
|name=Thistlethwaite
|image=Thistlethwaite.gif
|proposers=[[Morwen Thistlethwaite]]
|year=1981
|anames
|variants=[[Human Thistlethwaite]]
|steps=4
|moves=45
|purpose=
* [[Computer Algorithm]]
}}
A computer cube solving algorithm, based on reducing the cube to subgroups.

==Steps==
# Reduction to <U,D,L,R,F2,B2>
#* [[Edge Orientation]]
# Reduction to <U,D,L2,R2,F2,B2>
#* placement of U/D edges in U/D faces
#* [[Corner Orientation]], and placement
# Reduction to <U2,D2,L2,R2,F2,B2>
#* Corners
#* Edges
# Final Solve Permutation of all pieces using only 180 degree faces turns

== See also ==
* [[Human Thistlethwaite]]
* [[Kociemba]]
* [[God's Algorithm]]
* [[Puzzle theory]]
* [[Rubik's Cube Group]]

[[Category:Computer algorithms]]

== External links==
* [http://www.jaapsch.net/puzzles/thistle.htm Jaap's Thistlethwaite page]
* Wikipedia: [http://en.wikipedia.org/wiki/Morwen_Thistlethwaite Morwen Thistlethwaite]

Orbit

2017-06-16T20:07:37Z

Stannic: Linked to Dan Hoey's message about another meaning of 'orbit'. Probably need to write something about this here.

The '''orbit''' of a piece is the set of all positions where it can be sent to by normal [[turn]]s of the [[puzzle]] (not allowing [[cube rotations]]). This is distinct from the set of positions with similar-looking pieces - in some puzzles, it is not immediately obvious where a piece can be moved to.

The cube term is an application of [https://en.wikipedia.org/wiki/Group_action#Orbits_and_stabilizers the definition of "orbit" in group theory].

== Examples ==

A simple example is the orbits of an [[edge]] on the [[3x3x3]]. A given edge can be placed in any of the 12 edge spots, with 2 orientations for each one, so there are 24 elements in the orbit.

There are also some cases where pieces look similar but do not actually belong to the same orbit. One example is the [[oblique]] pieces on a [[6x6x6]]. There are 48 obliques, but they are actually in two separate orbits of 24 pieces each, and pieces from one group can't move to the other position.

== Maximum Size ==

In a standard twisty puzzle (such as a 3x3x3 or a [[Pyraminx]]), the whole puzzle obeys a specific kind of symmetry called Polyhedral symmetry (see [http://en.wikipedia.org/wiki/Polyhedral_symmetry Wikipedia]) which limits the number of positions that can be in a single orbit. For tetrahedral puzzles like the Pyraminx, an orbit can have at most 12 positions; for cubical or octahedral puzzles like the 3x3x3, an orbit can have at most 24 positions; and for dodecahedral or icosahedral puzzles like the [[Megaminx]], an orbit can have at most 60 positions.

== Use in BLD Solving ==

[[Blindfolded Solving|Blindfold solving]] is in most cases based around solving pieces in [[cycle]]s - moving a small number of pieces to each others' places without affecting the rest of the puzzle. When the puzzle is solved, each piece has to end up somewhere else in the same orbit. This means that when memorizing the position of a puzzle you can consider each orbit separately, and determine the cycles of pieces within one orbit before even looking at the next one. This fact, combined with the maximum size of an orbit, means that every piece on even the largest [[Big cube|NxNxN]] cube can only be in one of 24 places, so we can memorize each piece by a single letter for any size of cube. Thus the same kinds of memory techniques can be used on any size of cube, and the biggest difference between different sizes is the amount of information.

== Further links ==
* ([[Cube Lovers]]) [http://www.math.rwth-aachen.de/~Martin.Schoenert/Cube-Lovers/Dan_Hoey__Re__A_essay_on_the_NxNxN_Cube___counting_positions_and_solving_it_(2).html Orbits of pieces vs orbits of configurations]

[[Category:Puzzle theory]]

RLS (disambiguation)

2017-06-16T13:48:10Z

Stannic: + Category:Acronyms

'''RLS''', an abbreviation for '''Rowe Last Slot''', may refer to:

* [[HLS]]
* [[VLS]]

[[Category:Acronyms]]

Lists of national records

2017-06-16T13:42:31Z

Stannic: + Category:Lists

* [[Lists of Belgian national records]]
* [[List of France national records]]

[[Category:Lists]]

Lists of Belgian national records

2017-06-16T13:41:48Z

Stannic: + Category:Lists

These pages contain lists of [[WCA]] Belgian National Records. Information such as results, record setters, and competition names are given, along with videos, discussion threads, and reconstructions when available. The WCA database also keeps a list of records, located [http://www.worldcubeassociation.org/results/regions.php?regionId=&eventId=&years=&history=History here]. You can find some other official and unofficial record statistics at [http://www.recordholders.org/en/list/rubik.html http://www.recordholders.org/en/list/rubik.html].

== Current and historical World Records ==

The following events are currently tracked by the WCA:
* [[List of Belgain Records/3x3x3|Rubik's Cube]]
* [[List of Belgain Records/4x4x4|4x4 Cube]]
* [[List of Belgain Records/5x5x5|5x5 Cube]]
* [[List of Belgain Records/2x2x2|2x2 Cube]]
* [[List of Belgain Records/3BLD|3x3 blindfolded]]
* [[List of Belgain Records/3OH|3x3 one-handed]]
* [[List of Belgain Records/3FM|3x3 fewest moves]]
* [[List of Belgain Records/Feet|3x3 with feet]]
* [[List of Belgain Records/Megaminx|Megaminx]]
* [[List of Belgain Records/Pyraminx|Pyraminx]]
* [[List of Belgain Records/Square-1|Square-1]]
* [[List of Belgain Records/Clock|Rubik's Clock]]
* [[List of Belgain Records/Skewb|Skewb]]
* [[List of BelgainRecords/6x6x6|6x6 Cube]]
* [[List of Belgain Records/7x7x7|7x7 Cube]]
* [[List of Belgain Records/4BLD|4x4 blindfolded]]
* [[List of Belgain Records/5BLD|5x5 blindfolded]]
* [[List of Belgain Records/Multi-BLD|3x3 multi blind]]

[[Category:Lists]]

Parity PLL

2017-06-16T13:24:22Z

Stannic: +Category:Algorithms +Category:Puzzle theory

Normal [[PLL]] (Permutation of the Last Layer) contains only [[even]] [[permutation]]s. However, in certain puzzles (for instance, the [[Square-1]] and the [[4x4x4]]) this restriction is absent because of the existence of [[parity]]. This means that on these puzzles we can get a PLL that is not one of the normal 21 found on the [[3x3x3]] - that is, we can get a '''Parity PLL'''.

The following page gives a list of all the parity PLLs, along with some tentative names. Unlike normal PLL, there is no official/traditional naming scheme, probably because few people have bothered to learn algorithms for each of these cases. These cases can simply be solved by doing a parity algorithm and then solving the normal PLL case, but it may be faster to have a one-look alg for them, depending on the puzzle.

== Todo ==
* Upload parity PLL images (why isn't this working)
* Add images, names, 4x4 algs (on separate page?), sq1 algs (on separate page?)
* Link with other pages

[[File:ParityPLL7.png]][[File:ParityPLL8.png]]
[[File:ParityPLL1.png]][[File:ParityPLL6.png]]
[[File:ParityPLLtwo.png]][[File:ParityPLL5.png]]
[[File:ParityPLL3.png]][[File:ParityPLL4.png]]

[[Category:Algorithms]]
[[Category:Puzzle theory]]

HD Method

2017-06-16T13:13:18Z

Stannic: + Category:2x2x2 methods

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

The HD method (short for the Higgs-Demars method, the names of the 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's 50 example V's sampled by Jonathan Lewis: (link)

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 algs for this step were created by Jonathan Lewis (also known as Shiv3r) and V. Higgs (also known as Thermex). The algsheet can be found here: (link) 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 FR position. Most of the NLL algorithms were created by Neuro and can be learned here: (link)

'''Pros'''
----
:1. The HD method contains a pretty reasonable number of algorithms, it only has a few more algorithms than CLL and way less than full EG. Plus, many of the algorithms are less than 5 moves, making them effortless to memorize.
:2. 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.
:3. The HD method has a pretty low movecount, comparable to CLL and EG.

'''Cons'''
----
:1. The HD method is very different from most mainstream methods and can be difficult to learn and master for someone transitioning over from a beginner's method.
:2. There's nothing extremely special about this method and there are other methods with less algorithms that can achieve lower movecounts.

One-looking
----
One of the main pros 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 inspectoin 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. The document showing the permutation is effected during LOLS can be found here: (link).

[[Category:2x2x2 methods]]

Category:Terminology

2017-06-16T13:08:50Z

Stannic: /* See also */ + Cubing terminology in different languages

== See also ==
* [[FAQ]]
* [[:Category:Puzzle theory]]
* [[:Category:Puzzle notations]]
* [[:Category:Puzzle hardware]]
* [[Cubing terminology in different languages]]

== External links ==
* Speedsolving.com: [http://www.speedsolving.com/forum/showthread.php?t=8544 Guide for Cubing Abbreviations]
* [http://cubefreak.net/other/glossary.html Cube Glossary] on cubefreak.net (not updated since 2006)

== Further classifications ==
* [[:Category:Terminology by event]]

[[Category:Concepts and knowledge]]

WCA Delegate

2017-06-15T19:43:41Z

Stannic: fix redirect

#REDIRECT [[List of WCA delegates]]

Advanced Methods

2017-06-15T19:42:20Z

Stannic: fix redirect

#REDIRECT [[:Category:Advanced methods]]

Speedcubing method

2017-06-15T19:41:15Z

Stannic: fix redirect

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

3x3x3 Speedcubing Methods

2017-06-15T19:40:06Z

Stannic: fix redirect

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

Slow solving

2017-06-15T19:35:17Z

Stannic: + links to other pages

Slow solving a form of practice in where the speedcuber performs a number of untimed solves while not caring about speed, thus the term "Slow solves" or "Slow Solving". These are usually done with the counter-intuitive goal of achieving faster speeds by improving skills easier strengthened by solving slower, such as [[Look ahead|lookahead]], fluidity, or overall efficiency. It is generally considered one of the best ways to lower solving times for most puzzles or events(there are some exceptions, for example [[BLD|Blindfolded solving]]).

[[Category:Terminology]]

TFOP

2017-06-15T19:30:45Z

Stannic: + Category:3x3x3 methods

TFOP is a variation of [[CFOP]] created by Sebastian Alanen in early 2016.
The variation builds on an easier F2L (an F2L which can be done in fewer moves).
This variation's F2L relies heavily on M-slice moves and wide moves.
This variation averages between 45-55 moves.

The steps are;
T - Insert 3 cross pieces.
F2L - Insert the back pairs + 1 in front. then build a 2x2x1 block and insert it to finish the F2L.
OLL.
PLL.

This variation was developed independently of "HE"
-----------------------------------------
There is also another method called TFOP, a beginners method, based off of LBL but instead of solving D corners then E edges you solve E edges then D corners.. TFOP here stands for '''T'''-style/'''T'''-shape '''F'''2L, '''O'''ll, '''P'''ll(or any lasy layer). Some solvers have been known to get under 10 seconds with this method just playing with it, so speed is definitely possible with it.
Here are the steps to the beginners method:
* '''Create a cross''' -- do this any way you can, normal, Daisy, piece-by piece whatever. Be sure to place it on D when youre done though.
* '''Solve the E-slice edges''' -- This can be done like the corners in normal LBL but without the painful case where the white sticker is on U.
* '''insert the corners''' -- place the corner above the appropriate slot and place it in. This can be done with 3 algorithms max, two are mirrors of each other, and the third is either a triple sexy or a triple sledgehammer.
* '''Last Layer''' Use any last layer method to solve from here.
Fast times are definitely possible, as there have been several sub-10 solves with this method.
'''Algorithms'''
* U' R U' R' U2 R U' R'
* and its mirror: (y) U L' U L U2 L' U L
* and third algorithm: either (R U R' U')x3 or (R' F R F') x3

[[Category:3x3x3 methods]]

Corner cutting

2017-06-15T19:25:59Z

Stannic: + Category:Terminology

Corner cutting is the ability for puzzle to turn when the layers of the cube are misaligned.

[[Category:Terminology]]

1x2x3 Block

2017-06-15T19:19:02Z

Stannic: + Category:3x3x3 first substeps

{{Substep Infobox
|name=1st Roux Block
|image=Visualcube_rouxblock.gif
|proposers=[[Gilles Roux]]
|year=2003
|anames=First Roux Block, 1x2x3 Block
|variants=
|subgroup=
|algs=intuitive
|moves=
|purpose=
* [[Speedsolving]], [[FMC]]
|previous=[[Scrambled cube state]]
|next=[[LRoux Block cube state]]
}}

The '''First Roux Block''' (French pronunciation for "Roux": [ʁu]) is the first step in a 3x3 speedsolving method called [[Roux]] invented by [[Gilles Roux]]. This first step consists of building a 1x2x3 block anywhere on the cube.

[[Category:3x3x3 first substeps]]

Block-1CO

2017-06-15T19:17:46Z

Stannic: + Category:3x3x3 first substeps

{{Substep Infobox
|name=Block-1CO
|image=
|proposers=
|year=
|anames=
|variants=
|subgroup=
|algs=intuitive
|moves=
|purpose=
|previous=[[Scrambled cube state]]
|next=[[2x2x3 Block -1CO cube state]]
}}
The '''Block-1CO''' is the first [[step]] for some cubing methods on [[3x3x3]] as the [[Petrus rotten]] method. The [[step]] consists in creating a [[2x2x3 Block cube state|2x2x3 Block]], except one corner orientation.

{{stub}}

[[Category:3x3x3 first substeps]]

Pair

2017-06-15T19:16:23Z

Stannic:

A '''pair''' is a set of two things that go together. In cubing this most often refers to two pieces that are adjacent to each other when the cube is in a solved state. Pairs are most commonly used in any [[LBL]] that solves the first two layers together ([[F2L]]), like the [[Fridrich Method]]. A [[corner]] and a [[edge]] is paired to form a 'CE pair' that then is placed into position. In the [[Reduction Method]] edges are paired up and becomes [[dedge]]s. Uncommonly it may be any two adjacent pieces on any puzzle.

Pairs can sometimes be considered a primitive form of [[blockbuilding]].

----
To '''pair''', '''pair up'''; ''(verb)'', the actual forming of a pair of pieces, achieved by twisting the sides and/or slices of the puzzle.

[[Category:Terminology]]

Dedge

2017-06-15T19:15:20Z

Stannic: + Category:Terminology

A '''dedge''' (short for ''double edge''), is a [[block]] consisting of the two [[edge]] pieces on a [[4x4x4 cube]] that have the same pair of colors. A dedge can be moved around as if it were a single edge on a [[3x3x3 cube]], and one solution method that makes extensive use of this principle is the [[Reduction Method]].

There are similar concepts to the dedge on larger cubes, where all of the edge pieces with the same color pair are matched together. On a [[5x5x5]] this is called a '''tredge''', and on larger cubes several fanciful names have been proposed ('quedge' and 'quidge' for instance) but it is usually easier to just refer to the block of edges as a 'paired edge' or 'edge group'.

[[Category:Terminology]]

EO (noline)

2017-06-15T19:11:51Z

Stannic: + Category:3x3x3 first substeps

{{Substep Infobox
|name=EO (noline)
|image=
|proposers=
|year=
|anames=
|variants=[[3OP EO (Flip2+Setup)]], [[HTA G1]], [[3OP EO (MU*)]]
|subgroup=
|algs=
|moves=
|purpose=
|previous=[[Scrambled cube state]]
|next=[[Edges Oriented cube state]]
}}

'''EO (noline)''' refers to the part of a solve that [[orient]] all the [[edge]]s of a [[Scrambled cube state|scrambled 3x3x3 cube]].
The next cube state of this step is the [[Edges Oriented cube state]], also called [[HTA G1 cube state]].

[[Category:3x3x3 first substeps]]

Cubing

2017-06-15T19:06:14Z

Stannic: if it is most often the same as speedcubing, and "FMC... considered by many to be part of the speedcubing sport", shouldn't this be a redirect?

#REDIRECT [[Speedcubing]]

Speedcubing

2017-06-15T19:02:03Z

Stannic: /* Regarding FMC */ + Fewest Moves Challenge

'''Speedcubing''' or '''Speedsolving''' is a sport in which one tries to solve the [[Rubik's cube]] or other [[puzzle]]s as fast as possible. there are various 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
*3x3x3 with feet
*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

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

[[Category:Terminology]]

Lock-up

2017-06-15T18:29:50Z

Stannic: + Category:Terminology

Lock-up happens when layers of the puzzle get out of alignment.

Less severe lock-ups can be fixed by realigning the layers.

More severe lock-ups cause parts of the puzzle to be twisted in unnatural ways, creating gaps and causing the entire puzzle to be stuck.

[[Category:Terminology]]

MF8 Gigaminx

2017-06-15T18:26:50Z

Stannic: + Category:Puzzle hardware (as MF8 Megaminx)

[[File:Mf8Gigaminx.jpg|200px|thumb|right|Mf8 Gigaminx Black Stickered]]

The '''MF8 Gigaminx''' was created by the company [[MF8]]. It is a 5 layer version of the [[Megaminx]], and is considered to be much better than the [[Cube4You]] Gigaminx. Out of the box, turning is quite bad and it is hard to [[fingertrick]]. When broken in, [[lubrication|lubricated]] and tensioned, the puzzle performs much better and rarely locks up.

== Purchase from ==

[http://www.lightake.com/detail.do/sku.37766~C.12332011TXFCIVEFR! Lightake.com Mf8 Unstickered Black]

[[Category:Puzzle hardware]]

Sledgehammer

2017-06-15T18:15:03Z

Stannic: + Category:Algorithms

[[File:Sledgehammer2.png|200px|thumb|right|The Sledgehammer from the right]]
[[File:Sledgehammer3.png|200px|thumb|right|The Sledgehammer from the left]]

The '''Sledgehammer''' is a move commonly used in [[F2L]] pair insertion: '''R' F R F'''' on the right or '''L F' L' F'''' ("left sledgehammer").

{{Alg|R' F R F'|Full}}
{{Alg|L F' L' F|Full}}

Because it is a symmetry of one of the simplest non-trivial commutators (along with the [[Sexy_Move|sexy move]]), many algs and solving techniques use variations of the sledgehammer.

==== Use and edge control ====
When an edge pair that needs to be inserted rests on the left of right face of the cube relative to the face towards you, and the cross (bottom) color is facing away, usually you would have to do a cube rotation and insert it using either U' L' U L on the right or U R U' R' on the left, instead, you could utilize the Sledgehammer without a cube rotation.

This F2L pair insertion method is also often used for edge control. Instead of inserting the pair the usual way, say with U R U' R', which could leave you with a no-edges OLL, the Sledgehammer can be used to give you a more favorable, easy-to-execute [[OLL]]. This works, however, for only the final pair. If you look ahead to see that no edges are oriented for the upcoming OLL, do the Sledgehammer, and two non-existing edges will come up.

==Variations==
In addition to the sledgehammer itself, the inverse (sometimes humorously called [http://www.speedsolving.com/forum/showthread.php?13224-HEDGESLAMMER Hedgeslammer]) is often equally useful.

{{Alg|F R' F' R|Full}}

The Sledgehammer also has a popular edge-control variant that will also put up an extra two LL edges into the upcoming OLL. When the F2L pair is connected in the top layer, with the cross color facing you, doing R' F R F' on the right or L F' L' F on the left (although not as common as on the right), can also insert the pair as opposed to U R U' R'. To remember this trigger, it is the last trigger on a popular [[PLL#Y_Permutation|Y Permutation]] algorithm [F (R U' R' U') (R U R' F') (R U R' U') (R' F R F')] , and subsequently the second and last trigger on a common Key OLL algorithm [(R U R' U') (R' F R F')].

[[Category:Algorithms]]