2015-11-05 Hanoi

posted Nov 5, 2015, 6:27 AM by Samuel Konstantinovich   [ updated Nov 5, 2015, 6:27 AM ]
Goal: Hanoi

Lecture on Hanoi.
It is a bad day to be
Absent from my class.
-K

Do Now:
How many seconds in a year?

Towers of Hanoi
goal:
-Move all disks onto a different tower.
rules:
-Move one disk at a time.
-Never place a disk onto a smaller disk.


What is the minimum number of moves required to move 2,3,4 disks?

What is the formula to calculate the required moves for n disks? 

How is this related to computer science?

Recursive definition of solving n disks?

What is Moore's Law?

What is the singularity?


Comments