{{Method Infobox
|name=Snyder
|image=Snyder.png
|proposers=[[user:Tony Snyder|Anthony Snyder]]
|year=1982
|anames=
|variants=[[Heise Method]]
[[Petrus]]
|steps=3-5
|moves=36-45
|purpose=
* [[Speedsolving]]
}}
Invented by [[user:Tony Snyder|Anthony Snyder]] in 1982, the '''Snyder Method''' is both a [[fewest moves]] [[method]] and a [[speedsolving]] [[method]] for the [[3x3x3 cube]]. You start the same way as with [[Petrus]] forming a block that includes a [[XCross]]. Then CE pairs are added to nearly complete the F2L. Then while putting in the final CE pair, a quick glance at the remaining edges makes possible a simple adjustment in the choice of algorithms so that a minimum of 2 LL edges are oriented. This is a very easy way to cut down the LL scenarios. Then all LL edges are solved together with one corner. Then the [[last three corners]] are solved.

Video of [http://www.youtube.com/watch?v=UB2Pb9_iNBI Anthony demonstrating the Snyder Method].

Though his F2L method closely resembles the F2L in [[Petrus]], his last layer method differs considerably. Anthony claims to have the only cube solving method that relies on a simultaneous permute and orient at every stage.

The Snyder Method includes a number of variations that are applied wherever convenient.

* when a 2x2x3 block is not immediately apparent he will start with either a 1x2x3 or a 2x2x2, then immediately finish the 2x2x3 block with a second look, or, he puts together several CE pairs as in [[Heise]], then assembles those into a F2L minus one CE
* two or more CE may be solved simultaneously to complete the F2L faster
* the LL may be solved in 1 look rather than 2, using either a shortest-move algorithm, combination, or substitution

In the early 80's Anthony came up with a complete set of fewest-move solutions for the CE pair cases and for the [[last three corners]] cases. However, he relied more extensively on the use of combinations and exchanges to efficiently put in the LL edges + corner. He makes up for this with a large selection of approximate direct-solves on the entire LL, claiming to switch to this mode about 20% of the time.

This method requires 1-2 looks for the block+cross start, then up to 1 look each for the 1-3 CE pairs, then 1-2 looks for the last layer. Though there are a lot of looks, an attentive solver can be quite efficient, and average around 40 turns. Though a beginner will likely take a lot more than this, and a pro taking their time may get his/her average down to about 36. Many of the shorter algorithms were added throughout the 80's and 90's, and the library of LL direct solves were mostly added in the 00's.

Anthony came up with nearly all of the algorithms without advice from others, and without using a computer.

In 1981 he printed his simple solution, which only used 7 algorithms total. It was entitled, "Tony Snyder's Simplest Solution to Solve a Rubik's Cube", and though he personally only taught a handful of people this technique, a classmate took a copy and passed it out to students in a number of schools. He has not put to print his advanced technique.

'''Note:''' Having complete sets of short algorithms was very unusual in the 1980's (combining 2 algs in 1-look was a common solution). [[Kenneth Gustavsson]] suggested the same LL-method ('Fish & Chips') in 2005 but with [[VHF2L]] and the rest in two clearly defined steps, [[EP]] + 1 corner (36 cases, the 'fish' step) and then [[L3C]] (22 cases, the 'chips' step), this makes a 2-look [[ZBLL]], often a little more effective than [[COLL]]/[[EPLL]].

'''Anthony's Turn Counting Protest:''' "I have never understood why the turn counting rules/standards follow a 'range of motion metric' rather than an 'efficiency metric'. Solving for fewest turns is a challenge in efficiency to start with, so the metric should also be based on efficiency. In my opinion the most sensible way to count turns is to figure that any parallel simultaneous movement is one turn. This would also make the rules far simpler. Experienced cube solvers know that anti-slices and even imbalanced anti-slices can be easier to operate than slices and sometimes easier than 180 singles. Another point is that there are many ways to fine-tune solves by adding more anti-slices. Examples: I far prefer solving the U-Twist (headlights) with R L U2 R' U' R U' R' L' U2 L U L' U, which works out to just 12 very easy to perform turns once you define the anti-slice into the metric (using [[Snyder Notation]] the same algorithm: R+o' U2 R' U' R U' R'o+ U2 L U L' U). This requires only 12 parallel simultaneous movements, which is in my opinion more efficient than the 13 turn F U' R2 U R2 U F U' F2 D R2 D' R2. Another example is the H-PLL, which can take just 6 turns using the [[Snyder Metric]]."

== See Also ==

* [[Snyder Notation]]
* [[Snyder Metric]]
* [[Methods]]
* [[3x3x3 Speedsolving Methods]]
* [[Fewest Moves Techniques]]
* [[Heise Method]]
* [[Petrus Method]]
* [[L3C]]

'''Tony Snyder wrote:'''
"In 1983 I set the world record for unassisted play on a video game called Q*Bert at a place called Showbiz Pizza in Minneapolis. I decided to solve the cube before starting and then again after, just to see what condition my mind would get to. Before starting the game I solved the cube in 31 seconds (early am, bad time). Then I spent half the week playing Q*Bert non-stop, finishing after 57 hours of continuous play and no sleep. I was awake for 3 hours before it started. So after 60 hours of no sleep I then solved the cube in 25 seconds. They showed some of this on local TV, and they did a write-up in March 1984 Electronic Games Magazine. BTW, I unexpectedly went colorblind for about 30 minutes during play, then recovered - lost about 300 Q*Berts during that time, but I had over 800 saved up so it was no big deal."

 <hr>
If you have edges oriented when starting the last layer you can often do using only Sune, double Sune (or inverse and/or mirrors), J-PLL a/b or U-PLL a/b for the first look. Here are a couple of examples that show how this is done:

'''Scramble''' '''Solution'''
F U F' L2 B' U' B U L2 F U' F' U AUF to U-PLL a on the left side, (L3C 3-twist).
L' U R U' B2 U' B2 U B2 R' L U' AUF J-PLL b, (L3C 'Anti Niklas')
B' F R2 U' R2 U R2 U F' U' B U' J-PLL b, (L3C Niklas)
R2 F2 R2 U R' F2 R U' R2 F2 R U R U left side double Antisune (L' U2 L U...)
R' F U2 F U L' U L F U' F U F R U2 left side double Antisune (again!)
B L2 F' D F' D' F2 L2 B' U' y J-PLL a (setup L' before the y for [[1LLL]])
L U2 L D' B2 D L' U2 L D' B2 D L2 U' y2 left Antisune.

Sometimes more than one of these solutions are possible. Working like this solves the step in an easy 2:5 times, maybe more. It is effective, fast and OH-friendly, but recogniton for the sune/doublesune cases is horrible without loads of practice. For the cases where two opposite edges needs to be swapped [[COLL]] is a recommended alternative and for the cases with edges correct, one or two look [[L4C]].

[[Category:Methods]]
[[Category:3x3x3 Methods]]
[[Category:3x3x3 Speedsolving Methods]]
[[Category:Fewest Moves Methods]]
[[Category:Cubing Terminology]]

2010-10-02T08:19:11Z

Tony Snyder:

{{Method Infobox
|name=Snyder
|image=Snyder.png
|proposers=[[user:Tony Snyder|Anthony Snyder]]
|year=1982
|anames=
|variants=[[Heise Method]]
[[Petrus]]
|steps=3-5
|moves=36-45
|purpose=
* [[Speedsolving]]
}}
Invented by [[user:Tony Snyder|Tony Snyder]] in 1982, the '''Snyder Method''' is both a [[fewest moves]] [[method]] and a [[speedsolving]] [[method]] for the [[3x3x3 cube]]. You start the same way as with [[Petrus]] forming a [[2x2x2 block]] or sometimes a [[2x2x3 block]] that includes a [[XCross]] either simultaneously or as a second step. Then 1-2 more CE pairs would go in to nearly complete the F2L. Then while putting in the final CE pair, a quick glance at the remaining edges makes possible a simple adjustment in the choice of algorithms so that a minimum of 2 LL edges are oriented. This is a very easy way to cut down the LL scenarios. Then all LL edges are solved together with one corner in the fewest turns possible (with a few exceptions due to the human-originated algorithms). Then solving the [[last three corners]] in the fewest turns possible completes the cube.

Video of [http://www.youtube.com/watch?v=UB2Pb9_iNBI Anthony demonstrating the Snyder Method].

Anthony claims to have the only cube solving method that consistently relies on a simultaneous permute and orient at every stage.

In the early 80's Anthony came up with a complete set of fewest-move solutions for the CE pair cases and for the [[last three corners]] cases. However, he relied more extensively on the use of combinations and exchanges to efficiently put in the LL edges + corner. This is the stage that evolved over time since he felt computer lists and help from others would spoil the fun. He makes up for this with a large selection of approximate direct-solves on the entire LL, claiming to switch to this mode about 20% of the time.

This method requires 1-2 looks for the mini-cube+cross start, then 1 look each for the 2-3 CE pairs, then 1-2 looks for the last layer. Though there are a lot of looks, an attentive solver can be quite efficient, and average around 40 turns. Though a beginner will likely take a lot more than this, and a pro taking their time may get his/her average down to about 36. This method was developed in 1982, though many of the shorter algorithms were added throughout the 80's and 90's, and the library of LL direct solves were mostly added in the 00's.

Anthony came up with nearly all of the algorithms without advice from others, and without using a computer.

In 1981 he printed his simple solution, which only used 7 algorithms total. It was entitled, "Tony Snyder's Simplest Solution to Solve a Rubik's Cube", and though he personally only taught a handful of people this technique, a classmate took a copy and passed it out to students in a number of schools. He has not put to print his advanced technique.

'''Note:''' Having complete sets of short algorithms was very unusual in the 1980's (combining 2 algs in 1-look was a common solution). [[Kenneth Gustavsson]] suggested the same LL-method ('Fish & Chips') in 2005 but with [[VHF2L]] and the rest in two clearly defined steps, [[EP]] + 1 corner (36 cases, the 'fish' step) and then [[L3C]] (22 cases, the 'chips' step), this makes a 2-look [[ZBLL]], often a little more effective than [[COLL]]/[[EPLL]].

'''Anthony's Turn Counting Protest:''' "I have never understood why the turn counting rules/standards follow a 'range of motion metric' rather than an 'efficiency metric'. Solving for fewest turns is a challenge in efficiency to start with, so the metric should also be based on efficiency. In my opinion the most sensible way to count turns is to figure that any parallel simultaneous move is one turn. This would also make the rules far simpler. Experienced cube solvers know that anti-slices and even imbalanced anti-slices can be easier to operate than slices and sometimes easier than 180 singles. Another point is that there are many ways to fine-tune solves by adding more anti-slices. Examples: I far prefer solving the U (headlights) with R L U2 R' U' R U' R' L' U2 L U L' U, which works out to just 12 very easy to perform turns once you define the anti-slice into the metric (using [[Snyder Notation]] the same algorithm: R+o' U2 R' U' R U' R'o+ U2 L U L' U). This requires only 12 parallel simultaneous moves, which is in my opinion more efficient than the 13 turn F U' R2 U R2 U F U' F2 D R2 D' R2. Another example is the H-PLL, which can take just 6 turns using the [[Snyder Metric]]."

== See Also ==

* [[Snyder Notation]]
* [[Snyder Metric]]
* [[3x3x3 Speedsolving Methods]]
* [[Fewest Moves Techniques]]
* [[Heise Method]]
* [[Petrus Method]]
* [[L3C]]

'''Tony Snyder wrote:'''
"In 1983 I set the world record for unassisted play on a video game called Q*Bert at a place called Showbiz Pizza in Minneapolis. I decided to solve the cube before starting and then again after, just to see what condition my mind would get to. Before starting the game I solved the cube in 31 seconds (early am, bad time). Then I spent half the week playing Q*Bert non-stop, finishing after 57 hours of continuous play and no sleep. I was awake for 3 hours before it started. So after 60 hours of no sleep I then solved the cube in 25 seconds. They showed some of this on local TV, and they did a write-up in March 1984 Electronic Games Magazine. BTW, I unexpectedly went colorblind for about 30 minutes during play, then recovered - lost about 300 Q*Berts during that time, but I had over 800 saved up so it was no big deal."

 <hr>
If you have edges oriented when starting the last layer you can often do using only Sune, double Sune (or inverse and/or mirrors), J-PLL a/b or U-PLL a/b for the first look. Here are a couple of examples that show how this is done:

'''Scramble''' '''Solution'''
F U F' L2 B' U' B U L2 F U' F' U AUF to U-PLL a on the left side, (L3C 3-twist).
L' U R U' B2 U' B2 U B2 R' L U' AUF J-PLL b, (L3C 'Anti Niklas')
B' F R2 U' R2 U R2 U F' U' B U' J-PLL b, (L3C Niklas)
R2 F2 R2 U R' F2 R U' R2 F2 R U R U left side double Antisune (L' U2 L U...)
R' F U2 F U L' U L F U' F U F R U2 left side double Antisune (again!)
B L2 F' D F' D' F2 L2 B' U' y J-PLL a (setup L' before the y for [[1LLL]])
L U2 L D' B2 D L' U2 L D' B2 D L2 U' y2 left Antisune.

Sometimes more than one of these solutions are possible. Working like this solves the step in an easy 2:5 times, maybe more. It is effective, fast and OH-friendly, but recogniton for the sune/doublesune cases is horrible without loads of practice. For the cases where two opposite edges needs to be swapped [[COLL]] is a recommended alternative and for the cases with edges correct, one or two look [[L4C]].

[[Category:Methods]]
[[Category:3x3x3 Methods]]
[[Category:3x3x3 Speedsolving Methods]]
[[Category:Fewest Moves Methods]]

Snyder notation

2010-10-02T07:38:30Z

Tony Snyder:

This notation method may be used for any puzzle involving turns, whereby each layer is parallel to at least one face layer.

Advantages: far simpler more intuitive way to represent turns in a large number of multilayer puzzles. It works with cubes, dodecahedrons, pyramids, and many other puzzles.

Only two formats are used, one for a face turn, and one for all other types of turns.

Letters are only used to indicate face layers.

The other symbols describe the turn.

==Identifying Face Layers==

'''Face Layers for Cubes:'''

* F = Front Face
* U = Upper Face
* R = Right Face
* L = Left Face
* D = Down Face
* B = Back face

'''Face layers for the Dodecahedron''' are the same as the cube, plus a spare face for each. When looking directly at the front face, the spare face is adjacent, down and right. Then the right face is adjacent to the front face, and its spare is adjacent, down and right to it. Then the left face is adjacent to the front face, and its spare is adjacent, down and right to it. The back face is adjacent to the right face, and its spare is adjacent, down and right to it. The upper face spare hangs off the back left. And the down face spare meets the upper face spare from the bottom, on the back left. In this way all the primary moves use primary faces, and usually resemble 3x3x3 moves, yet the notation may handle any degree of sophistication desired in representing algorithms for dodecahedron shaped puzzles, including multilayer.

* F = Front Face
* f = Front Face Spare
* U = Upper Face
* u = Upper Face Spare
* R = Right Face
* r = Right Face Spare
* L = Left Face
* l = Left Face Spare
* D = Down Face
* d = Down Face Spare
* B = Back face
* b = Back Face Spare

==Notation==

A turn is defined as any parallel simultaneous move. Slices, anti-slices, imbalanced anti-slices, compound slices and anti-slices, compound imbalanced anti-slices, whole cube rotation, and double layer turns, are all recorded as one turn, using one format.

Each turn notation begins with a face letter.

If only the face layer is turned to the next position clockwise, then no more markings are necessary.

Otherwise, if only the face layer moves to some other position, then one symbol is added.

And, if any layer other than or in addition to the face layer moves to any new position, then a symbol is added for every layer parallel to and including the face layer.

* blank = 1 position clockwise (in a face only turn)
* + = 1 position clockwise (in a multilayer turn)
* 2 = 2 positions clockwise (used in puzzles with 4+ positions per face)
* 3 = 3 positions clockwise (used in puzzles with 5 positions per face)
* ' = last position clockwise (or 1 position counterclockwise)
* o = doesn't move (lower case letter o)

These symbols are arranged left-to-right after the face letter, in the same order as the puzzle layers relative to the indicated face layer. To aid in visualizing this, imagine grasping the indicated face layer with your left hand, temporarily holding the cube so that the other layers are arranged to the right of the indicated face layer, then you'll see them in the same order as the notation.

==Examples==

<pre>R+o'</pre> ...represents an anti-slice on a [[3x3x3]] where the right face turns clockwise, the middle plane doesn't move, and the left plane turns counterclockwise relative to the right face.

<pre>R+o2</pre> ...represents an imbalanced anti-slice on a [[3x3x3]] where the right face turns clockwise, the middle plane doesn't move, and the left plane turns 180.

<pre>F''o+</pre> ...represents a multi-layer move on a [[4x4x4]] where the front face turns counterclockwise along with the next layer in, while the 3rd layer in doesn't move, and while the back layer turns clockwise relative to the face.

<pre>Lo'o</pre> ...represents a slice on a [[3x3x3]] where the middle layer turns forward (counterclockwise relative to the left face).

<pre>R+o' U2 R' U' R U' R'o+ U2 L U L' U = R L U2 R' U' R U' R' L' U2 L U L' U</pre> ...the U (headlights) algorithm.

<pre>Ro2o U Ro2o U2 Ro2o U Ro2o = M2 U M2 U2 M2 U M2</pre> ...the H algorithm.

<pre>R+++</pre> ...rotates entire puzzle clockwise one position relative to right face

<pre>U222</pre> ...rotates entire puzzle 2 positions clockwise relative to upper face

== See Also ==

* [[Notation]]
* [[Snyder Metric]]
* [[Snyder Method]]

[[Category:Puzzle Notation]]

Invented by [[User:Tony Snyder|Anthony Snyder]] in 2010.