Ply (game theory)

This page was last edited on 26 January 2017, at 09:41.

In two-player sequential games, a ply refers to 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 "turn" can be a problem since it means different things in different traditions. For example, in standard chess terminology, one move consists of a turn by each player; therefore a ply in chess is a half-move. Thus, after 20 moves in a chess game, 40 plies have been completed—20 by white and 20 by black. In the game of Go, by contrast, a ply is the normal unit of counting moves; so for example to say that a game is 250 moves long is to imply 250 plies.

The word "ply" used as a synonym for "layer" goes back to the 15th century.[1] Arthur Samuel used the term in its game-theoretic sense in his seminal paper on machine learning in checkers in 1959.[2]

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.[3]

See also


  1. ^ Online Etymology Dictionary, "ply" (cited 24 April 2011)
  2. ^ A.L. Samuel, March 3, 1959: Some Studies in Machine Learning Using the Game of Checkers (cited 25 August 2006)
  3. ^ Murray Campbell, et al. 2002. Deep Blue

Further reading

  • Levy, David; Newborn, Monty (1991), How Computers Play Chess, Computer Science Press, ISBN 0-7167-8121-2

External links

  • The dictionary definition of ply at Wiktionary

This page is based on a Wikipedia article written by authors (here).
Text is available under the CC BY-SA 3.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.