Open AccessThis article is
- freely available
Computer Solution to the Game of Pure Strategy
University of Maryland, University College, 3501 University Blvd. East, Adelphi, MD, USA
Mathematical Institute, Georg-August University, Bunsenstraße 3-5, D-37073 Göttingen, Germany
* Authors to whom correspondence should be addressed.
Received: 25 August 2012; in revised form: 11 October 2012 / Accepted: 1 November 2012 / Published: 8 November 2012
Abstract: We numerically solve the classical "Game of Pure Strategy" using linear programming. We notice an intricate even-odd behaviour in the results of our computations that seems to encourage odd or maximal bids.
Keywords: goofspiel; game theory; linear programming; dynamic programming
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
MDPI and ACS Style
Rhoads, G.C.; Bartholdi, L. Computer Solution to the Game of Pure Strategy. Games 2012, 3, 150-156.
Rhoads GC, Bartholdi L. Computer Solution to the Game of Pure Strategy. Games. 2012; 3(4):150-156.
Rhoads, Glenn C.; Bartholdi, Laurent. 2012. "Computer Solution to the Game of Pure Strategy." Games 3, no. 4: 150-156.