This course will cover the theory and practice of finding optimal and satisficing solutions to one-player and two-player combinatorial games, including such popular games as Sokoban, Othello, checkers, chess, backgammon, bridge, and CCGs. Simple applications in decision theory and economics may also be discussed.
The course will emphasize implementation of state-of-the-art solution techniques. Prerequisites include CS350 (Algorithms) or equivalent experience, plus fluency in some reasonable programming language. Previous AI experience is not required, but may prove helpful.
For further information, please contact Bart Massey.