Computational Complexity
The number of legal positions in English draughts is estimated to be 1020, and it has a game-tree complexity of approximately 1040. By comparison, chess is estimated to have between 1043 and 1050 legal positions.
When draughts is generalized so that it can be played on an n-by-n board, the problem of determining if the first player has a win in a given position is EXPTIME-complete.
The July 2007 announcement by Chinook's team stating that the game had been solved must be understood in the sense that, with perfect play on both sides, the game will always finish with a draw. Yet, not all positions that could result from imperfect play have been analyzed.
Read more about this topic: English Draughts
Famous quotes containing the word complexity:
“It is not only their own need to mother that takes some women by surprise; there is also the shock of discovering the complexity of alternative child-care arrangements that have been made to sound so simple. Those for whom the intended solution is equal parenting have found that some parents are more equal than others.”
—Elaine Heffner (20th century)