[ L01 L02 L03 L04 L05 L06 L07 L08 L09 L10 L11 L12 L13 L14 L15 L16 L17 L18 L19 L20 L21 L22 L23 ]
Before this lecture you need to watch the Sudoku videos in module 9b carefully. We are saying watch carefully not work through, but emphasis on the carefully.
The starters for this lecture are:
Again, search programs build on every single thing we've learned so far except HtDW! HtDD, HtDF, atomic data, compound data, lists, trees, backtracking, generative recursion — all of it! These are truly excellent problems to practice what you have learned so far in the course, and even if they are difficult for you they are excellent problems to feel good about how much you have learned.
To review today's material:
nqueens-starter.rkt | Just has the problem statement. |
nqueens-v1.rkt | Also has data definitions, the start of the main search function, and a useful helper. |
nqueens-v2.rkt | Also has the arb-tree template. |
nqueens-solution.rkt | Complete solution. |
The solution for this lecture is:
Be sure to complete the before lecture section of Lecture 18 before that lecture.