CSC384 -- Introduction to Artificial Intelligence
Winter 2010


Assignment 3: Game Tree Search

A3 Help Sessions

We will be conducting several sessions where students can get one-on-one help with their assignments, or just hang out and listen to others' questions. Information about these will be posted below. These will be posted below.

Help sessions for A3 will take place:

Specification of the Assignment

In this assignment, you will be implementing Riversi (aka Othello) using the Minimax and Alpha-Beta pruning algorithms. You will also experiment with techniques to improve the speed of search (e.g. state caching and node ordering). In addition, you have the opportunity to engineer your own game heursitics and compete with others, if you want. You must use the local software and assignment as described below.

Assignment 3 Handout (posted Feb 24)

The following zip files are part of the A3 specification:



Important: It's your responsibility to monitor the A3 Clarifications Page for any clarifications or corrections.

The A3 TA, Vinith, is available via Piazza for questions concering the assignment. If you have a question of a personal nature, please email Vinith at vinith at cs dot utoronto dot edu, or one of the instructors, placing A3 and 384 in the subject header of your message.