Difference between revisions of "God's Algorithm"

Line 1: Line 1:
'''God's algorithm''' is the optimal [[solution]] from a puzzle state to another state, commonly the solved state. The term is sometimes used to refer to such an [[algorithm]] itself, or an algorithmic procedure that finds God's Algorithm efficiently.
+
'''God's Algorithm''' is the optimal [[solution]] from a puzzle state to another state, commonly the solved state. The term is sometimes used to refer to the [[algorithm]] itself, or an algorithmic procedure that finds such a solution efficiently.
  
 
== God's Number ==
 
== God's Number ==
God's number is unknown for 3x3x3. The [[Superflip|superflip]] is known to require 20 moves in [[HTM]], and Rokicki has [http://cubezzz.homelinux.org/drupal/?q=node/view/121 proven] an upper bound of 22 moves for any position.
+
'''God's Number''' is either used to refer to the diameter of the [[group]] of the puzzle (the furthest distance two states can be from each other) or to the furthest distance any position can be from solved. God's Number is unknown for [[3x3x3]], but it is known for many smaller puzzles, such as [[2x2x2]] and [[Pyraminx]]. The [[Superflip|superflip]] is known to require 20 moves in [[HTM]], and Rokicki has [http://cubezzz.homelinux.org/drupal/?q=node/view/121 proven] an upper bound of 22 moves for any position.
  
[[Category:Cubing terminology]]
+
[[Category:Cubing terminology]]

Revision as of 04:10, 27 November 2008

God's Algorithm is the optimal solution from a puzzle state to another state, commonly the solved state. The term is sometimes used to refer to the algorithm itself, or an algorithmic procedure that finds such a solution efficiently.

God's Number

God's Number is either used to refer to the diameter of the group of the puzzle (the furthest distance two states can be from each other) or to the furthest distance any position can be from solved. God's Number is unknown for 3x3x3, but it is known for many smaller puzzles, such as 2x2x2 and Pyraminx. The superflip is known to require 20 moves in HTM, and Rokicki has proven an upper bound of 22 moves for any position.