Unlike classical game theory, the field of combinatorial game theory analyzes two-player games of complete information where players take turns. A complete information game is one such as Chess, where the entire situation is known to both players. This is in contrast with Poker, where cards in opponents' hands are, presumably, hidden. The complexity of combinatorial games comes from the large number of possible sequences of moves rather than from lack of knowledge of an opponent's decisions.
In the early 1970s, John Conway initiated an axiomatic theory of partisan games, many fruitful ramifications and extensions of which have continued to evolve and develop ever since. The pioneering works in this subject include John Conway's On Numbers and Games, Don Knuth's Surreal Numbers and the the playful yet profound treatise, Winning Ways by Elwyn Berlekamp, John Conway and Richard Guy. This latter book uncovered many new games, which they and others have partially or completely analyzed.
This week long seminar will be a hands-on investigation of combinatorial game theory aimed at faculty from all fields of mathematics. Activities will include lectures, problem solving sessions, open problem investigations, tournaments, and computer exercises.
We will recruit a couple other researchers to assist Professor Berlekamp with the seminar activities.
The seminar registration is $225 per participant, which includes a copy of Winning Ways and a games kit. You can print out the registration form in postscript or pdf.
Math/Computer Science Department
Gustavus Adolphus College
800 West College Avenue
St. Peter, MN 56082-1498
Phone: (507) 933-7469
Fax: (507) 933-7041
Please post: flyer in postscript or pdf
Registration form in postscript or pdf
Schedule and directions in postscript or pdf