Scribd Logo
Upload

Welcome to Scribd!

  • 19 views

    Handouts LectureSlides Lecture5 6

    Uploaded by

    priyanka
    The document describes the Towers of Hanoi puzzle. It involves moving a stack of 64 discs of different sizes between three spikes, where discs must be moved one at a time and larger discs cannot rest on top of smaller discs. It suggests solving the puzzle recursively by breaking it down into smaller subproblems of moving fewer discs and building up a solution. An example Python program is provided that uses recursion to print out the necessary moves.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Handouts LectureSlides Lecture5 6

    Uploaded by

    priyanka
    19 views3 pages
    The document describes the Towers of Hanoi puzzle. It involves moving a stack of 64 discs of different sizes between three spikes, where discs must be moved one at a time and larger discs cannot rest on top of smaller discs. It suggests solving the puzzle recursively by breaking it down into smaller subproblems of moving fewer discs and building up a solution. An example Python program is provided that uses recursion to print out the necessary moves.

    Original Description:

    xyz

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes the Towers of Hanoi puzzle. It involves moving a stack of 64 discs of different sizes between three spikes, where discs must be moved one at a time and larger discs cannot rest on top of smaller discs. It suggests solving the puzzle recursively by breaking it down into smaller subproblems of moving fewer discs and building up a solution. An example Python program is provided that uses recursion to print out the necessary moves.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    19 views3 pages

    Handouts LectureSlides Lecture5 6

    Uploaded by

    priyanka
    The document describes the Towers of Hanoi puzzle. It involves moving a stack of 64 discs of different sizes between three spikes, where discs must be moved one at a time and larger discs cannot rest on top of smaller discs. It suggests solving the puzzle recursively by breaking it down into smaller subproblems of moving fewer discs and building up a solution. An example Python program is provided that uses recursion to print out the necessary moves.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    Towers

    of Hanoi
    The story:
    3 tall spikes
    Stack of 64 dierent sized discs start on one
    spike
    Need to move stack to second spike (at which
    point universe ends)
    Can only move one disc at a Dme, and a larger disc
    can never cover up a small disc

    Towers of Hanoi
    Having seen a set of examples of dierent
    sized stacks, how would you write a program
    to print out the right set of moves?
    Think recursively!
    Solve a smaller problem
    Solve a basic problem
    Solve a smaller problem

    def printMove(fr, to):!


    print('move from ' + str(fr) + ' to ' + str(to))!
    !
    def Towers(n, fr, to, spare):!
    if n == 1:!
    printMove(fr, to)!
    else:!
    Towers(n-1, fr, spare, to)!
    Towers(1, fr, to, spare)!
    Towers(n-1, spare, to, fr)!

    You might also like