Research

 

Research Publication
Professor of Physics Adam Landsberg
10/27/2011
 
 
Combinatorial games such as Chess, Checkers, Go, Nim, and Chomp have been the focus of considerable attention in the fields of computer science, mathematics, artificial intelligence, and most recently, chaos and dynamical systems theory. In traditional combinatorial games, two players alternate moves until one player reaches a terminal position from which no legal move is available, thereupon losing the game. An intriguing but surprisingly difficult question in game theory centers on what happens when standard game rules are modified to allow for a one-time “pass” move (whereby a player may skip a turn). In this paper, we show how tools from chaos and dynamical systems theory can be used to address this longstanding open question in game theory.  
http://chaos.aip.org/resource/1/chaoeh/v21/i4/p043108_s1  

 

Back to News List