Talk:Tower of Hanoi: Difference between revisions

Content deleted Content added
Jos.koot (talk | contribs)
Line 61:
 
:Obviously one can find a solution for any specified number of disks using a brute-force search. However, no general solution is known, and the minimal number of moves, as a function of the number of disks, is also unknown. -- [[User:Dominus|Dominus]] 20:22, 5 November 2006 (UTC)
 
A brute force method is a general solution too. Therefore I think the problem cannot simply be said to be open. May be it is ment that a solution in O(nr of required moves) is an open problem. [[User:Jos.koot|Jos.koot]] 17:36, 6 November 2006 (UTC)JosKoot