Difference between revisions of "Algorithm"
Line 1:  Line 1:  
In terms of twisty puzzles, an "algorithm" refers to a sequence of [[move]]s 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 puzzles, an "algorithm" refers to a sequence of [[move]]s 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).  
+  
+  == See Also ==  
+  [[:Category:Algorithms]]  
{{stub}}  {{stub}} 
Revision as of 20:03, 9 September 2009
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).
See Also
