Difference between revisions of "God's Algorithm"

m
Line 2: Line 2:
  
 
== God's Number ==
 
== God's Number ==
'''God's Number''' is either used to refer to the diameter of the [[Rubik's Cube Group|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 has long been known for smaller puzzles, such as [[2x2x2]] and [[Pyraminx]], but for [[3x3x3]] it was unknown until July 2010, when Davidson, Dethridge, [[Kociemba]], and Rokicki [http://cube20.org proved] it to equal 20. The [[superflip]] is the best-known example of a position which requires 20 moves to solve in [[HTM]].
+
'''God's Number''' is either used to refer to the diameter of the [[Rubik's Cube Group|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 has long been known for smaller puzzles, such as [[2x2x2]] and [[Pyraminx]], but for [[3x3x3]] it was unknown until July 2010, when [[Morley Davidson]], [[John Dethridge]], [[Herbert Kociemba]], and [[Tomas Rokicki]] proved it to equal 20. The [[superflip]] is the best-known example of a position which requires 20 moves to solve in [[HTM]].
 +
 
 +
== External links ==
 +
* [http://cube20.org God's number is 20]
  
 
[[Category:Puzzle theory]]
 
[[Category:Puzzle theory]]

Revision as of 19:48, 30 June 2012

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 has long been known for smaller puzzles, such as 2x2x2 and Pyraminx, but for 3x3x3 it was unknown until July 2010, when Morley Davidson, John Dethridge, Herbert Kociemba, and Tomas Rokicki proved it to equal 20. The superflip is the best-known example of a position which requires 20 moves to solve in HTM.

External links