Fall 2005

Department of Electronic Engineering, National Yunlin University of Science and Technology

Course    : AI Programming

Time       : Monday 9:10-12

Place       : ES 102

Instructor: ¶À¥Ã¼s

Office     : ES 705 (Extension: 4330)

AI Lab    : ES 715 (Extension: 4391)

Email      : wongwk@yuntech.edu.tw

Office Hours: Thursday 10-11 am, Friday 10-11 am.

Syllabus

Related Webs:

• Korean Advanced Institute of Science and Technology, CS370 Symbolic Programming. http://nlp.kaist.ac.kr/~cs370
• University of British Columbia, Canada, Poole's CS322 Introduction to Artificial Intelligence.  (Chapter 2, Lectures 1~6).
• SWI-Prolog. A popular public domain Prolog from the Netherlands. http://www.swi-prolog.org/
• University of California at Berkeley, Russell's AI course. http://www.cs.berkeley.edu/~russell/classes/cs188/f05/

Introductory notes on Java implementation of Chinese chess

Assignments:

Assignment 1: SLD derivation, Java implementation of Chinese chess interface.

Assignment 2:  Basic prolog programming, palindrome check, sum of list, max-depth automata, knight's path on chessboard; improvement of Java program in Assignment 1.

Assignment 3: Depth-first search, breadth-first search applications of the blocks world; node-counting in best-first search application to the eight-puzzle problem. Experiment with various heuristic functions. Compare their heuristic power and the number of nodes generated.

Assignment 4: Consider the eight-puzzle problem. Compare the best-first A* search, iterative deepening A* search, and recursive best-first search. Experiment with various start states.

Final project: Design and implement a five-in-a-row tic-tac-toe game that uses the minimax search.