Heuristic Search and Constraint Processing

3 units

The course has three main parts and covers the main topics of heuristic search and constraint processing. The first part focuses on single-agent heuristic search problems and algorithms. The second part deals with adversary game playing problems, strategies and algorithms. The third part considers constraint problems and constraint processing techniques. The course will cover basic and advanced search techniques as well as their performance analysis. It will also provide ample examples of real-world problems and applications. The students will have opportunity to write programs to solve some selected search problems. Prerequisites: CSE 247 and CSE 511A.