Speedsolving.com Wiki - User contributions [en]

SSC

2018-03-04T19:38:07Z

Shadowslice:

{{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]]
*[[R3-T]]

==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://youtu.be/UakJ9H0CdBs Shadowslice's walkthrough]

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

42

2018-02-01T14:15:45Z

Shadowslice: /* External Links */

{{Method Infobox
|name=42
|image=
|proposers= [[Joseph Briggs]]
|year= 2017
|anames= Briggs3, B3, Briggs
|variants= TCMLL, TC
|steps= 4
|algs= 42 (basic)
|moves= 42 [[STM]] (basic), 40- [[STM]] (advanced)
|purpose=
* [[Speedsolving]]}}
'''42''', '''Briggs3''' (B3 or Briggs for short) started off as an extension to [[Roux]] but eventually developed to such an extent it is considered a separate, though related, method.

==Steps==
# First Block (FB)
##Solve a 1x2x3 in DL (see [[Roux]])
# Second Block Square and 1 oriented corner (SBsquare+c)
##Solve a 1x2x2 block in BDR
##[[Orient]] an LL corner and place in UBR
##Perform an R move
# Conjugated [[CMLL]] (also known as L5C reduction or Briggs Last Corners (BLC))
# Last 7 Edges (L7E)- usually solve in one of two ways:
#*FR first
#*#Orient remaining edges and solve the FR edge (EO+FR)
#*#Solve the UL and UR edges (4b in the Roux method)
#*#Solve the remaining edges (4c in the Roux method)
#*ULUR first
#*#Solve edges which go in ULUR or UFUB (including FR if it is in position) and orient edges
#*#Solve theremaining edge in the R layer
#*#Solve the remaining edges (conjugated 4c)

==Pros==
*Low movecount compared to other methods
*Relatively low number of algorithms
*Less complex than many methods with a similar movecounts/algorithm counts
*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.
*The blockbuilding and intuitive nature of the method allows for rapid improvements in lookahead and inspection
*Non-linear blocks are easier to implement as less is solved compared to [[Roux]]
*CMLL is one of the best algorithm sets as there are only 42 cases and most algorithms are fast OLLCPs from CFOP
*Relatively easy case recognition
==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 practice practice the M moves). Slice turns can also be slower than using a quarter-turn metric.
*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.
*Multiple cases for each algorithm can be difficult to get use to.

