I am attempting to complete the towers of hanoi game using 6 towers and an n amount of rings. I attempted to try moving each ring into a seperate tower and then work each tower one by one using recursion, but I could not get an appropriate output. I have researched about the game for around 2 hours and cannot wrap my head around the algorithm used to solve the game with this many towers. Can somebody please give me a hint or guide towards the right direction?
MoBaT 0 Newbie Poster
iamthwee
hint:
www.google.com
Dingbats 7 Master Poster
... or search DW :/
np complete 8 Newbie Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.