Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Examples of Problems: Towers of Hanoi

  • 3 pegs A, B, C
  • 3 discs represented as natural numbers (1, 2, 3) which correspond to the size of the discs
  • The three discs can be arbitrarily distributed over the three pegs, such that the following constraint holds:
        d i is on top of d j d i < d j
  • Initial status: ((123)()())
  • Goal status: (()()(123))
    Move disk to peg
    Applying: Move 1 to C (1 → C)
    to the initial state ((123)()())
    a new state is reached ((23)()(1))
    Cycles may appear in the solution!

Speaker notes:

Content Tools


There are currently no sources for this slide.