==Potential Improvements==
*It is possible that at least some of the CMLL algorithms could be less efficient than is possible as there is a slightly altered configuration of piece though so far this has not been pursued
*'''TC''' (Tyrannical Caterpillar): similar to tyrannical caterpillar for Roux, it is possible that the FR edge could be inserted during the algorithm for solving the last 5 corners though this may provide a smaller benefit when compared to Roux and it is possible that it would not give any advantage at all
*'''EG''': similar to [[PEG]], it is possible that the pairs in the blocks could be solved in different slots and these could be solved during L5C using EG algorithms with wide moves so that the pairs and blocks preserved and solved. This, like PEG itself, has also not been pursued.
*'''F/B L5C''': instead of performing an R/R'/L/L' move before L5C, a solver could do an F or B move to reduce the L5C cases though this would require an adapted form of L7E and the extra F or B move can interfere with the ergonomics of L7E.
==Advanced Techniques==
*'''FR SBsquare''': this is not necessarily an advanced technique and should be a logical step forward where the FR SBsquare is built and the oriented LL corner is placed in UFR before the solver performs an R' move before the conjugated CMLL algorithm is performed. Another extension in the same vein is to solve the right block completely and solve a square on the left of the cube rather than the right though as this may not provide much benefit as most algorithms and cubers are right handed so the lefty algorithms needed may be slower.
*'''TCMLL''': it is possible to use TCMLL algorithms so that the corner in BR slot after the R move does not have to be oriented though this requires more (128) algorithms.
*'''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 or after conjugated CMLL with either u M' u or u' M' u.
*'''IDL''' (Influencing During L7E): a set of semi-intuitive algorithms similar to [[EOLR]] which are used to influence addition edges during the first or second step of L7E
*'''NMLL''': similar to the Roux technique, this allows the cuber to solve any of the 4 possible SBsquares. This can be seen as an extension of the FR SBsquare. While this could increase efficiency, it suffers from the same problem that Roux does: the L5C recognition can become more difficult (though this is not such a big problem when compared to Roux as all cases would be only the R2 separate block cases would be used and the recognition for L5C can be adapted much more easily compared to NMLL in other methods.).
*'''Non-linear Blocks''': an extension which may become more common as the method grows, this would involve combining the first and second steps so that both more of the cube is solved more easily in inspection as there is much less restriction and less solving when compared to Roux first step and second step where the technique is already quite well established.
*'''F/F',B/B' L7E''': this is where the solver performs an F or B move prior to or during L7E in order to give better cases. This would be most useful when used in conjunction with IDL. However, this means that there will be additional F/B moves in L7E which may interfere with the ergonomics of the step.
*'''LPEC''' (L5C (with) Partial Edge Control): it is possible to learn multiple algorithms for each L5C case in order to force better L7E cases.
==As a 2x2x2 method==
The L5C/conjugated CMLL step can be applied to the 2x2x2 method and can be viewed as an extension to [[VOP]] essentially turning the method into a 2-step one. However, in this variation it is likely that [[CLL]] rather than CMLL algorithms would be used. By using additional algorithms, it is possible that the "V" does not need to "correctly" solved. In a similar way to how [[EG]] solves only a face, only the one colour of the "V" may need to be solved. It is possible to use other more advanced Briggs3 techniques such as NMLL. With the techniques listed previously it is possible that the first step may frequently become a "skipped" step or have only a 1 or 2 move solution when combined with colour neutrality thereby giving much easier 1-looking. However, it is possible that all the techniques may make the recognition much harder.
Comparisons in the technique can also be drawn to [[TCLL]] or [[Varasano]] though alternatively it can also be viewed as an extension to them
==A Note on Corners==
Although 42 is frequently used with CMLL, this is merely because these algorithms are well know so only a new recognition would be needed. Some solvers have learned alternate algorithms which have been specifically generated for use in BTR. These algorithms are often much shorter and more ergonomic so it is advisable that any more advanced solver should learn these. See the algorithm sheet in External Links for a set generated by Shadowslice.
==See Also==
*[[Roux]]
*[[CMLL]]
*[[TCLL]]
*[[EOLR]]
*[[Conjugates]]
*[[VOP]]
*[[L7E]]
*[[Waterman]]
*[[L5C]]
==External Links==
*[https://www.speedsolving.com/forum/threads/42-method-proposal.66052/#post-1250340 Original forum post/method proposal]
*[https://www.reddit.com/r/Cubers/comments/6u5i60/42_method_proposal/ Original Reddit post]
*[https://www.youtube.com/watch?v=DTsIcZLuhVU Video announcement/propsal/description]
*[https://1drv.ms/w/s!ApfSlXDznkdsm1Pk2iGoAOPLoppR Conjugated CMLL case list](Word version)
*[https://1drv.ms/b/s!ApfSlXDznkdsm1Va9rzIbUXWHJgy Conjugated CMLL case list](PDF version)
*[https://www.youtube.com/playlist?list=PLEsm6hhDpqBPQ66_GNlP4s8hB4ZX_R2V8 Playlist of extensions, improvements and analyses of the method (ongoing)]
*[https://www.youtube.com/watch?v=Pkb9IZ4yV1g&t=1s Current fastest on cam Ao5] (Beginner's variant-2-look BTR)
*[https://youtu.be/Tm_LHRvqOR0 Beginner's 42 Tutorial]
*[https://1drv.ms/w/s!ApfSlXDznkdsn0nVfnuTbJghr6IU Beginner's 42 alg cheat sheet]
*[https://youtu.be/AJjT5bYknls 22 description]

42

2018-01-30T19:24:41Z

Shadowslice: /* External Links */

42

2018-01-19T15:21:50Z

Shadowslice: /* External Links */

One-handed amnesia

2018-01-11T13:27:53Z

Shadowslice: Phil is weird

'''One-handed amnesia''' refers to when a one-handed solver forgets an [[algorithm]] on a [[3x3x3 One-Handed|one-handed]] solve that the solver can normally do well using both hands. This occurs frequently because most cubers memorize algorithms with both of their hands rather than both or one.

One-handed amnesia is more likely to occur under pressure. One of the most notable examples of this was at the [[World Rubik's Games Championship 2003]] on [[Chris Hardwick]]'s second [[3x3x3 One-Handed]] [[solve]] because of the pressure of being on stage after setting the then world record in his previous solve. One-handed amnesia still occurs in most, if not all, notable competitions to this day.

A notable oddity in the context of this phenomenon is [[Phil Yu]] who had "two-handed amnesia" where he would practise one-handed so much that he would forget algorithms when doing two-handed solves.

== See Also ==
* [[3x3x3 One-Handed]]

Cuber

2017-10-22T23:42:22Z

Shadowslice:

''The category for this article is [[:Category:Cubers]]''

A '''cuber''' is anyone who enjoys playing with the [[Rubik's Cube]], or more generally any [[twisty puzzle]]. Nowadays the majority of cubers are also [[speedcuber]]s, meaning they care about solving puzzles as fast as possible, but there are still very many people who are interested in [[Puzzle theory]], collecting, programming [[List of PC cubing software|simulators]], or building [[Shape modifications|cube modifications]].

A short list of notable cubers who are not speedcubers is:
* [[Per Kristen Fredlund]], [[Fewest Moves]] master and pioneer of [[direct solving]] methods for [[big cubes]]
* [[Ryan Heise]], inventor of the [[Heise Method]]
* [[David Singmaster]], author of ''Notes on Rubik's Magic Cube'', a famous [[Puzzle theory]] book
[[Category:Terminology]]

2017-07-23T22:55:06Z

Shadowslice:

{{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''', commonly alternatively 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]].

==Basic Method==
# 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.
==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://youtu.be/UakJ9H0CdBs Shadowslice's walkthrough]

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

User talk:Stannic

2017-06-18T14:35:42Z

Shadowslice: /* 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)

User talk:Stannic

2017-06-18T14:04:38Z

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

User talk:Stannic

2017-06-18T14:03:04Z

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

2016-08-26T16:35:41Z

Shadowslice:

Users that speedsolve the [[4x4x4 Cube]].

[[Category:Speedsolving.com Wiki user categories]]

Category:Usr:3x3 OH

2016-08-26T16:33:58Z

Shadowslice:

Users that speedsolve the [[3x3x3 Cube]] [[OH]].

[[Category:Speedsolving.com Wiki user categories]]