Programming Forums > Application Development > C++

ergawy · Feb 21st, 2006, 4:08 PM

Can you find a solution for the 4 needle towers of hanoi problem according to these rules:
� First move the topmost discs (say the top k discs) to one of the spare needles.
� Then use the standard three needles strategy to move the remaining
n − k discs (for a general case with n discs) to their destination.
� Finally, move the top k discs into their final destination using the four needles.

thanks in advance

MBirchmeier · Feb 21st, 2006, 4:16 PM

Quote:

Originally Posted by ergawy

Can you find a solution for the 4 needle towers of hanoi problem according to these rules:
� First move the topmost discs (say the top k discs) to one of the spare needles.
� Then use the standard three needles strategy to move the remaining
n − k discs (for a general case with n discs) to their destination.
� Finally, move the top k discs into their final destination using the four needles.

thanks in advance

Yup... I know how to solve the problem... do you?

you might want to read up on how to ask a question here

-MBirchmeier

Arevos · Feb 21st, 2006, 4:36 PM

Hint: Recursion makes this easier.

Infinite Recursion · Feb 21st, 2006, 4:50 PM

Please tell me you tried to code this yourself first, obviously this is a homework assignment. What have YOU done?

TCStyle · Feb 21st, 2006, 6:55 PM

This may be of interest:
http://www.csee.umbc.edu/331/fall00/homework/hw4/

pal · Feb 22nd, 2006, 3:37 AM

I recommend you using the best of your logic and wisdom.
References can definately be found on the Internet, but I also recommend you to write it out yourself first and then post up the code if there are any detailed technical problems that you need to ask.

Feb 21st, 2006, 4:08 PM	#1
ergawy Newbie Join Date: Feb 2006 Posts: 7 Rep Power: 0	does anybody know how to solve this problem Can you find a solution for the 4 needle towers of hanoi problem according to these rules: � First move the topmost discs (say the top k discs) to one of the spare needles. � Then use the standard three needles strategy to move the remaining n − k discs (for a general case with n discs) to their destination. � Finally, move the top k discs into their final destination using the four needles. thanks in advance

Feb 21st, 2006, 4:50 PM	#4
Infinite Recursion Programming Guru Join Date: Jul 2004 Location: United States Posts: 3,473 Rep Power: 8	Please tell me you tried to code this yourself first, obviously this is a homework assignment. What have YOU done? __________________ http://jasonpowers.net "There are a thousand hacking at the branches of evil to one who is striking at the root."

Feb 21st, 2006, 6:55 PM	#5
TCStyle Programmer Join Date: Jan 2005 Location: Albany, NY Posts: 43 Rep Power: 0	... This may be of interest: http://www.csee.umbc.edu/331/fall00/homework/hw4/ __________________ meh...

Thread Tools
Show Printable Version Email this Page
Display Modes
Linear Mode Switch to Hybrid Mode Switch to Threaded Mode

Feb 21st, 2006, 4:36 PM	#3
Arevos Programming Guru Join Date: Aug 2005 Location: England Posts: 1,499 Rep Power: 5	Hint: Recursion makes this easier.

Feb 22nd, 2006, 3:37 AM	#6
pal Programmer Join Date: Mar 2005 Location: Washington Posts: 91 Rep Power: 4	I recommend you using the best of your logic and wisdom. References can definately be found on the Internet, but I also recommend you to write it out yourself first and then post up the code if there are any detailed technical problems that you need to ask.

Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)

Programming Forums > Application Development > C++

does anybody know how to solve this problem