Strictly determined game source: en.wikipedia.org/wiki/Strictly_determined_game
This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details. (January 2017) (Learn how and when to remove this template message)
In game theory, a strictly determined game is a two-player zero-sum game that has at least one Nash equilibrium with both players using pure strategies. The value of a strictly determined game is equal to the value of the equilibrium outcome. Most finite combinatorial games, like tic-tac-toe, chess, draughts, and go, are strictly determined games.
- Waner, Stefan (1995–1996). "Chapter G Summary Finite". Retrieved 24 April 2009.
- Steven J. Brams (2004). "Two person zero-sum games with saddlepoints". Game Theory and Politics. Courier Dover Publications. pp. 5–6. ISBN 9780486434971.
- Saul Stahl (1999). "Solutions of zero-sum games". A gentle introduction to game theory. AMS Bookstore. p. 54. ISBN 9780821813393.
- Abraham M. Glicksman (2001). "Elementary aspects of the theory of games". An Introduction to Linear Programming and the Theory of Games. Courier Dover Publications. p. 94. ISBN 9780486417103.
- Czes Kośniowski (1983). "Playing the Game". Fun mathematics on your microcomputer. Cambridge University Press. p. 68. ISBN 9780521274517.
|This applied mathematics-related article is a stub. You can help Wikipedia by expanding it.|