try to solve the problem backwards from the solved state. assume that all of them are sorted in tower C (the solved state.) now you're to move them to reach the initial position. so first try to move the biggest ring into it's place [in the initial pos.] then second ring and so on. the reverse of these operations is your answer.
On Thursday 22 March 2007 15:58, Mahdi wrote: > specifications of hanoi( 3 towers and and > ordered rings) except that rings are not all in the same tower. They --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
