Sep 15
This third week of the term, Sep 15 & 17,
we're looking at chapters 3,4,5 in the AIMA
textbook, which are discussing ways of
the various ways of searching when
the problem space gets big.
The assignment for this week is to pick
one of several and code some sort of specific
project.
Choices include
- genetic algorithms
- hill climbing
- simulated annealing (an elaboration of hill climbing)
- min/max game search (though we've done that in the algorithms class)
Let's go over each of these, describing in hand-wavey terms how that search approach works.
Then let's discuss where you are and what you're working on.
- Sam wrotre a k-sat local search, similar to a hill climbing approach. His code is on github .
- Jim put together the start of a genetic nqueens example, which may be a starting point for your project. See code/genetic_nqueens .
- others ?
