Home /  Combinatorial Game Theory Research Workshop

Workshop

Combinatorial Game Theory Research Workshop July 24, 2000 - July 28, 2000
Registration Deadline: July 28, 2000 over 24 years ago
To apply for Funding you must register by: April 24, 2000 over 24 years ago
Parent Program: --
Organizers Elwyn Berlekamp, David Blackwell, John Conway, Aviezri Fraenkel, Richard Guy, Jurg Nievergelt, Richard Nowakowski, Jonathan Schaeffer, Ken Thompson and David Wolfe
Speaker(s)

Show List of Speakers

Description
Parent Summer Graduate Workshop: Combinatorial Game Theory (Summer Graduate Workshop II) This workshop will cover all aspects of the theory of combinatorial games, including algorithms for such games, complexity of those algorithms, connections with artificial intelligence and economics, cellular automata, and aspects of specific games, including Go, Amazons, Domineering, Dots and Boxes, etc. In many ways, this workshop is a sequel to a conference held at MSRI in July, 1994, whose proceedings ``Games of No Chance'' were published by Cambridge University Press, MSRI vol. 29. The workshop immediately follows a 2-week summer graduate program at MSRI on this topic, and it is expected that many of the graduate students will stay for the workshop. Schedule: Combinatorial Game Theory Workshop (subject to change) Monday, July 24 morning: GO 8:15 am Check-in begins 8:45 am David Eisenbud Welcome from MSRI's Director 9:00 am Elwyn Berlekamp Environmental Go 10:00 am Morning Tea 10:30 am Bill Spight Analysis of the 4/21/98 Jiang-Rui endgame 11:00 am Bill Fraser Analysis Tools: "Brute-Force" and "Winsolve" 11:30 am Matthew Cook Still Life 12:00 noon Lunch Monday, July 24, afternoon: ARTIFICIAL INTELLIGENCE 1:30 pm Jurg Nievergelt Half-a-century of computer chess: The longest running experiment in knowledge engineering 2:30 pm Michael Lachmann, Cris Moore, Ivan Rapaport Who wins Domineering on rectangular boards? 3:00 pm Afternoon Tea 3:30 pm Fabian Maeser Global threats in combinatorial games: A computation model with applications to chess endgames 4:00 pm Vadim Anshelevich The game of Hex: The hierarchical approach Tuesday, July 25, morning: PARTIZAN GAMES 9:00 am Tom Ferguson Another form of Matrix Nim 10:00 am Morning Tea 10:30 am Frank Harary, Wolfgang Slany, Oleg Verbitsky A symmetric strategy in graph avoidance games 11:00 am Len Haff A natural map of numbers and combinatorial games 12:00 am Georg Snatzke Amazons 12:30 noon Lunch Tuesday, July 25, afternoon: CHARACTERISTIC TWO 1:30 pm Richard Nowakowski The game of End-Nim 2:30 pm Katherine Scott Loony dots and boxes endgame 3:00 pm Afternoon Tea 3:30 pm Howard Landman Alternate proof of the periodicity of the Sprague Grundy Function of Wythoff's Game 4:00 pm Dong Geon Kim A decoding scheme for 4-ary lexicodes with minimum distance 4 5:00 pm Reception Wednesday, July 26, morning: PUZZLES 9:00 am Demo Session, north end of second floor 10:30 am Morning Tea 11:00 am Eric Demaine, Martin Demaine, Helena Verrill Coin-moving puzzles 11:30 am Jeremiah Farrell Games on word configurations 12:00 am Cris Moore One-dimensional Peg Solitaire 12:15 noon Lunch Wed., July 26, afternoon: PROBABILITISTIC, MULTI-PLAYER 1:30 pm Matthew Ginsberg Games of some chance: Extending computational techniques to games of imperfect information 2:30 pm Arthur Benjamin Le Her 3:00 pm Afternoon Tea 3:30 pm Hiroyuki Iida An approach to three-person game programming: A case study using Mediocrity 4:00 pm Open Problem Session Thursday, July 27: INFINITE GAMES AND CELLULAR AUTOMATA 9:30 am John Conway TBA 10:30 am Morning Tea 11:00 am Scott Huddleston,Jerry Shurman Transfinite Chomp 11:30 am Jacob Lurie Vines 12:00 noon Lunch 1:30 pm David Wolfe Go endgames are hard 2:00 pm David Eppstein Searching for spaceships 2:30 pm Afternoon Tea 3:00 pm Aviezri Fraenkel Two-player games on cellular automata Friday, July 28 (also Berlekamp Conference) 9:00 am Martin Mueller Arrows: A Program that Plays Amazons 9:30 am Takenobu Takizawa An Application of Mathematical Game Theory to Go Endgames: Some Width-Two-Entrance Rooms with/without Kos 10:00 am Morning Tea 10:30 am Sol Golomb Hypercube Tic-Tac-Toe 11:30 am Lunch 1:15 pm David Moews The abstract structure of the group of games 1:30 pm Jonathan Schaeffer The Games Computers (and People) Play 2:30 pm Afternoon Tea 3:00 pm Bob Li A game of switching network and a game of triangles
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Funding & Logistics Show All Collapse

