香农数1950
Shannon number
自然数
The Shannon number, named after the American mathematician Claude Shannon, is a conservative lower bound of the game-tree complexity of chess of 10120, based on an average of about 103 possibilities for a pair of moves consisting of a move for White followed by a move for Black, and a typical game lasting about 40 such pairs of moves. His influential 1950 paper on it, "Programming a Computer for Playing Chess", introduced the field of computer chess.
摘自英文维基百科「Shannon number」(英文维基百科,暂无中文条目),CC BY-SA 4.0
- 类型
- 正整数、最小值、大数、数学常数
- 发现 / 发明时间
- 1950 年
- 发现者 / 提出者
- 克劳德·香农
- 命名来源
- 克劳德·香农
- 研究学科
- 博弈论、国际象棋对局
- 学科
- 生物学
