#Hanoi towers in mass effect code#

Dominus 20:48, 6 November 2006 (UTC) Reply Here is an analogy that may make the point clearer. If you think that the number of moves is a solved problem, please tell me the minimum number of moves required to solve the problem for four pegs and 10,000 disks. Jos.koot 17:36, 6 November 2006 (UTC)JosKoot Reply No, your understanding is at fault here. May be it is ment that a solution in O(nr of required moves) is an open problem. Therefore I think the problem cannot simply be said to be open. Dominus 20:22, 5 November 2006 (UTC) Reply Ī brute force method is a general solution too and does define the minimum number of moves as a function of the number of disks and the number of pegs. However, no general solution is known, and the minimal number of moves, as a function of the number of disks, is also unknown. Jos.koot 18:10, 5 November 2006 (UTC)JosKoot Reply Obviously one can find a solution for any specified number of disks using a brute-force search. that at least one path exists from every node to every other node. It is not difficult to prove that the graph is connected, i.e. Use Dijkstra's algorithm to find the shortest path from one distribution to another one. Represent the problem by an undirected graph, the nodes representing different distributions of disks among the pegs and the branches representing moves. It is stated that: 'Although the three-peg version has a simple recursive solution as outlined above, the optimal solution for the Tower of Hanoi problem with four or more pegs is still an open problem.' 42 Possible error in Recursive solution section.35 Mnimal number of moves for any number of pegs and discs.27 'Most toy versions have 8 disks' - or is it 9?.25 Solution description in layman's terms.24 Too many equivalent programming examples.

#Hanoi towers in mass effect code#

19 Java code sample is incorrect or confusing.7 question about number of different ways of moving.