Member Avatar for MoBaT 
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?
  • 4 Contributors
  • 3 Replies
  • 115 Views
  • 14 Hours Discussion Span
  • Latest Post Latest Post by np complete

Recommended Answers

All 3 Replies

Member Avatar for iamthwee

hint:

www.google.com

Member Avatar for Dingbats

... or search DW :/

Member Avatar for np complete

This is a problem of using recursion.See this

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.