CS 827 - ARTIFICIAL INTELLIGENCE


Meeting 1: Wed Feb 4 15:30:09 EST 2015

Meeting 2: Wed Mar 4 15:37:42 EST 2015

Describing search algorithms:

Global Search algorithms

How to determine which approach to use?

Hint: all course units (except 5 and 6) are worked out with examples at: http://csis.pace.edu/~benjamin/teaching/cs627

Games algorihtms

Local Search Algorithm

Meeting 3: Wed Mar 25 15:40:53 EDT 2015

Constraint Satisfaction

Reviewing Constraint Satisfaction Problems:

- ex: place n queen in NxN chess board with no queen attacking the other.
- See: Example: Cryptarithmetic (chapter5.pdf page.9) and http://csis.pace.edu/~benjamin/teaching/cs627/webfiles/csp/csp.15b.html
- See: http://csis.pace.edu/~benjamin/teaching/cs627/webfiles/csp/csp.1.html

Logic

vacuously true.

See exercise 8.9:

- in exam , we will have similar questions.

Meeting 4: Wed Apr 15 15:36:15 EDT 2015

This is the Final Meeting of this class

Qualifying exam preminlinary date: Wed. May, 27 2015