Shannon number - Revision history

Karl Jones at 01:05, 7 April 2016

2016-04-07T01:05:40Z

Karl Jones: /* History */

2016-04-07T01:05:06Z

‎History

Karl Jones: /* History */

2016-04-07T01:03:34Z

‎History

Karl Jones: /* External links */

2016-04-07T01:03:04Z

‎External links

Karl Jones: Created page with "The '''Shannon number''', named after Claude Shannon, is a conservative lower bound (not an estimate) of the game-tree complexity of chess of 10120, based on an average of..."

2016-04-01T15:02:58Z

Created page with "The '''Shannon number''', named after Claude Shannon, is a conservative lower bound (not an estimate) of the game-tree complexity of chess of 10120, based on an average of..."

New page

The '''Shannon number''', named after [[Claude Shannon]], is a conservative lower bound (not an estimate) of the game-tree complexity of chess of 10120, based on an average of about 103 possibilities of a move for White followed by one for Black and a typical game lasting about 40 such pairs of moves.

== History ==

Shannon calculated it to demonstrate the impracticality of solving chess by brute force, in his 1950 paper "[[Programming a Computer for Playing Chess]".

This influential paper introduced the field of computer chess.

== See also ==

* [[Chess]]
* [[Claude Shannon]]
* [[Computer science]]
* [[Information theory]]

== External links ==

* [https://en.wikipedia.org/wiki/Shannon_number Shannon number] @ Wikipedia

[[Category:Claude Shannon]]
[[Category:Games]]
[[Category:Information theory]]
[[Category:Mathematics]]

← Older revision		Revision as of 01:05, 7 April 2016
Line 1:		Line 1:
−	The '''Shannon number''', named after [[Claude Shannon]], is a conservative lower bound (not an estimate) of the game-tree complexity of chess of 10120, based on an average of about 103 possibilities of a move for White followed by one for Black and a typical game lasting about 40 such pairs of moves.	+	The '''Shannon number''', named after [[Claude Shannon]], is a conservative lower bound (not an estimate) of the [[game-tree complexity]] of [[chess]] of 10120, based on an average of about 103 possibilities of a move for White followed by one for Black and a typical game lasting about 40 such pairs of moves.

	== History ==		== History ==

@@ Line 5: / Line 5: @@
 Shannon calculated it to demonstrate the impracticality of solving [[chess]] by brute force, in his 1950 paper "[[Programming a Computer for Playing Chess]]".
-This influential paper introduced the field of computer chess.
+This influential paper introduced the field of [[computer chess]].
 == See also ==

← Older revision		Revision as of 01:03, 7 April 2016
Line 22:		Line 22:
	[[Category:Information theory]]		[[Category:Information theory]]
	[[Category:Mathematics]]		[[Category:Mathematics]]
		+	[[Category:Numbers]]

@@ Line 3: / Line 3: @@
 == History ==
-Shannon calculated it to demonstrate the impracticality of solving chess by brute force, in his 1950 paper "[[Programming a Computer for Playing Chess]".
+Shannon calculated it to demonstrate the impracticality of solving [[chess]] by brute force, in his 1950 paper "[[Programming a Computer for Playing Chess]]".
 This influential paper introduced the field of computer chess.