CS 470/570

From CS Wiki
Jump to: navigation, search

CS 470/570: Artificial Intelligence

Catalog Description: Concepts and techniques involved in artificial intelligence. Lisp, goal-directed searching, history trees, inductive and deductive reasoning, natural language processing, and learning.

Type: CS 470 is a Technical Elective for CS majors. CS 570 is available for graduate credit.

Total Credits: 3

Course Coordinator: Terry Soule

URL: http://www2.cs.uidaho.edu/~tsoule/cs470/cs470.html

Prereq: CS 210

Textbook: Russell and Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, 1995 or equivalent text.

Major Topics Covered

  1. Agents (3 lectures)
  2. Philosophy of artificial intelligence (3 lectures)
  3. Search (3 lectures)
  4. Advanced search / A* search (2 lectures)
  5. Min-max search (2 lectures)
  6. Alpha-beta pruning (2 lectures)
  7. Multi-player and probabilistic games (2 lectures)
  8. Constraints (3 lectures)
  9. Other Topics vary by semester but may include:
    1. Logical reasoning (6 lectures)
    2. Knowledge representation (3 lectures)
    3. Neural Networks (3 lectures)
    4. Planning (3 lectures)
    5. Decision trees (3 lectures)
    6. Bayesian networks (3 lectures)

Course Outcomes

After taking CS 470/570, a student should:

  1. Be able to analyze the time and space complexity of search algorithms (a)
  2. Be able to analyze a problem and find an appropriate AI technique (if any exists) to apply to it (e)
  3. Have a general understanding of the potential impact of weak and strong AI on society (j)
  4. Be able to write algorithms for:
    • Basic search (k)
    • A* search (including creating admissible or inadmissible heuristics) (k)
    • Adversarial search (k)
    • Local search (k)
    • Constraint satisfaction (k)