Read
- Chapters 3 – 6 in Russell and Norvig
- Problems 3.15 and 3.16 in Russell and Norvig. You do not
have to turn in answers to these, but you need to spend time
thinking about them.
- More robot articles from http://www.aaai.org/AITopics//html/robots.html
Follow the instructions given on homework assignment #1 about the structure
of your CVS repository for your homework assignments and prjects, the
requirements to use a separate file for each exercise (or part thereof),
and to make each file self-contained (question + answer).
Print out the files comprising your answers to the following problems
(2up to save trees) and turn them in at the beginning of class on
February 23.
- Put together some pieces of the robot kit you purchased for
Homework #1 and demonstrate that it can move in response
to some piece of software you wrote yourself.
- Problem 3.8 in Russell and Norvig
- Problem 3.9 in Russell and Norvig
- Problem 4.1 in Russell and Norvig
- Would A* be optimal with an admissible heuristic if we
checked for goal states upon generation rather than expansion?
Give an articulate, solid proof or counterexample, whichever
is appropriate.
- Problem 4.5 in Russell and Norvig
- Implement an N-Queens solver using random restart hill climbing.
- Problem 4.11 in Russell and Norvig
- Explain how to solve TSPs with hill climbing.
- Problem 5.5 in Russell and Norvig
- Problem 5.6 in Russell and Norvig
- Problem 6.3 in Russell and Norvig (It may help to do 6.1 first)