You are cordially invited to join us for the
School of Mathematical Sciences
Wednesday, February 14, 2007
3:35 Ð 4:25 p.m.
Ross 2238 (Conference Room)
Speaker: Terry Scott
ÒEight Queens and Knight's Circuit Using Recursion with BacktrackingÓ
Iteration (looping) and Recursion are known to be equally powerful.
However, recursion is extremely powerful when solving problems such as
navigating a maze. This talk will demonstrate the power of recursion and
recursion with backtracking on several interesting problems: Towers of
Hanoi, Eight Queens, and Knight's Tour.