hello! It's a problem with all specifications of hanoi( 3 towers and and ordered rings) except that rings are not all in the same tower. They are distributed in 3 towers ( in each tower they are ordered ) and we want to bring them all in tower C ( assuming towers A,B,C). We want the solution with minimum time. I thank if you can answer it! (perhaps with a pseudocode)
--~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
