Optimal, Approximately Optimal, and Fair Play of the Fowl Play Card Game


Marcin Malec: Class of 2013

Forrest E. Jacobs: Class of 2012

Document Type

Conference Material

Publication Date


Department 1

Computer Science


After introducing the jeopardy card game Fowl Play, we present equations for optimal two-player play, describe their solution with a variant of value iteration, and visualize the optimal play policy. Next, we discuss the approximation of optimal play and note that neutral network learning can achieve a win rate within 1% of optimal play yet with a 5-orders-of-magnitude reduction in memory requirements. Optimal komi (i.e. compensation points) are computed for the two-player games of Pig and Fowl Play. Finally, we make use of such komi computations in order to redesign Fowl Play for two-player fairness, creating the game Red Light.


This paper was presented at Proceedings of CG2013: The 8th International Conference on Computers and Games, Yokohama, Japan, August 13-15, 2013.

The conference presentation was published in Computers and Games: Lecture Notes in Computer Science as part of the selected papers. The published work can be found through the publisher at: http://link.springer.com/chapter/10.1007/978-3-319-09165-5_20