| Ply (chess) |
Article Index for Ply |
Information AboutPly (chess) |
|
In Computer Chess the concept of ply is important because one ply corresponds to one level of the Game Tree . It has been found that an increase in search depth of one ply corresponds on the average to an increase in playing strength of approximately 80 Elo points. The Deep Blue chess computer which defeated Kasparov in 1997 could search to a depth of 12 ply. Arthur Samuel originated the term in his paper on machine learning in 1959 {Link without Title} . Consider the word 'reply'—the response, or comeback, to an utterance: it might be thought of as the ''re''-ply to an initial ''ply''. See also: Minimax Algorithm . |
|
|