The question is intended as a self-test for readers. Answers may be found in Appendix C.
The algorithm in the towers.java program involves
a. “trees” that are data storage devices.
b. secretly putting small disks under large disks.
c. changing which columns are the source and destination.
d. moving one small disk and then a stack of larger disks.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.