Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
b. In this version of the exercise, transform the following function solving the problem of the Towers of Hanoi into an iterative version using the transformation described in class. Towers of Hanoi. You have 3 vertical poles (towers), one of them starting out with n discs stacked up in decreasing order of size. Thus, you can assume that disc i, with i going form 0 at the base to n-1 at the top, has a radius equal to n-i. The two other poles are empty. You can only move one disc at a time from one pole to another. You cannot stack a disc of larger radius on top of one of smaller size. The goal is to move all the discs from the first tower to the second one, using the third tower as reserve. In the following recursive version, the operation is accomplished by moving the top n-1 discs from the first tower to the third one using the second as reserve, then moving the largest disc to the second tower, then moving all n-1 discs from the third tower to the second using the first one as reserve. Here is the code: (defun hanoi (n t1 t2 t3) (if (= n 1); base case (my-print "move " t1 t2 "\n") ; else (hanoi (- n 1) t1 t3 t2) ; recursive call: notice parameter order H H (my-print "move t1 " t2 "\n") (hanoi (- n 1) t3 t2 t1))) ; another recursive call (defun my-print (&rest L) "Prints any number of arguments with princ and returns true." (mapc 'princ L) t) The function can be called either as (hanoi 4 'a 'b 'c) or (hanoi 4 1 2 3)

b. In this version of the exercise, transform the following function solving the problem of the Towers of Hanoi into an iterative version using the transformation described in class. Towers of Hanoi. You have 3 vertical poles (towers), one of them starting out with n discs stacked up in decreasing order of size. Thus, you can assume that disc i, with i going form 0 at the base to n-1 at the top, has a radius equal to n-i. The two other poles are empty. You can only move one disc at a time from one pole to another. You cannot stack a disc of larger radius on top of one of smaller size. The goal is to move all the discs from the first tower to the second one, using the third tower as reserve. In the following recursive version, the operation is accomplished by moving the top n-1 discs from the first tower to the third one using the second as reserve, then moving the largest disc to the second tower, then moving all n-1 discs from the third tower to the second using the first one as reserve. Here is the code: (defun hanoi (n t1 t2 t3) (if (= n 1); base case (my-print "move " t1 t2 "\n") ; else (hanoi (- n 1) t1 t3 t2) ; recursive call: notice parameter order H H (my-print "move t1 " t2 "\n") (hanoi (- n 1) t3 t2 t1))) ; another recursive call (defun my-print (&rest L) "Prints any number of arguments with princ and returns true." (mapc 'princ L) t) The function can be called either as (hanoi 4 'a 'b 'c) or (hanoi 4 1 2 3)

Database System Concepts
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
See similar textbooks
icon
Related questions
Question

In Lisp

b. In this version of the exercise, transform the following function solving the problem of the Towers of Hanoi into an iterative version using the transformation described in class. Towers of Hanoi. You have 3 vertical poles (towers), one of them starting out with n discs stacked up in decreasing order of size. Thus, you can assume that disc i, with i going form 0 at the base to n-1 at the top, has a radius equal to n-i. The two other poles are empty. You can only move one disc at a time from one pole to another. You cannot stack a disc of larger radius on top of one of smaller size. The goal is to move all the discs from the first tower to the second one, using the third tower as reserve. In the following recursive version, the operation is accomplished by moving the top n-1 discs from the first tower to the third one using the second as reserve, then moving the largest disc to the second tower, then moving all n-1 discs from the third tower to the second using the first one as reserve. Here is the code: (defun hanoi (n t1 t2 t3) (if (= n 1); base case (my-print "move " t1 t2 "\n") HI 11 ; else (hanoi (- n 1) t1 t3 t2) (my-print "move "t1" t2 "\n") H (hanoi (- n 1) t3 t2 t1))) ; another recursive call The function can be called either as (hanoi 4 'a 'b 'c) or (hanoi 4 1 2 3) ; recursive call: notice parameter order (defun my-print (&rest L) "Prints any number of arguments with princ and returns true." (mapc 'princ L) t)
Transcribed Image Text:b. In this version of the exercise, transform the following function solving the problem of the Towers of Hanoi into an iterative version using the transformation described in class. Towers of Hanoi. You have 3 vertical poles (towers), one of them starting out with n discs stacked up in decreasing order of size. Thus, you can assume that disc i, with i going form 0 at the base to n-1 at the top, has a radius equal to n-i. The two other poles are empty. You can only move one disc at a time from one pole to another. You cannot stack a disc of larger radius on top of one of smaller size. The goal is to move all the discs from the first tower to the second one, using the third tower as reserve. In the following recursive version, the operation is accomplished by moving the top n-1 discs from the first tower to the third one using the second as reserve, then moving the largest disc to the second tower, then moving all n-1 discs from the third tower to the second using the first one as reserve. Here is the code: (defun hanoi (n t1 t2 t3) (if (= n 1); base case (my-print "move " t1 t2 "\n") HI 11 ; else (hanoi (- n 1) t1 t3 t2) (my-print "move "t1" t2 "\n") H (hanoi (- n 1) t3 t2 t1))) ; another recursive call The function can be called either as (hanoi 4 'a 'b 'c) or (hanoi 4 1 2 3) ; recursive call: notice parameter order (defun my-print (&rest L) "Prints any number of arguments with princ and returns true." (mapc 'princ L) t)
Expert Solution
steps

Step by step

Solved in 3 steps

SEE SOLUTIONCheck out a sample Q&A here
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.
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
SEE MORE TEXTBOOKS