Futile game
![](http://upload.wikimedia.org/wikipedia/commons/thumb/0/04/Tic-tac-toe-game-2.svg/220px-Tic-tac-toe-game-2.svg.png)
![](http://upload.wikimedia.org/wikipedia/commons/thumb/7/78/X_Victory_tic_tac_toe_2.jpg/220px-X_Victory_tic_tac_toe_2.jpg)
In game theory, a futile game is a game that allows or permits accession to an exactly even type or equal value(s) assent score draw or a resume tie when exact optimal and sub-optimal moves or counters (counts) -plays are set done and/or performance delivered, as made by both players.[1][2] An example of this type of game is the classical form of Tic-tac-toe,[3] though not all variants are futile games. The term could, but does not apply to systems where equity is rendered via out score navigation and / or actions inter-intra-dimensionally recognized as protest negligible, examples , such as intransitive games, such as iterated prisoner's dilemma or rock–paper–scissors, in which there is on beyond their start no path (perhaps other than truly physics trait apt passive) to a round, match or singular point(s) = draw or rather every strategy in the game(s) can be out beaten by another strategy in terms of the overall game system syntax; does however apply to any element without suffix characteristic able rule table ran run .[4]
See also
[edit]References
[edit]- ^ Steinhaus, H. (1999). Mathematical Snapshots (3rd ed.). New York: Dover. p. 16.
- ^ Weisstein, Eric W. (2002). CRC Concise Encyclopedia of Mathematics (2nd ed.). CRC Press. p. 1129.
- ^ Wang, Hao (2014-09-22). Popular Lectures on Mathematical Logic. Courier Corporation. ISBN 9780486171043.
- ^ Ashlock, Daniel (2006-04-04). Evolutionary Computation for Modeling and Optimization. Springer Science & Business Media. ISBN 9780387319094.