Show Funding

To apply for funding, you must register by the funding application deadline displayed above.

Students, recent PhDs, women, and members of underrepresented minorities are particularly encouraged to apply. Funding awards are typically made 6 weeks before the workshop begins. Requests received after the funding deadline are considered only if additional funds become available.

Show Lodging

For information about recommended hotels for visits of under 30 days, visit Short-Term Housing. Questions? Contact coord@slmath.org.

Show Directions to Venue

Show Visa/Immigration

Schedule, Notes/Handouts & Videos
Show Schedule, Notes/Handouts & Videos
Show All Collapse
Jul 24, 2000
Monday
08:00 AM - 05:00 PM
  Coin-moving puzzles
Eric Demaine, Martin Demaine, Helena Verrill
08:00 AM - 05:00 PM
  Alternate proof of the periodicity of the Sprague Grundy Function of Wythoff's Game
Howard Landman (Colorado State University)
08:00 AM - 05:00 PM
  Still Life
Matthew Cook
08:00 AM - 05:00 PM
  Analysis Tools: "Brute-Force" and "Winsolve"
Bill Fraser
09:00 AM - 09:30 AM
  Environmental Go
Elwyn Berlekamp (Elwyn & Jennifer Berlekamp Foundation)
09:30 AM - 10:30 AM
  Break
10:30 AM - 11:00 AM
  Analysis of the 4/21/98 Jiang-Rui endgame
Bill Spight (not applicable)
11:00 AM - 11:30 AM
  Analysis Tools "Brute-Force" and "Winsolve"
Bill Fraser
11:30 AM - 12:00 PM
  Combinatorial game theory
Matthew Cook
12:00 PM - 01:30 PM
  Break
01:30 PM - 02:00 PM
  Half-a-centrury of computer chess: The ongest running
Jurg Nievergelt
02:00 PM - 02:30 PM
  Break
02:30 PM - 03:00 PM
  Who wins Domineering on recutangular boards
Cristopher Moore (Santa Fe Institute)
03:00 PM - 05:00 PM
  Break
05:00 PM - 05:30 PM
  The game of Hex: The hierarchiical approach
Vadim Anshelevich
05:30 PM - 09:00 PM
  Break
09:00 PM - 09:30 PM
  Global threats in conbinatorial games: A computation model with applications to chess endgames
Fabian Maeser
Jul 25, 2000
Tuesday
09:00 AM - 09:30 AM
  Another form of Matrix Nim
Tom Ferguson
09:30 AM - 10:30 AM
  Break
10:30 AM - 11:00 AM
  A symmetric strategy in graph avoidance games
Wolfgang Slany
11:00 AM - 11:30 AM
  A natural map of numbers and combinatorial games
Len Haff
11:30 AM - 12:00 PM
  Break
12:00 PM - 12:30 PM
  Amazons
