Difference between revisions of "Algorithm"

 
(15 intermediate revisions by 6 users not shown)
Line 1: Line 1:
In terms of twisty puzzles, an "algorithm" refers to a sequence of [[moves]] that accomplishes something.  For example, an algorithm is used to cycle 3 edges, or 3 corners.  A [[commutator]] is also considered an algorithm.  Specific [[notation]] is typically used to display algorithms which makes it easy to see and understand.  In [[speedcubing]], algorithms are typically memorized in order to solve specific positions in a short amount of time (recognition of what needs to be solved, recalling the algorithm needed to solve the position, and executing the algorithm to solve the position).
+
In terms of [[twisty puzzle]]s, a memorized sequence of [[move]]s that has a desired effect on the puzzle is called an "algorithm".  For example, an algorithm is used to cycle 3 edges, or 3 corners.  A [[commutator]] is also considered an algorithm.  Specific [[notation]] is typically used to display algorithms which makes it easy to see and understand.  In [[speedcubing]], algorithms are typically memorized in order to solve specific positions in a short amount of time (recognition of what needs to be solved, recalling the algorithm needed to solve the position, and executing the algorithm to solve the position). The execution of an algorithm can be made more fluid with the help of [[finger tricks]].
  
{{stub}}
+
== See also ==
 +
* [[Algorithm Database]]
 +
* [[:Category:Puzzle notations|Puzzle notations]]
 +
* [[Finger tricks]]
 +
 
 +
[[Category:Terminology]]

Latest revision as of 06:38, 1 June 2017

In terms of twisty puzzles, a memorized sequence of moves that has a desired effect on the puzzle is called an "algorithm". For example, an algorithm is used to cycle 3 edges, or 3 corners. A commutator is also considered an algorithm. Specific notation is typically used to display algorithms which makes it easy to see and understand. In speedcubing, algorithms are typically memorized in order to solve specific positions in a short amount of time (recognition of what needs to be solved, recalling the algorithm needed to solve the position, and executing the algorithm to solve the position). The execution of an algorithm can be made more fluid with the help of finger tricks.

See also