| CSC 261 | Grinnell College | Fall, 2007 |
| Artificial Intelligence | ||
Unless otherwise indicated, textbook references are to Stuart J. Russell and Peter Norvig, Artificial Intelligence: A Modern Approach (Second Edition), Prentice-Hall, 2003.
Unless otherwise stated,
| Due Date | Collaboration Allowed | Chapter | Problems |
|---|---|---|---|
| Wed., Sept. 19 | Yes | 3 | 3.7a,d |
| Yes | 4 | 4.2, 4.3, 4.11 | |
| Yes | Sup. Prob. | 1 | |
| Mon. Oct 1 | Yes | 8 | Group Exercise on Predicate Calculus |
| Fri. Oct 19 | Yes | 8-9 | Group Exercise on Proof by Resolution |
| Wed. Nov 7 | Yes | Sup. Prob. | 2 |
Page 106 shows two possible heuristic functions (h1 and h2). Use these heuristic functions h1 and h2 to show the first 3 moves that might be taken to solve the 8-puzzle, beginning with the start state shown in Figure 4.7 (page 105) and using the A* algorithm.
In addition, briefly explain how you determined these initial moves. As part of your discussion, indicate what choice you made when the A* algorithm provides two or more alternatives with the same priority.
Placement Cases for Statistics:
For this assignment, each CSC 261 student is to fill out 5 data forms regarding the background of possible incoming students.
This document is available on the World Wide Web as
http://www.cs.grinnell.edu/~walker/courses/261.fa07/assignments.shtml
|
created 29 August 2007 last revised 2 November 2007 |
|
| For more information, please contact Henry M. Walker at (walker@cs.grinnell.edu) |