Raymond Snatzke
12:30 PM - 01:30 PM
  Break
01:30 PM - 02:00 PM
  The game of End-Nim
Richard Nowakowski (Dalhousie University)
02:00 PM - 04:00 PM
  Break
04:00 PM - 04:30 PM
  Looney dots and boxes endgame
Katherine Scott
Jul 26, 2000
Wednesday
10:30 AM - 11:00 AM
  TBA
Erik Demaine
11:00 AM - 11:30 AM
  Games on "Word Configurations"
Jeremiah Farrell
11:30 AM - 02:00 PM
  Break
02:00 PM - 02:30 PM
  Games of chance: Extending computational technoques to games of imperfect information
Matthew Ginsberg
02:30 PM - 03:00 PM
  Break
03:00 PM - 03:30 PM
  Le Her
Arthur Benjamin
03:30 PM - 05:00 PM
  Break
05:00 PM - 05:30 PM
  One dimensional Peg Solitaire
Cristopher Moore (Santa Fe Institute)
05:30 PM - 10:00 PM
  Break
10:00 PM - 10:30 PM
  An approach to three-person game programming: A case study using Mediocrity
Hiroyuki Iida
Jul 27, 2000
Thursday
09:30 AM - 10:00 AM
  Infinite Games
John Conway (Princeton University)
10:00 AM - 11:00 AM
  Break
11:00 AM - 11:30 AM
  Transfinity Chomp
Scott Huddleston
11:30 AM - 12:00 PM
  Vines
Jacob Lurie (Harvard University)
12:00 PM - 03:30 PM
  Break
03:30 PM - 04:00 PM
  Two-player games on cellular automata
Aviezri Fraenkel (Weizmann Institute of Science)
04:00 PM - 04:30 PM
  Go endgames are hard
David Wolfe (QRAcorp)
04:30 PM - 05:00 PM
  Searching for spaceships
David Eppstein
Jul 28, 2000
Friday
12:25 AM - 12:55 AM
  A decodeing scheme for 4-ary lexicodes with minimum distance 4
Dong Kim
12:55 AM - 01:25 AM
  How close to Maximum Likelihood is iterative (Turb) Decoding?
Robert McEliece
01:25 AM - 01:55 AM
  Elliptic curves/cryptology
Gadiel Seroussi
01:55 AM - 02:25 AM
  Arrows: A program that plays Amazons
Martin Müller
02:25 AM - 02:55 AM
  Hypercube Tic-Tac-Toe
Solomon Golomb (University of Southern California)
02:55 AM - 03:25 AM
  An application of Mathematical Game theory to Go Endgames: Some Width-Two-Entrance Rooms with/without Kos
Takenobu Takizawa
03:25 AM - 05:10 AM
  Break
05:10 AM - 05:40 AM
  The abstract structure of the group of games
David Moews
05:40 AM - 08:10 AM
  Break
08:10 AM - 08:30 AM
  Break
08:30 AM - 09:00 AM
  The influences of algebraic geometry of curves over finite fields on coding
Solomon Golomb (University of Southern California)
09:00 AM - 09:30 AM
  Fast Implemenations of Berlekamp's BCH Decoding Algorithm.
Dilip Sarwate
09:30 AM - 12:35 PM
  Break
12:35 PM - 01:05 PM
  Exponential sums and improved minimum distance bounds for codes and improvements on the Chevalley of
Oscar Moreno
01:00 PM - 01:35 PM
  Fast Implementations of Berlekamp's BCH Decoding Algorithm
Dilip Sarwate
01:05 PM - 01:30 PM
  Break
01:30 PM - 02:00 PM
  The games computers
Jonathan Schaeffer (University of Alberta)
01:35 PM - 01:35 PM
  Exponential sums and improved minimum distance bounds for codes and improvements on the Chevalley-Warning and Ax-Katz results
Oscar Moreno
02:00 PM - 07:00 PM
  Break
07:00 PM - 07:30 PM
  A game of switching network and a game of triangles
Bob Li