Computer Solution to the Game of Pure Strategy

doi:10.3390/g3040150

This article is

freely available
re-usable

Games 2012, 3(4), 150-156; doi:10.3390/g3040150

Article

Computer Solution to the Game of Pure Strategy

Glenn C. Rhoads^1,* and Laurent Bartholdi^2,*

¹ 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

Download PDF Full-Text [164 KB, uploaded 8 November 2012 08:56 CET]

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 Statistics

Click here to load and display the download statistics.

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.

AMA Style

Rhoads GC, Bartholdi L. Computer Solution to the Game of Pure Strategy. Games. 2012; 3(4):150-156.

Chicago/Turabian Style

Rhoads, Glenn C.; Bartholdi, Laurent. 2012. "Computer Solution to the Game of Pure Strategy." Games 3, no. 4: 150-156.

Games EISSN 2073-4336 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert