25,161
edits
Changes
Ply
,Created page with "'''Home * Dictionary * Ply''' FILE:Plyingwithalazykate.JPG|border|right|thumb|Making a three ply yarn <ref>[https://en.wikipedia.org/wiki/Plying Plying fr..."
'''[[Main Page|Home]] * [[Dictionary]] * Ply'''
[[FILE:Plyingwithalazykate.JPG|border|right|thumb|Making a three ply yarn <ref>[https://en.wikipedia.org/wiki/Plying Plying from Wikipedia]</ref> ]]
The word '''Ply''' denotes a '''half-move''', that is a [[Moves|move]] of one side only. When we speak of a "6 ply search", we mean three full moves - something like 1. e2e4 e7e5 2. g1f3 b8c6 3. b1c3 g8f6.
A full ply has been a natural unit for counting search [[Depth|depth]] before the introduction of [[Selectivity|selective search]] techniques. Today, if a program claims to do a 12-ply search, it informs us only about the parameter fed into [[Search|search function]]. Some lines might have been severely [[Reductions|reduced]], others - [[Extensions|extended]]. To make matters even more complex, top programs often use [[Depth#FractionalPlies|fractional]] extensions and reductions, changing depth by less than one full ply and taking effect only when they accumulate.
A typical [[Depth-First|depth-first]] non-uniform depth search decouples node-distance to the [[Horizon Node|horizon]] from node-distance to the [[Root|root]]. Often, two distinct parameters of a [[Recursion|recursive]] search routine were used. While searching deeper, one parameter, distance to horizon, often called "depth", "height" or "draft", is decremented by a number possibly in fractional ply units, which could be less than one ply in case of extensions or more than one ply in case of reductions, while the second parameter "ply" starts with zero at the root and is incremented exactly by one each search call deeper. It corresponds to one level of the [[Search Tree|search tree]] and can act as index (ply-index) into a random accessible [[Stack|search stack]], an [[Array|array]] of [[Node|node states]].
=See also=
* [[Depth]]
* [[Depth#FractionalPlies|Fractional Plies]]
* [[Iterative Deepening]]
* [[Selectivity]]
* [[SEX Algorithm]]
=Forum Posts=
* [http://www.talkchess.com/forum/viewtopic.php?t=51054 maximal ply that programs need today] by [[Uri Blass]], [[CCC]], January 26, 2014
=External Links=
* [https://en.wikipedia.org/wiki/Ply Ply from Wikipedia]
* [https://en.wikipedia.org/wiki/Ply_%28game_theory%29 Ply (game theory) from Wikipedia]
=References=
<references />
'''[[Dictionary|Up one Level]]'''
[[FILE:Plyingwithalazykate.JPG|border|right|thumb|Making a three ply yarn <ref>[https://en.wikipedia.org/wiki/Plying Plying from Wikipedia]</ref> ]]
The word '''Ply''' denotes a '''half-move''', that is a [[Moves|move]] of one side only. When we speak of a "6 ply search", we mean three full moves - something like 1. e2e4 e7e5 2. g1f3 b8c6 3. b1c3 g8f6.
A full ply has been a natural unit for counting search [[Depth|depth]] before the introduction of [[Selectivity|selective search]] techniques. Today, if a program claims to do a 12-ply search, it informs us only about the parameter fed into [[Search|search function]]. Some lines might have been severely [[Reductions|reduced]], others - [[Extensions|extended]]. To make matters even more complex, top programs often use [[Depth#FractionalPlies|fractional]] extensions and reductions, changing depth by less than one full ply and taking effect only when they accumulate.
A typical [[Depth-First|depth-first]] non-uniform depth search decouples node-distance to the [[Horizon Node|horizon]] from node-distance to the [[Root|root]]. Often, two distinct parameters of a [[Recursion|recursive]] search routine were used. While searching deeper, one parameter, distance to horizon, often called "depth", "height" or "draft", is decremented by a number possibly in fractional ply units, which could be less than one ply in case of extensions or more than one ply in case of reductions, while the second parameter "ply" starts with zero at the root and is incremented exactly by one each search call deeper. It corresponds to one level of the [[Search Tree|search tree]] and can act as index (ply-index) into a random accessible [[Stack|search stack]], an [[Array|array]] of [[Node|node states]].
=See also=
* [[Depth]]
* [[Depth#FractionalPlies|Fractional Plies]]
* [[Iterative Deepening]]
* [[Selectivity]]
* [[SEX Algorithm]]
=Forum Posts=
* [http://www.talkchess.com/forum/viewtopic.php?t=51054 maximal ply that programs need today] by [[Uri Blass]], [[CCC]], January 26, 2014
=External Links=
* [https://en.wikipedia.org/wiki/Ply Ply from Wikipedia]
* [https://en.wikipedia.org/wiki/Ply_%28game_theory%29 Ply (game theory) from Wikipedia]
=References=
<references />
'''[[Dictionary|Up one Level]]'''
