Artificial Intelligence (W4701)
Homework 1: Search: Problems, Practicalities, and Palindromes
Chapters 1 - 4 from Russel and Norvig (Section 4.3 is optional)
Part I: Written Work
3.3 for rule induction (one rule)..
Could bidirectional search be used for iterative improvement
problems such as n-queens, VLSI and palindrome creation? If so, how?
If not, why not?
4.4, 4.5, 4.6, 4.8
4.13 (parts a, b, c and d only -- no implementation required)
Part II: Palindrome Quest
Alt to pals: n-queens, pegs, 1 person game of your choice, 8-puzzle.
email: evs at cs dot columbia dot edu