CSSE 413: Day 3

Outline

• Discussion of Turing's article
• The Turing Test
• TT: Extra Credit
• The Loebner Prize competition
• Iterative deepening
• Bidirectional search
• Cost functions
• Heuristics: Estimated remaining cost
• Examples of heuristic functions
• Best-first Search
• Class exercise on tracing contents of OPEN and CLOSED data structures.

Background Materials

• Slides on search directions

Assignments

• Day 4, BC: Read about heuristics and best first, or greedy search
• Day 8, BC: Search Programming Assignment. Important Notice: Please do not make any of your code publicly available, whether on your own equipment or inadvertendly on public storage sites. This assignment is courtesy of Dan Klein, UC Berkley. Please notice that the grading server is not set-up yet.