Jump to content

Talk:God's algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by CRGreathouse (talk | contribs) at 01:47, 25 September 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Okay, the following claims need citations:

  • God's algorithm is a notion originating in discussions of ways to solve the Rubik's Cube puzzle
  • ...but which can also be applied to other combinatorial puzzles
  • ...and mathematical games.
  • The notion applies to puzzles that can assume a finite number of "configurations"... God's algorithm, then, for a given puzzle, is an algorithm that solves the puzzle and produces only optimal solutions.
  • For the notion of "God's algorithm" to be meaningful, it must further be required that the algorithm be practical...
  • For the Towers of Hanoi puzzle, a God's algorithm exists for any given number of disks.

These are all reasonable ideas, but where do they come from? Melchoir 21:36, 23 September 2006 (UTC)[reply]

Fine. I added some references but left in {{unreferenced}} since not all of your concerns have been addressed. I removed {{OR}} since there appears to be no original research in the page. CRGreathouse (t | c) 01:47, 25 September 2006 (UTC)[reply]