Knowledge (XXG)

Ply (game theory)

Source 📝

267: 95:
in 1959, but with a slightly different meaning: the "ply", in Samuel's terminology, is actually the depth of analysis ("Certain expressions were introduced which we will find useful. These are: Ply, defined as the number of moves ahead, where a ply of two consists of one proposed move by the
76:, a street consists of 2 plies, with possible plays being check/raise/call/fold: the first by the player at the big blind, and the second by the dealer, who posts the small blind; and there are 4 streets: preflop, flop, turn, river (the latter 3 corresponding to 80:). The terms "half-street" and "half-street game" are sometimes used to describe, respectively, a single bet in a heads up game, and a simplified heads up poker game where only a single player bets. 294: 250: 84: 114:
in 1997 would typically search to a depth of between six and sixteen plies to a maximum of forty plies in some situations.
38:
is one turn taken by one of the players. The word is used to clarify what is meant when one might otherwise say "turn".
41:
The word "turn" can be a problem since it means different things in different traditions. For example, in standard
289: 104: 53:. Thus, after 20 moves in a chess game, 40 plies have been completed—20 by white and 20 by black. In the game of 238: 180: 165: 197: 299: 141: 217: 99:
In computing, the concept of a ply is important because one ply corresponds to one level of the
57:, by contrast, a ply is the normal unit of counting moves; so for example to say that a game is 246: 123: 209: 88: 73: 77: 72:
plies; each dealt card may sometimes also be called a "street". For instance, in heads up
31: 111: 107: 266: 213: 283: 221: 153: 100: 83:
The word "ply" used as a synonym for "layer" goes back to the 15th century.
54: 17: 92: 68:
players the word "street" is used for a full betting round consisting of
271: 87:
first used the term in its game-theoretic sense in his seminal paper on
42: 49:
consists of a turn by each player; therefore a ply in chess is a
196:
Campbell, Murray; Hoane, A.Joseph; Hsu, Feng-Hsiung (2002).
183:
Some Studies in Machine Learning Using the Game of Checkers
168:
Some Studies in Machine Learning Using the Game of Checkers
142:
Chen, Bill and Ankenman, Jerrod. The Mathematics of Poker
96:
machine and one anticipated reply by the opponent").
8: 134: 7: 154:Online Etymology Dictionary, "ply" 25: 265: 1: 270:The dictionary definition of 214:10.1016/S0004-3702(01)00129-1 295:Game artificial intelligence 181:A.L. Samuel, March 3, 1959: 166:A.L. Samuel, March 3, 1959: 186:, p. 601 (cited 2 May 2018) 316: 245:, Computer Science Press, 241:; Newborn, Monty (1991), 243:How Computers Play Chess 202:Artificial Intelligence 61:is to imply 250 plies. 171:(cited 25 August 2006) 30:In two-or-more-player 156:(cited 24 April 2011) 290:Chess terminology 252:978-0-7167-8121-9 124:Minimax algorithm 45:terminology, one 16:(Redirected from 307: 269: 255: 226: 225: 193: 187: 178: 172: 163: 157: 151: 145: 139: 89:machine learning 32:sequential games 27:Game theory term 21: 315: 314: 310: 309: 308: 306: 305: 304: 280: 279: 262: 253: 237: 234: 232:Further reading 229: 195: 194: 190: 179: 175: 164: 160: 152: 148: 140: 136: 132: 120: 110:which defeated 78:community cards 28: 23: 22: 15: 12: 11: 5: 313: 311: 303: 302: 297: 292: 282: 281: 278: 277: 261: 260:External links 258: 257: 256: 251: 233: 230: 228: 227: 208:(1–2): 57–83. 188: 173: 158: 146: 133: 131: 128: 127: 126: 119: 116: 108:chess computer 64:In poker with 59:250 moves long 26: 24: 14: 13: 10: 9: 6: 4: 3: 2: 312: 301: 298: 296: 293: 291: 288: 287: 285: 276:at Wiktionary 275: 274: 268: 264: 263: 259: 254: 248: 244: 240: 236: 235: 231: 223: 219: 215: 211: 207: 203: 199: 192: 189: 185: 184: 177: 174: 170: 169: 162: 159: 155: 150: 147: 143: 138: 135: 129: 125: 122: 121: 117: 115: 113: 109: 106: 102: 97: 94: 90: 86: 85:Arthur Samuel 81: 79: 75: 74:Texas hold'em 71: 67: 62: 60: 56: 52: 48: 44: 39: 37: 33: 19: 272: 242: 205: 201: 191: 182: 176: 167: 161: 149: 137: 98: 82: 69: 65: 63: 58: 50: 46: 40: 35: 29: 300:Game theory 239:Levy, David 198:"Deep Blue" 18:Ply (chess) 284:Categories 130:References 105:Deep Blue 101:game tree 51:half-move 118:See also 112:Kasparov 103:. The 93:checkers 249:  222:662187 220:  144:, p110 218:S2CID 43:chess 247:ISBN 47:move 34:, a 273:ply 210:doi 206:134 91:in 36:ply 286:: 216:. 204:. 200:. 55:Go 224:. 212:: 70:n 66:n 20:)

Index

Ply (chess)
sequential games
chess
Go
Texas hold'em
community cards
Arthur Samuel
machine learning
checkers
game tree
Deep Blue
chess computer
Kasparov
Minimax algorithm
Chen, Bill and Ankenman, Jerrod. The Mathematics of Poker
Online Etymology Dictionary, "ply"
A.L. Samuel, March 3, 1959: Some Studies in Machine Learning Using the Game of Checkers
A.L. Samuel, March 3, 1959: Some Studies in Machine Learning Using the Game of Checkers
"Deep Blue"
doi
10.1016/S0004-3702(01)00129-1
S2CID
662187
Levy, David
ISBN
978-0-7167-8121-9

ply
Categories
Chess terminology

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.