Lecture 5.
This morning we were treated to an
animated version of the Towers of Hanoi problem. Thanks go out to Andrew for his
efforts.
We continued with
Towers of Hanoi by walking through the recursive algorithm to obtain all of the
moves for 3 discs. We then formulated and solved a recurrence relation to
determine the number of moves used for solving a problem with
n
discs.
I began with yet another
problem for which we develop a recursive algorithm, the
n
Queens problem. A recursive solution to the
n
Queens problem will be concluded when we next meet on Friday morning.
Posted: Wed - January 17, 2007 at 10:38 AM