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
Deep Blue versus Garry Kasparov this is nowadays a common tactic, it was a relatively new idea at the time. Despite this anti-computer tactic, the game was drawn. "May 7". In this game Kasparov played the Caro–Kann Defence. Kasparov got into time trouble late in the game. The sub-optimal moves he played in a hurry may have cost him the victory. "May 10". In this game, the King's Indian Attack opening was played. As in the previous game, Deep Blue played a brilliant endgame that secured a draw, when it was looking as if Kasparov would win. If White plays 50.g8=Q then Black can force