Rob Kremer
	Search Samples: Towers of Hanoi CPSC 433: Artificial Intelligence	Computer Science

Problem Description:

The "Towers of Hanoi" is an old problem where one has 3 pegs and a stack of n disks (of decreasing sizes) on one of the pegs.  The object is to move the stack of disks to one of the other specified pegs.  Sounds easy?  Well, there's a few restrictions:

• One cannot move more than one disk at a time.
• One cannot place a larger disk on top of smaller disk (directly or indirectly)

Give a fully-specified formal model and process for an arbitrary Towers of Hanoi problem (ie: "move n disks from peg x to peg y").  For example, a problem might might be "move 4 disks from peg A to peg C", which gives you s₀ (the initial state) and G (the [singleton] set of goal states):

Also give a fully-specified formal search instance for the problem "move 4 disks from peg A to peg C", and a complete diagram showing all the steps in this search instance and how to read off the solution.

CPSC 433: Artificial Intelligence

Last updated 2013-08-31 00:00

Rob Kremer