1. Backtracking CSC 172 SPRING 2004 LECTURE 11

2. Reminders  Project 3 (mastermind) is due before Spring break  Friday, March 5 th 5PM  Computer Science Office – 7 th floor CSB  Read Sections 7.7 & 10.2 (Backtracking)  Quiz next Tuesday  Midterm Tuesday 3/2  Review Session Today 5PM – Jon Shor – 726 CSB

3. BACKTRACKING  Backtracking is a recursive strategy to explore possible solutions.

4. Design Example  The “N-queens” problem  Given an n-by-n checkerboard place n queens on the board in such a way that no two queens are mutually attacking each other.  Issues:  What data structure?  What algorithm?