HOW DIFFICULT IS IT TO INVENT A NONTRIVIAL GAME

被引：0
|
作者：
KREINOVICH, V
WATSON, R
机构：
[1] Computer Science Department, University of Texas, El Paso, TX
来源：
CYBERNETICS AND SYSTEMS | 1994年 / 25卷 / 04期
基金：
美国国家科学基金会;
关键词：
9;
D O I：
10.1080/01969729408902346
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：629 / 640
页数：12
相关论文
共 50 条
12345