Speedsolving.com Wiki - User contributions [en]

Fewest Moves Challenge

2013-04-17T11:29:32Z

Guusrs:

''FMC redirects here. This page is about the [[WCA]] official event. For the [[online contest]], see [[Fewest Moves Challenge]].''

'''Fewest Moves''' (or '''F'''ewest '''M'''oves '''C'''hallenge, '''FMC''') is an event where competitors attempt to solve a puzzle (almost always the [[3x3x3]]) in as few moves as possible, starting from a given scramble. The usual turn metric is [[HTM]].

There is one [[WCA]]-official Fewest Moves event: writing down the shortest possible solution to a 3x3x3 scramble, with a time limit of one hour. Other types of fewest move solving have been tried in the [[Fewest Moves Challenge]], with the most popular other events being the Linear Fewest Moves event (solving the 3x3x3 with as few moves as possible, without being able to undo moves) and the event of writing down the shortest possible solution for the 3x3x3 with a time limit of one week.

The original '''Fewest Moves Challenge''' (FMC) was a challenge started by [[Dan Harris]]. It was the first online Fewest Moves competition and, although it is no longer run by Dan, it remains a good way to practice fewest moves solving. One scramble is given per event every week, and the results are typically up soon after the next round starts.

==History==

Although it is very likely that fewest moves solving was first experimented with in the 1980s, the event was popularized by [http://www.cubestation.co.uk/ Dan's Cube Station] with its Fewest Moves Challenge (FMC), which began in April 2003 and was held nearly every week for many years. The event was also held at many competitions starting with the [[World Rubik's Games Championship 2003]], and recently it has become even more popular due to the weekly competitions at the [[Speedsolving.com]] forum. Since 2009 this competition was taken over By Per K Fredlund on [http://fmc.mustcube.net/ FMC Challenge]

==Records==

The first world record for the WCA event was set in 2003 and was 29 moves by [[Mirek Goljan]]. He improved this result to 28 moves in 2005, a record which stood for more than three years until it was broken by [[Guus Razoux Schultz]], 27 moves in 2008. The record then was brought down to 22 moves by Jimmy Coll and István Kocza. After over 3 years, the current record was set at the Czech Open 2012 with Tomoaki Okayama presenting a 20 move solution.

The best known unofficial result (using a properly scrambled cube) is 17 moves in Weekly Competition 2013-15 by [[Guus Razoux Schultz]][http://www.speedsolving.com/forum/showthread.php?41488-Weekly-Competition-2013-15/page2 .]

==Algorithms==
[[Algorithm]]s that may be used in FMC are at many pages in this wiki, se for example [[ELL]], [[LLEF]], [[L3C]] and [[L4C]].

The [[BH]] method is a nice complement for the advanced FMC competitor, learning how to deal with optimal [[commutator]]s helps a lot.

== See Also ==
* [[Fewest Moves techniques]]
* [[Fewest Moves methods]]
* [[Move count]]
* [[Puzzle theory]]
* [[Blindsolving]]
* [[One-Handed solving]]
* [[Solving with feet]]

== External Links ==
* [http://fmc.mustcube.net/ New FMC Website]
* [http://games.groups.yahoo.com/group/fewestmoveschallenge/ FMC Yahoo Group]
* [http://www.cubestation.co.uk/cs2/index.php?page=fmc/fmcnewsystem Dan Harris's Fewest Moves Challenge Page] (now obsolete)
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?13599 The FMC thread]
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?1566 Fewest Moves Tips and Techniques]
[[Category:Solving Variants]]

Category:Fewest Moves techniques

2012-12-26T16:34:10Z

Guusrs:

This page introduces some tips and techniques to help you solve the cube in as [[Fewest Moves|few moves]] as possible.

The best results can be obtained when all techniques are controlled. It is strongly advised not to follow a strict pattern, for example a [[3x3x3 speedsolving methods|speedsolving method]]. However some algorithms learned from a speedsolving method will give some advantages in some cases. The most useful [[Fewest Moves Methods|methods]] are [[Heise]], [[Petrus]], [[Fridrich]], [[Roux]] and [[ZBLL]].

== Block Building ==
Best start for an FMC is block building technique. Try to build a [[2x2x2 block]] then a [[2x2x3 block]]. After the 2x2x2 block you have 3 sides to extend it to a 2x2x3. Explore all of them. After the 2x2x3 block...

== Pair Insertion ==
When [[insertion|inserting]] Fridrich-pairs in F2L don't get stuck with you speedcubing methods but try some alternatives and check each of them for...

== Inverse Scramble ==
If you can't find a good start to your scramble, you can try inverting the scramble. That means the scramble R F' D2 U becomes U' D2 F R'. Find a good solution based on the inverted scramble, then invert the solution. The inverted solution will solve the original scramble. It looks strange to solve like this, but gives you more chances to find a good start.

== Pseudoblocks or Pre-scramble-moves==
Like [[Heise Method]] you can build pseudo blocks, which are adjacent 1x2x2 blocks or c/e pairs that are not adjacent but need an extra turn to get those blocks at the right color-centre. Solving with pseudo blocks can be very difficult and requires a lot of experience. As an alternative you can replace a pseudo block by a pre-scramble-move to give more oversight over your solve.

== NISS ==
The Normal-inverse-scramble-switch (NISS) technique was introduced in 2009 by Guus Razoux Schultz in the speedsolving forum here: http://www.speedsolving.com/forum/showthread.php?13599-The-FMC-thread/page19&p=258791#post258791
On this forum you can find several good explanations of how it works. Mike Hugley made it pretty understandable with the following description:

Generally, you use premoves to modify a scramble so you can solve it more easily. The most common approach for this is to solve a "pseudo-block" of some sort, where for instance you might put in a corner-edge pair of the wrong color into a 2x2x2 or 2x2x3 block. Then you find the moves necessary to put that corner-edge pair (or whatever) into it's proper location in the solved cube. If you then apply those moves to the solved cube prior to applying the scramble, you'll find that the pseudo-block becomes an actual block. Then you can add those moves to the end of your final solution and it will be solved.

Guus's solution you mention is using "NISS" - his "normal-inverse-scramble-switch" method, where you solve part of the cube with the normal scramble, then when you get stuck, you switch to the inverse scramble and use it, then when you get stuck again, you switch back to the normal scramble, and so on. I love NISS - it's really fun to do! Anyway, when you switch from normal to inverse scrambles, the moves you used at the beginning of the normal scramble solve become premoves to the inverse scramble (and vice-versa). It takes trying it to see how it really works, and it's really quite ingenious.

The best way to understand these is to look at some of the solves that others have done (like the ones in the weekly competitions) and understand how they work. Examples are much more useful than descriptions - this isn't a particularly good description, but maybe it gives you an idea of what's going on.

A pre-scramble move is a move you apply before the scramble and which allows you to find more possible solutions. Of course you must not forget to add the premove at the end of your solution.

== Inserted Moves (single) ==
Sometimes after a promising start you can't find a good continuation. Say you have solved a 2x2x2 block, but after that there's nothing good. By stepping through the solution you might see that at one place there's no 2x2x2-pieces on U, at that place you can try to insert U, U' or U2 and see if a better continuation is possible.

== Inserted Algorithms/Commutators ==
A very powerful technique in FMC is to solve everything except 3-5 corners and then insert 8 move [[commutators]] that cycle three corners earlier in the solution. Since there many corner configurations that can be solved in 8 moves often one will cancel moves, and thus one corner cycle will add less than 8 moves to the total solution length. Edge cycles are not used as often since FMC is judged in [[HTM]] and edge cycles often involve slice moves that are counted as two moves. Some people use stickers to more easily track the unsolved pieces through the solution.

== Freestyle Solving ==
If you see some opportunity to solve a lot of blocks without any (known) pattern you could try to solve it. When leaving a maximum of 4 edges and 4 corners try to conjugate them to 1 face during a solve. Then use pre-scramble-moves or a second cube to solve that face / LL

== LL-algorithms ==
sometimes you solve a lot of LL blocks using a very short LL algorithm, 8 or 9 moves maximum. Try to learn short LL algorithms in such a way that you know what it does to corners and edges. Start with the length-6 LL-alg, then the three 7-move LL-algs, the five 8-move LL-algs, and so on. You are really an expert when learning all LL-algs up to 10 moves.

A step up from this is to start the alg part from the [[last slot]], [[LPELL]] is one such method.

== Other Tips ==

* Do not use moves that turn the cube!

* Use fixed colors for up & front to enhance recognition!

* Better still, look at the centre of the face you are turning, it tells wich side it is ("White" = U and so on), then orientation does not matter anymore.

* Write down promising moves, do not wait till the very end!

* Create a backup solve!

* Learn to scramble fast, it can save a lot of time during a 1-hour solve.

* Bring stickers (for insertions) and extra cubes during a competition.

== See also ==

* [[Fewest Moves]]
* [[Commutators]]
* [[Niklas]]
* [[God's Algorithm]]
* [[Fewest Moves methods]]
* [[Puzzle theory]]

== External links ==

* [http://www.ryanheise.com/cube/fundamental_techniques.html Ryan Heise's page on intuitive solving techniques]
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?t=1566 Fewest Moves: Tips and Techniques]
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?p=221756 The FMC thread]
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?13599-The-FMC-thread&p=723818&viewfull=1#post723818 6 to 10-move LL algorithms]
* Online tool: [http://if.qiyuuu.com/?lang=en Insertion Finder]

[[Category:Fewest Moves Methods]]

{{Stub}}

__NOTOC__

Fewest Moves Challenge

2012-12-26T16:19:54Z

Guusrs:

''FMC redirects here. This page is about the [[WCA]] official event. For the [[online contest]], see [[Fewest Moves Challenge]].''

'''Fewest Moves''' (or '''F'''ewest '''M'''oves '''C'''hallenge, '''FMC''') is an event where competitors attempt to solve a puzzle (almost always the [[3x3x3]]) in as few moves as possible, starting from a given scramble. The usual turn metric is [[HTM]].

There is one [[WCA]]-official Fewest Moves event: writing down the shortest possible solution to a 3x3x3 scramble, with a time limit of one hour. Other types of fewest move solving have been tried in the [[Fewest Moves Challenge]], with the most popular other events being the Linear Fewest Moves event (solving the 3x3x3 with as few moves as possible, without being able to undo moves) and the event of writing down the shortest possible solution for the 3x3x3 with a time limit of one week.

The original '''Fewest Moves Challenge''' (FMC) was a challenge started by [[Dan Harris]]. It was the first online Fewest Moves competition and, although it is no longer run by Dan, it remains a good way to practice fewest moves solving. One scramble is given per event every week, and the results are typically up soon after the next round starts.

==History==

Although it is very likely that fewest moves solving was first experimented with in the 1980s, the event was popularized by [http://www.cubestation.co.uk/ Dan's Cube Station] with its Fewest Moves Challenge (FMC), which began in April 2003 and was held nearly every week for many years. The event was also held at many competitions starting with the [[World Rubik's Games Championship 2003]], and recently it has become even more popular due to the weekly competitions at the [[Speedsolving.com]] forum. Since 2009 this competition was taken over By Per K Fredlund on [http://fmc.mustcube.net/ FMC Challenge]

==Records==

The first world record for the WCA event was set in 2003 and was 29 moves by [[Mirek Goljan]]. He improved this result to 28 moves in 2005, a record which stood for more than three years until it was broken by [[Guus Razoux Schultz]], 27 moves in 2008. The record then was brought down to 22 moves by Jimmy Coll and István Kocza. After over 3 years, the current record was set at the Czech Open 2012 with Tomoaki Okayama presenting a 20 move solution.

The best known unofficial result (using a properly scrambled cube) is 18 moves in Weekly Competition 2012-20 by [[Guus Razoux Schultz]][http://www.speedsolving.com/forum/showthread.php?36863-Weekly-competition-2012-20&p=745504&viewfull=1#post745504 .]

==Algorithms==
[[Algorithm]]s that may be used in FMC are at many pages in this wiki, se for example [[ELL]], [[LLEF]], [[L3C]] and [[L4C]].

The [[BH]] method is a nice complement for the advanced FMC competitor, learning how to deal with optimal [[commutator]]s helps a lot.

== See Also ==
* [[Fewest Moves techniques]]
* [[Fewest Moves methods]]
* [[Move count]]
* [[Puzzle theory]]
* [[Blindsolving]]
* [[One-Handed solving]]
* [[Solving with feet]]

== External Links ==
* [http://fmc.mustcube.net/ New FMC Website]
* [http://games.groups.yahoo.com/group/fewestmoveschallenge/ FMC Yahoo Group]
* [http://www.cubestation.co.uk/cs2/index.php?page=fmc/fmcnewsystem Dan Harris's Fewest Moves Challenge Page] (now obsolete)
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?13599 The FMC thread]
* Speedsolving.com [http://www.speedsolving.com/forum/showthread.php?1566 Fewest Moves Tips and Techniques]
[[Category:Solving Variants]]

Category:Fewest Moves techniques

2009-02-02T22:39:53Z

Guusrs:

There are several fewest moves techniques:

block building
pair insertions
Commutators
Conjugates
pseudoblocks or pre-scramble-moves
inserted moves (single)
inserted algorithms/commutators
freestyle solving
LL-algorithms

The best results can be obtained when all techniques are controlled. It is strongly adviced not to follow a strict pattern, for example a speedsolving method. However some algorithms learned from a speedsolving method will give some advantages in some cases. Most useful methods are [[Fridrich Method]], [[Heise Method]], [[Petrus Method]], [[Roux Method]] and [[ZBLL]].

==block building==
Best start for an FMC is block building technique. try to build a 2x2x2 block then a 2x2x3 block. After the 2x2x2 block 3 sides to extend it to a 2x2x3. Explore all of them. After the 2x2x3 block

==pair insertion==
when inserting Fridrich-pairs in F2L don't get stuck with you speedcubing methods but try some alternatives and check each of them for

==commutators==

==conjugates==

==pseudoblocks or pre-scramble-moves==
Like [[Heise Method]] you can build pseudo blocks, which are adjacent 1x2x2 blocks or c/e pairs that are not adjecent but nedd an extra turn to get those blocks at the right color-centre. Solving with pseudo blocks needs can be very difficult and needs a lot of experience. As an alternative you can replace a pseudo block by a pre-scramble-move to give more oversight over your solve

==inserted moves (single)==

==inserted algorithms/commutators==

==freestyle solving==
If you see some opportunity to solve a lot of blocks without any (known) pattern you could try to solve it. When leaving a maximum of 4 edges and 4 corners try to conjugate them to 1 face during a solve. Then use pre-scramble-moves or a second cube to solve that face / LL

==LL-algorithms==
sometimes you solve a lot of LL blocks using a very short LL algorithm, 8 or 9 moves maximum. Try to learn short LL algorithms in such a way that you know what it does to corners and edges. Start with the length-6 LL-alg, then the three 7-move LL-algs, the five 8-move LL-algs, and so on. You are really an expert when learning all LL-algs up to 10 moves.

==other tips==

'''do not use moves that turn the cube'''!

'''Use fixed colors for up & front to enhance recognition''''!

'''write down promising moves, do not wait till the very end'''!

'''create a backup solve'''!

'''learn to scramble fast, it can save a lot of time during a 1-hour solve'''

'''bring stickers (for insertions) and extra cubes during a competition'''

Category:Fewest Moves techniques

2009-02-02T22:39:39Z

Guusrs:

There are several fewest moves techniques:

block building
pair insertions
Commutators
Conjugates
pseudoblocks or pre-scramble-moves
inserted moves (single)
inserted algorithms/commutators
freestyle solving
LL-algorithms

The best results can be obtained when all techniques are controlled. It is strongly adviced not to follow a strict pattern, for example a speedsolving method. However some algorithms learned from a speedsolving method will give some advantages in some cases. Most useful methods are [[Fridrich Method]], [[Heise Method]], [[Petrus Method]], [[Roux Method]] and [[ZBLL]].

==block building==
Best start for an FMC is block building technique. try to build a 2x2x2 block then a 2x2x3 block. After the 2x2x2 block 3 sides to extend it to a 2x2x3. Explore all of them. After the 2x2x3 block

==pair insertion==
when inserting Fridrich-pairs in F2L don't get stuck with you speedcubing methods but try some alternatives and check each of them for

==commutators==

==conjugates==

==pseudoblocks or pre-scramble-moves==
Like [[Heise Method]] you can build pseudo blocks, which are adjacent 1x2x2 blocks or c/e pairs that are not adjecent but nedd an extra turn to get those blocks at the right color-centre. Solving with pseudo blocks needs can be very difficult and needs a lot of experience. As an alternative you can replace a pseudo block by a pre-scramble-move to give more oversight over your solve

==inserted moves (single)==

==inserted algorithms/commutators==

==freestyle solving==
If you see some opportunity to solve a lot of blocks without any (known) pattern you could try to solve it. When leaving a maximum of 4 edges and 4 corners try to conjugate them to 1 face during a solve. Then use pre-scramble-moves or a second cube to solve that face / LL

==LL-algorithms==
sometimes you solve a lot of LL blocks using a very short LL algorithm, 8 or 9 moves maximum. Try to learn short LL algorithms in such a way that you know what it does to corners and edges. Start with the length-6 LL-alg, then the three 7-move LL-algs, the five 8-move LL-algs, and so on. You are really an expert when learning all LL-algs up to 10 moves.

==other tips==

'''do not use moves that turn the cube'''!

'''Use fixed colors for up & front to enhance recognition''''!

'''write down promising moves, do not wait till the very end'''!

'''create a backup solve'''!

'''learn to scramble fast, it can save a lot of time during a 1-hour solve''''

'''bring stickers (for insertions) and extra cubes during a competition'''

Category:Fewest Moves techniques

2009-01-23T22:43:12Z

Guusrs:

Category:Fewest Moves techniques

2009-01-23T22:37:45Z

Guusrs:

There are several fewest moves techniques:

block building
pair insertions
Commutators
Conjugates
pseudoblocks or pre-scramble-moves
inserted moves (single)
inserted algorithms/commutators
freestyle solving
LL-algorithms

The best results can be obtained when all techniques are controlled. It is strongly adviced not to follow a strict pattern, for example a speedsolving method. However some algorithms learned from a speedsolving method will give some advantages in some cases. Most useful methods are [[Fridrich Method]], [[Ryan Heise]], [[Petrus Method]], [[Roux Method]] and [[ZBLL]].

==block building==
Best start for an FMC is block building technique. try to build a 2x2x2 block then a 2x2x3 block. After the 2x2x2 block 3 sides to extend it to a 2x2x3. Explore all of them. After the 2x2x3 block

==pair insertion==
when inserting Fridrich-pairs in F2L don't get stuck with you speedcubing methods but try some alternatives and check each of them for

==commutators==

==conjugates==

==pseudoblocks or pre-scramble-moves==

==inserted moves (single)==

==inserted algorithms/commutators==

==freestyle solving==
If you see some opportunity to solve a lot of blocks without any (known) pattern you could try to solve it. When leaving a maximum of 4 edges and 4 corners try to conjugate them to 1 face during a solve. Then use pre-scramble-moves or a second cube to solve that face / LL

==LL-algorithms==
sometimes you solve a lot of LL blocks using a very short LL algorithm, 8 or 9 moves maximum. Try to learn short LL algorithms in such a way that you know what it does to corners and edges. Start with the length-6 LL-alg, then the three 7-move LL-algs, the five 8-move LL-algs, and so on. You are really an expert when learning all LL-algs up to 10 moves.

==other tips==

'''do not use moves that turn the cube'''!
'''Use fixed colors for up & front to enhance recognition''''!
'''write down moves'''!
'''create a backup solve'''!

Category:Fewest Moves techniques

2009-01-23T22:35:33Z

Guusrs:

There are several fewest moves techniques:

[block building]
[pair insertions]
[Commutators]
[Conjugates]
[pseudoblocks or pre-scramble-moves]
[inserted moves (single)]
[inserted algorithms/commutators]
[freestyle solving]
[LL-algorithms]

The best results can be obtained when all techniques are controlled. It is strongly adviced not to follow a strict pattern, for example a speedsolving method. However some algorithms learned from a speedsolving method will give some advantages in some cases. Most useful methods are [Fridrich[Fridrich Method]], [Heise[Ryan Heise]], [Petrus[Petrus]], [Roux[Roux Method]] and [[ZBLL]].

==block building==
Best start for an FMC is block building technique. try to build a 2x2x2 block then a 2x2x3 block. After the 2x2x2 block 3 sides to extend it to a 2x2x3. Explore all of them. After the 2x2x3 block

==pair insertion==
when inserting Fridrich-pairs in F2L don't get stuck with you speedcubing methods but try some alternatives and check each of them for

==commutators==

==conjugates==

==pseudoblocks or pre-scramble-moves==

==inserted moves (single)==

==inserted algorithms/commutators==

==freestyle solving==
If you see some opportunity to solve a lot of blocks without any (known) pattern you could try to solve it. When leaving a maximum of 4 edges and 4 corners try to conjugate them to 1 face during a solve. Then use pre-scramble-moves or a second cube to solve that face / LL

==LL-algorithms==
sometimes you solve a lot of LL blocks using a very short LL algorithm, 8 or 9 moves maximum. Try to learn short LL algorithms in such a way that you know what it does to corners and edges. Start with the length-6 LL-alg, then the three 7-move LL-algs, the five 8-move LL-algs, and so on. You are really an expert when learning all LL-algs up to 10 moves.

==other tips==

'''do not use moves that turn the cube'''!
'''Use fixed colors for up & front to enhance recognition''''!
'''write down moves'''!
'''create a backup solve'''!

Fewest Moves Challenge

2009-01-23T21:50:03Z

Guusrs:

'''Fewest Moves''' is an event where competitors attempt to solve a puzzle (almost always the [[3x3x3]]) in as few moves as possible, starting from a given scramble. The usual turn metric is [[htm]].

There is one [[WCA]]-official Fewest Moves event: writing down the shortest possible solution to a 3x3x3 scramble, with a time limit of one hour. Other types of fewest move solving have been tried in the [[Fewest Moves Challenge]], with the most popular other events being the Linear Fewest Moves event (solving the 3x3x3 with as few moves as possible, without being able to undo moves) and the event of writing down the shortest possible solution for the 3x3x3 with a time limit of one week.

==History==

Although it is very likely that fewest moves solving was first experimented with in the 1980s, the event was popularized by [http://www.cubestation.co.uk/ Dan's Cube Station] with its Fewest Moves Challenge (FMC), which began in April 2003 and was held nearly every week for many years. The event was also held at many competitions starting with the [[World Rubik's Games Championship 2003]], and recently it has become even more popular due to the weekly competitions at the [[Speedsolving.com]] forum.

==Records==

The first world record for the WCA event was set in 2003 and was 29 moves by [[Mirek Goljan]]. He improved this result to 28 moves in 2005, a record which stood for more than three years until it was broken by the current record, 27 moves by [[Guus Razoux Schultz]] in 2008.

The best known unofficial result (using a properly scrambled cube) is 19 moves at the onlibe fmc competition at fmc.mustcube.net round 203. [[Mirek Goljan]] and [[Guus Razoux Schultz]] both found a 19 move solution within and claimed to find this within 20 minutes.

==See also:==
* [[Commutators]]
* [[Fewest Moves Techniques]]
* [http://www.ryanheise.com/cube/fundamental_techniques.html Ryan Heise's page on intuitive solving techniques]