Scribd
Upload
104 views

Recursion: Reading: Savitch, Chapter 11

The document discusses the Towers of Hanoi problem and provides Java code to solve it using recursion. It introduces the Towers of Hanoi problem where the goal is to move disks from the first peg to the third peg following two rules: only one disk can be moved at a time and larger disks cannot be placed on top of smaller disks. It then provides a TowersOfHanoi class with methods to set up the puzzle with a specified number of disks and recursively solve it by moving disks between pegs, along with a SolveTowers class with main to test it.

Uploaded by

mhòa_43
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
104 views

Recursion: Reading: Savitch, Chapter 11

The document discusses the Towers of Hanoi problem and provides Java code to solve it using recursion. It introduces the Towers of Hanoi problem where the goal is to move disks from the first peg to the third peg following two rules: only one disk can be moved at a time and larger disks cannot be placed on top of smaller disks. It then provides a TowersOfHanoi class with methods to set up the puzzle with a specified number of disks and recursively solve it by moving disks between pegs, along with a SolveTowers class with main to test it.

Uploaded by

mhòa_43
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 17

20/1

Recursion
Reading: Savitch, Chapter 11

20/2
Recursion Case Study
The Towers of Hanoi
20/3
The goal: to move all of the disks from their
original (first) peg to the destination (third)
peg.

The rules:
can move one disk at a time.
cannot put a larger disk on top of a smaller
disk.
20/4
The Towers of Hanoi
20/5
The Towers of Hanoi
20/6
The Towers of Hanoi
20/7
The Towers of Hanoi
20/8
The Towers of Hanoi
20/9
The Towers of Hanoi
20/10
The Towers of Hanoi
20/11
The Towers of Hanoi
20/12
// TowersOfHanoi.java By Lewis/Loftus

public class TowersOfHanoi {
private int totalDisks;

//Sets up the puzzle with the specified number of disks.
public TowersOfHanoi (int disks) {
totalDisks = disks;
}


20/13
//Performs the initial call to moveTower to solve the
//puzzle.
//Moves the disks from tower 1 to tower 3 using tower 2.

public void solve () {
moveTower (totalDisks, 1, 3, 2);
}

20/14
//Moves the specified number of disks from one tower to
//another by moving a subtower of n-1 disks out of the
//way, moving one disk, then moving the subtower back.
//Base case of 1 disk.
private void moveTower (int numDisks, int start, int end,
int temp) {
if (numDisks == 1)
moveOneDisk (start, end);
else {
moveTower (numDisks-1, start, temp, end);
moveOneDisk (start, end);
moveTower (numDisks-1, temp, end, start);
}
}
20/15
//Prints instructions to move one disk from the
//specified start tower to the specified end tower.

private void moveOneDisk (int start, int end) {
System.out.println ("Move one disk from " + start + "
to " + end);
}
}
20/16
// SolveTowers.java By Lewis/Loftus

public class SolveTowers {

public static void main (String[] args) {
TowersOfHanoi towers = new TowersOfHanoi (4);

towers.solve();
}
}
20/17
Program execution
% java SolveTower
Move one disk from 1 to 2
Move one disk from 1 to 3
Move one disk from 2 to 3
Move one disk from 1 to 2
Move one disk from 3 to 1
Move one disk from 3 to 2
Move one disk from 1 to 2
Move one disk from 1 to 3
Move one disk from 2 to 3
Move one disk from 2 to 1
Move one disk from 3 to 1
Move one disk from 2 to 3
Move one disk from 1 to 2
Move one disk from 1 to 3
Move one disk from 2 to 3

You might also like