25,161
edits
Changes
no edit summary
]]
The '''Chess Position''' describes how [[Pieces|pieces]] are placed on the [[Chessboard|chessboard]], as printed as chess diagram, image or photograph from a [[Chess Game|game of chess]]. In 1996 [[Shirish Chinchalkar]] determined 10<span style="vertical-align: super; font-size: 90%;">46</span> as upper bound for the number of reachable chess positions <ref>[[Shirish Chinchalkar]] ('''1996'''). ''An Upper Bound for the Number of Reachable Positions''. [[ICGA Journal#19_3|ICCA Journal, Vol. 19, No. 3]]</ref>. The [[Encoding Moves#MoveIndex|maximum number of moves]] per chess position seems 218 <ref>[https://www.stmintz.com/ccc/index.php?id=424966 Subject: Maximum Number of Legal Moves] by [http://onezero.org/ [Andrew Shapira]], [[Computer Chess Forums|CCC]], May 08, 2005</ref>.
Of course, the information of any arbitrary chess position which occurs inside the game of chess, might be determined from a certain initial starting position and a [[Move List|sequence of moves]] (half-moves), which leads to this position. Anyway, an efficient data structure for a chess position, which is [[Incremental Updates|incrementally updated]] during game play and [[Search|search]] is essential for a chess playing program.
