def moves (n, fromTower, toTower, auxTower): if n == 0: return moves (n-1, fromTower, auxTower, toTower) print ("Move disk", n, "from", fromTower, "to", toTov moves (n-1, auxTower, toTower, fromTower) moves (3, 'A', 'C', 'B')

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Write a recursive function, numMoves(), that takes a number representing the number of disks in the Hanoi problem, and returns the number of moves involved. I recommend you start writing this function by modifying the hanoi.py program given. Test cases: numMoves(3) should return 7 and numMoves(4) should return 15. Do not use any global variables.

 

hanoi.py

 

 

def moves (n, fromTower, toTower, auxTower):
if n == 0:
return
moves (n-1, fromTower, auxTower, toTower)
print ("Move disk", n, "from", fromTower, "to", toTower)
moves (n-1, auxTower, toTower, fromTower)
moves (3, 'A', 'C', 'B')
Transcribed Image Text:def moves (n, fromTower, toTower, auxTower): if n == 0: return moves (n-1, fromTower, auxTower, toTower) print ("Move disk", n, "from", fromTower, "to", toTower) moves (n-1, auxTower, toTower, fromTower) moves (3, 'A', 'C', 'B')
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Fibonacci algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education