|
General Game Playing
|
General Artificial Intelligence
|
Course Overview
General game players are computer systems able to play strategy games based solely on formal game descriptions supplied at "runtime". (In other words, they don't know the rules until the games start.) General Game Playing (GGP) is an interesting application in its own right. It is intellectually engaging and more than a little fun. But it is much more than that. It provides a theoretical framework for modeling discrete dynamic systems and for defining rationality in a way that takes into account problem representation and complexities like incompleteness of information and resource bounds. It has practical applications in areas where these features are important, e.g. in business and law. More fundamentally, it raises questions about the nature of intelligence and serves as a laboratory in which to evaluate competing approaches to artificial intelligence.
This course is a hands-on introduction to GGP. Theoretical background is provided through lectures and readings, but the main pedagogical value of the course derives from the use of this theory to create general game playing programs able to perform effectively.
All of the course materials are online here. There are links to lessons, background readings, resources, the Gamemaster competition system, and the course forum. Note that, as you proceed through the online materials, you may occasionally encounter problems. Apologies in advance for this. We are in the midst of revamping the course. You may get extra credit for reporting such problems (especially if your reports are not especially irate).
There will be ten in-person class sessions. See the table below for a summary of the topics of these sessions and their locations. Note that you are expected to attend all sessions (unless there are extreme extenuating circumstances).
Date | Topic | Location | Time |
---|
April 2 |
Introduction |
Gates 403 |
4:30 - 6:20 |
April 9 |
Game Description |
Gates 403 |
4:30 - 6:20 |
April 16 |
Complete Search |
Gates 403 |
4:30 - 6:20 |
April 23 |
Incomplete Search |
Gates 403 |
4:30 - 6:20 |
April 30 |
Statistical Methods |
Gates 403 |
4:30 - 6:20 |
May 7 |
Metagaming |
Gates 403 |
4:30 - 6:20 |
May 14 |
Logical Optimization |
Gates 403 |
4:30 - 6:20 |
May 21 |
Game Reformulation |
Gates 403 |
4:30 - 6:20 |
May 28 |
Really General Game Playing |
Gates 403 |
4:30 - 6:20 |
June 4 |
Final Competition |
Gates 403 |
4:30 - 7:30 |
All work in the course must be done in teams; and, except in extreme circumstances, all team members will receive the same grade. Grades for the course will be based on (1) weekly assignments, (2) performance in competitions, and (3) a final report. The majority of the assignments concern the development of a functioning general game playing program. Your program does not need to win competitions to receive a perfect grade; however, it must function correctly and illustrate the lessons of the course. That said, there will be extra credit for especially noteworthy performance in competitions. People who take CS227B tend to immerse themselves in the course and do good work; and, with occasional exceptions, most students receive high grades.
Important note: we use elementary JavaScript in all our examples and software libraries; and, in a departure from the past, we would like you to use JavaScript in building your players. JavaScript is quite easy to learn and has the merit of running natively in World Wide Web browsers. If you are unfamiliar with the language, you can learn more by clicking here or here.
Mike Genesereth |
Email: genesereth@stanford.edu |
Office: Gates 308 |
Office Hours: Wed 3:00 pm - 4:00 pm |
|
Butch Nasser |
Email: ban@stanford.edu |
Location: TBD |
Office Hours: TBD |
|
|