Ply (game theory) consists of one proposed move by the machine and one anticipated reply by the opponent"). In computing, the concept of ply is important because one ply corresponds to one level of the game tree. The Deep Blue chess computer which defeated Kasparov in 1997 would typically search to a depth of between six and sixteen plies to a maximum of forty plies in some situations. Ply (game theory) In two-player sequential games, a ply is one turn taken by one of the players. The word is used to clarify what is meant when one might otherwise say "turn". The word
Human–computer chess matches Michael Adams 5½–½ in a six-game match. While Adams was criticized for not preparing as well as Kasparov and Kramnik had, some commentators saw this as heralding the end of human-computer matches. Kramnik, then still the World Champion, played a six-game match against the computer program Deep Fritz in Bonn, Germany from November 25 to December 5, 2006, losing 4–2 to the machine, with two losses and four draws. He received 500,000 Euros for playing and would have received another 500,000 Euros had he won the match. Deep Fritz version 10 ran on a computer containing two Intel Xeon CPUs