May 16

Questions about anything?

I hope you're hard at work on your final projects ...

This week: a few classic problems, looking at code and discussing the details. Today, the "N queens problem" (several different sorts of searching); Thursday some "dynamic programming" with the "making change" problem and perhaps others.

N queens

We'll work through my code/n_queens, perhaps adding in some diagnostic print statements to see what's going on.

Here are some places to read about this.

• wikipedia: eight queens puzzle
• wikipedia: Heap's algorithm
• wikipedia: tree traversal
• wikipedia: hill climbing (a.k.a. gradient descent)
• geeksforgeeks: n queens hill climbing

We talked a bit about python's "generator" syntax, and I showed a short example ... which is attached.

attachments

		last modified	size
	generator.py	Mon May 16 2022 03:02 pm	261B