On Hagelbarger’s and Shannon’s matching pennies playing machines

Authors

  • Macarie Breazu “Lucian Blaga” University of Sibiu
  • Daniel VOLOVICI “Lucian Blaga” University of Sibiu
  • Daniel Morariu “Lucian Blaga” University of Sibiu
  • Radu George Cretulescu “Lucian Blaga” University of Sibiu

Abstract

In the 1950s, Hagelbarger’s Sequence Extrapolating Robot (SEER) and Shannon’s Mind-Reading Machine (MRM) were the state-of-the-art research results in playing the well-known “matching pennies” game. In our research we perform a software implementation for both machines in order to test the common statement that MRM, even simpler, beats SEER. Also, we propose a simple contextual predictor (SCP) and use it to compete with SEER and MRM. As expected, experimental results proves the claimed MRM superiority over SEER and even the SCP’s superiority over both SEER and MRM. At the end, we draw some conclusions and propose further research ideas, like the use of mixing models methods and the use of Hidden Markov Model for modelling player’s behaviour

References

DW Hagelbarger. Seer, A SEquence Extrapolating Robot, IRE Transactions on Electronic Computers, page 1–7, March, 1956.

Claude E Shannon. A Mind-Reading(?) Machine, Bell Laboratories Memorandum, March 18, 1953.

Matthew V. Mahoney. Adaptive Weighing of Context Models for Lossless Data Compression, Florida Institute of Technology CS Dept. Technical Report CS-2005-16, 2005.

Lawrence R. Rabiner, A tutorial on HMM and selected applications in Speech Recognition, Proceedings of the IEEE, vol 77, no. 2, 1989.

Arpad Gellert, Adrian Florea. Web prefetching through efficient prediction by partial matching, World Wide Web, volume 19, pages 921–932, 2016.

https://en.wikipedia.org/wiki/Matching_pennies

https://cs.stanford.edu/people/eroberts/courses/soco/projects/1999-00/information-theory/ai.html

http://william-poundstone.com/blog/2015/7/30/how-i-beat-the-mind-reading-machine

Downloads

Published

2020-12-09

Issue

Section

Articles