TY - JOUR
T1 - How difficult is it to invent a nontrivial game?
AU - Kreinovich, Vladik
AU - Watson, Richard
N1 - Funding Information:
This work was partially supported by NSF grant CDA-9015006. One of the authors (V.K) is also greatly thankful to all the participants of the USSR National Symposium on Qhernetics, especially to Sergei Yu. Maslov, for valuable discussions, to the Leningrad Laboratory of Experimental Psychological Systems for partial financial support, and to Patrick Suppes (Stanford) and Peter Fishburn (AT&T Bell Labs) for their attention to this work. Address correspondence to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968.
PY - 1994
Y1 - 1994
N2 - Everyone who has ever tried to invent a new game knows that it is very difficult to make it nontrivial. In this paper, we explain this empirical fact by showing that almost all games (in some reasonable sense) are trivial. We also estimate the number of nontrivial games and compare this number with the number of all possible games of a given size.
AB - Everyone who has ever tried to invent a new game knows that it is very difficult to make it nontrivial. In this paper, we explain this empirical fact by showing that almost all games (in some reasonable sense) are trivial. We also estimate the number of nontrivial games and compare this number with the number of all possible games of a given size.
UR - http://www.scopus.com/inward/record.url?scp=0028461358&partnerID=8YFLogxK
U2 - 10.1080/01969729408902346
DO - 10.1080/01969729408902346
M3 - Article
AN - SCOPUS:0028461358
VL - 25
SP - 629
EP - 640
JO - Cybernetics and Systems
JF - Cybernetics and Systems
SN - 0196-9722
IS - 4
ER -