[Webinar] Streamline your web hosting managementRegister Today

x
?
Solved

The Tower of Hanoi problem

Posted on 1998-03-10
7
Medium Priority
?
421 Views
Last Modified: 2013-12-26
I need to write a shell script on a Sun system in K-shell that solves the Tower of Hanoi Problem.  It must use a recursive function.  I'm stumped.  

Sorry, perhaps I should have elaborated.  I have a sample program written out for this problem.  I have the function already set up and it does call itself.  The problem lies in the fact that it doesn't move the disks in the right order.
0
Comment
Question by:KCMSzwak
7 Comments
 
LVL 3

Expert Comment

by:q2guo
ID: 1296111
most of the recursive function can be replaced by using loops.
0
 
LVL 32

Expert Comment

by:jhance
ID: 1296112
Sounds like a homework problem.  How about a hint?

The k-shell provides for function definitions.  So in your script you can define one like:

function blah
{
   # Do some stuff
}

So it follows that you can have blah call itself recursively:

function blah
{
  # Do some stuff
  blah

  # Do some more stuff
}

Don't forget that somewhere you have to test whether blah needs to be called again.  Otherwise, you'll just keep calling blah until the computer's memory runs out.
0
 

Author Comment

by:KCMSzwak
ID: 1296113
Edited text of question
0
Keep up with what's happening at Experts Exchange!

Sign up to receive Decoded, a new monthly digest with product updates, feature release info, continuing education opportunities, and more.

 
LVL 32

Expert Comment

by:jhance
ID: 1296114
Obviously you've programmed it wrong.  Program it correctly and it's likely to work.  From what you've posted, I don't see that any more definitive help is possible.
0
 
LVL 4

Expert Comment

by:jos010697
ID: 1296115
Show me your code and I'll try to fix it (I know next to nothing about the ksh, so
I need your syntax first ;-) In pseudo code:

# from, to == 1, 2, 3, size >= 0
function Hanoi(from, to, size) {

   if (size) {
      Hanoi(from, 6-from-to, size-1);
      move(from, to);
      Hanoi(6-from-to, to, size-1);
   }

kind regards,

Jos aka jos@and.nl

0
 

Expert Comment

by:dps96r
ID: 1296116
There are also a range of non-recursive solutions to the towers
of hanoi problem. A stack should not be too hard to improvise if
the syntsx is something close to a bourne shell--just use a stack
pointer (i.e. counter) and eval to get the right number of levels
of shell expansion. This probably leaves some values around but
unset fixes that if you want the fineese. [I would be unlikely to
bother myself].
0
 

Accepted Solution

by:
shivak earned 100 total points
ID: 1296117
#!/bin/ksh

# A recurssive function to perform the moves
hanoi()
{
    if [ $1 -ne 0 ]
    then
        hanoi `expr $1 - 1` $2 $4 $3
        echo "Move disk $1 from peg $2 to peg $3"
        hanoi `expr $1 - 1` $4 $3 $2
    fi
}


#main program
echo "Enter the number of disks :"
read x
if [ "$x" -ge 0 ]
then
    # Call hanoi to move N disks from peg A to peg C
    # using peg B
    hanoi $x A C B
else
    echo Its invalid
fi 2>/dev/null

0

Featured Post

Hire Technology Freelancers with Gigs

Work with freelancers specializing in everything from database administration to programming, who have proven themselves as experts in their field. Hire the best, collaborate easily, pay securely, and get projects done right.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Introduction: Hints for the grid button.  Nested classes, templated collections.  Squash that darned bug! Continuing from the sixth article about sudoku.   Open the project in visual studio. First we will finish with the SUD_SETVALUE messa…
Introduction: Dialogs (1) modal - maintaining the database. Continuing from the ninth article about sudoku.   You might have heard of modal and modeless dialogs.  Here with this Sudoku application will we use one of each type: a modal dialog …
This video will show you how to get GIT to work in Eclipse.   It will walk you through how to install the EGit plugin in eclipse and how to checkout an existing repository.
Stellar Phoenix SQL Database Repair software easily fixes the suspect mode issue of SQL Server database. It is a simple process to bring the database from suspect mode to normal mode. Check out the video and fix the SQL database suspect mode problem.
Suggested Courses
Course of the Month8 days, 17 hours left to enroll

590 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question