en>Addbot: Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q140283

2013-03-15T10:08:03Z

Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q140283

← Older revision		Revision as of 12:08, 15 March 2013
Line 1:		Line 1:
	~~Hi there~~, ~~I am Andrew Berryhill~~. ~~Alaska~~ is ~~where~~ he~~'s always been residing~~. ~~My day job~~ is a ~~journey agent~~. The ~~preferred hobby~~ for ~~him~~ and ~~his kids~~ is to ~~perform lacross~~ and ~~he would never give it up~~.<br><br>~~Here is my site~~ ... free ~~psychic reading ([~~http://~~203~~.~~250~~.78.~~160~~/~~zbxe~~/~~?document_srl~~=~~1792908 Read Significantly more~~])		[[File:Claude Shannon color screengrab 2012-11.jpg\|thumb\|200px\|Claude Shannon]]
			The '''Shannon number''', named after [[Claude Shannon]], is an estimated lower bound on the [[game-tree complexity]] of [[chess]]. Shannon calculated it as an aside in his 1950 paper "Programming a Computer for Playing Chess".<ref>{{cite journal \| author = [[Claude Shannon]] \| title = Programming a Computer for Playing Chess \| journal = Philosophical Magazine \| volume = 41 \| issue = 314 \| year = 1950 \| url = http://archive.computerhistory.org/projects/chess/related_materials/text/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon.062303002.pdf}}</ref> (This influential paper introduced the field of [[Chess (programming)\|computer chess]].) He notes:

			{{cquote\|With chess it is possible, in principle, to play a perfect game or construct a machine to do so as follows: One considers in a given position all possible moves, then all moves for the opponent, etc., to the end of the game (in each variation). The end must occur, by the rules of the games after a finite number of moves (remembering the [[fifty-move rule\|50 move drawing rule]]).<ref>In chess played according to the [[rules of chess]] by the [[Fédération Internationale des Échecs]], the [[fifty-move rule]] and the related [[draw (chess)\|draw]] due to [[threefold repetition]] of a position require a claim to be made by one of the players. So if neither player claims the draw, a game may go on indefinitely. (See [http://www.chessbase.com/newsdetail.asp?newsid=4210], discussing the [[rapid chess]] game [[Laurent Fressinet\|Fressinet]]-[[Alexandra Kosteniuk\|Kosteniuk]], Château de Villandry 2007, won by Kosteniuk in 237 moves, the last 116 moves of which were in a [[pawnless chess endgame\|pawnless endgame]] with a [[rook (chess)\|rook]] and [[bishop (chess)\|bishop]] versus a rook, in which Fressinet did not try to claim a draw because he was not recording the moves, as the rules normally require in order to claim a draw by virtue of the 50-move rule.) This does not affect the argument that it is in principle possible to play a perfect game, because all searches involving the repetition of a position can be immediately marked as draws without affecting the correctness of the evaluation (because if either player could force a win they could do so without repeating the position), and since there are a finite number of positions eventually one must be repeated or the game must come to an end.</ref> Each of these variations ends in win, loss or draw. By working backward from the end one can determine whether there is a forced win, the position is a draw or is lost. It is easy to show, however, even with the high computing speed available in electronic calculators this computation is impractical. In typical chess positions there will be of the order of 30 legal moves. The number holds fairly constant until the game is nearly finished as shown [...] by [[Adriaan de Groot\|De Groot]], who averaged the number of legal moves in a large number of master games. Thus a move for White and then one for Black gives about 10<sup>3</sup> possibilities. A typical game lasts about 40 moves to resignation of one party. This is conservative for our calculation since the machine would calculate out to checkmate, not resignation. However, even at this figure there will be 10<sup>120</sup> variations to be calculated from the initial position. A machine operating at the rate of one variation per micro-second would require over 10<sup>90</sup> years to calculate the first move!}}

			Shannon also estimated the number of possible positions, "of the general order of <math>\scriptstyle \frac{64!}{32!{8!}^2{2!}^6}</math>, or roughly 10<sup>43</sup> ". This includes some illegal positions (e.g., pawns on the first rank, both kings in check) and excludes legal positions following captures and promotions. Taking these into account, [[Victor Allis]] calculated an upper bound of 5×10<sup>52</sup> for the number of positions, and estimated the true number to be about 10<sup>50</sup>.<ref>{{cite book \| author = [[Victor Allis]] \| year = 1994 \| title = Searching for Solutions in Games and Artificial Intelligence \| publisher = Ph.D. Thesis, University of Limburg, Maastricht, The Netherlands \| isbn = 90-900748-8-0 \| url = http://fragrieu.free.fr/SearchingForSolutions.pdf}}</ref> Recent results<ref>{{cite web \| title = John's Chess Playground \| author = John Tromp \| year = 2010 \| url = http://www.cwi.nl/~tromp/chess/chess.html}}</ref> improve that estimate, by proving an upper bound of only 2<sup>155</sup>, which is less than 10<sup>46.7</sup>.

			Allis also estimated the game-tree complexity to be at least 10<sup>123</sup>, "based on an average branching factor of 35 and an average game length of 80". As a comparison, the [[Observable_universe#Matter_content\|number of atoms in the observable universe]], to which it is often compared, is estimated to be between 4×10<sup>79</sup> and 10<sup>81</sup>.

			== See also ==
			{{Portal\|Strategy games\|Chess}}
			* [[Go and mathematics]]
			{{Clear}}

			== Notes and references ==
			<references/>

			== External links ==
			* [http://mathworld.wolfram.com/Chess.html Mathematics and chess]

			[[Category:Mathematical chess problems]]
			[[Category:Large numbers]]
			[[Category:Combinatorial game theory]]
			[[Category:Computer chess]]

en>Algebraist: trim whitespace

2010-10-03T22:05:53Z

trim whitespace

New page

Hi there, I am Andrew Berryhill. Alaska is where he's always been residing. My day job is a journey agent. The preferred hobby for him and his kids is to perform lacross and he would never give it up.<br><br>Here is my site ... free psychic reading ([http://203.250.78.160/zbxe/?document_srl=1792908 Read Significantly more])

Essentially surjective functor - Revision history

en>Addbot: Bot: Migrating 1 interwiki links, now provided by Wikidata on d:q140283

en>Algebraist: trim whitespace