CS227B: General Game Playing
Announcements
- Paper by Stephan Schiffel on Symmetry Detection.
- New, Improved Slides for lecture 6. Now with more on Propositional Nets!
- Paper on Factoring Propositional Automata added to Readings. Not easy to read but gives a formal definition of Propositional Nets and suggests a few methods for factoring.
- TA Office hours are in Gates 108
- Please submit homework to cs227b@gmail.com
- The course newsgroup is available at su.class.cs227b if you are still looking for group members.
- The course meets in Gates 2A, which is the open space on the second
floor of Gates. The first class is Wednesday, April 1st at 4:15PM
- Course email lists have been created. With questions, contact
cs227b-spr0809-staff@lists.stanford.edu.
General Information
Schedule
Web Resources
|
Lisp Implementations
|
Java Implementations
|
Relevant Readings
Background Readings
- Hopcroft, Ullman: Introduction to Automata Theory, Languages, and Computation,
Addison-Wesley.
- Peterson: Petri Nets
- Russell and Norvig: Artificial Intelligence: A Modern Approach Prentice Hall.
- Genesereth:
Introduction to Computational Logic
- Luce, Raifa: Game Theory
|
|