Backward Induction and the Game-Theoretic Analysis of Chess

Christian Ewerhart

No 01-28, Sonderforschungsbereich 504 Publications from Sonderforschungsbereich 504, Universität Mannheim, Sonderforschungsbereich 504, University of Mannheim

Abstract: The paper scrutinizes various stylized facts related to the minmax theorem for chess. We first point out that, in contrast to the prevalent understanding, chess is actually an infinite game, so that backward induction does not apply in the strict sense. Second, we recall the original argument for the minmax theorem of chess - which is forward rather than backward looking. Then it is shown that, alternatively, the minmax theorem for the infinite version of chess can be reduced to the minmax theorem of the usually employed finite version. The paper concludes with a comment on Zermelo's (1913) non-repetition theorem.

Pages: 15 pages
Date: 2001-05-12
Note: Financial support from the Deutsche Forschungsgemeinschaft, SFB 504, at the University of Mannheim, is gratefully acknowledged.
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Journal Article: Backward Induction and the Game-Theoretic Analysis of Chess (2002)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:xrs:sfbmaa:01-28

Ordering information: This working paper can be ordered from

Access Statistics for this paper

More papers in Sonderforschungsbereich 504 Publications from Sonderforschungsbereich 504, Universität Mannheim Contact information at EDIRC., Sonderforschungsbereich 504, University of Mannheim
Bibliographic data for series maintained by Carsten Schmidt ( this e-mail address is bad, please contact ).