Knowledge (XXG)

Variation (game tree)

Source 📝

68: 58:
A variation can be any number of steps as long as each step would be legal if it were to be played. It is often as far ahead as a human or computer can calculate; or however long is necessary to reach a particular position of interest. It may also lead to a terminal state in the game, in which case
82:
The principal variation refers to the particular variation that is the most advantageous to the current player, assuming each other player will respond with the move that best improves their own position. In other words, it is the "best" or "correct" line of play. In the context of
34:
can refer to a specific sequence of successive moves in a turn-based game, often used to specify a hypothetical future state of a game that is being played. Although the term is most commonly used in the context of
179: 174: 194: 184: 189: 88: 95:
to be the most advantageous, but is not guaranteed due to the technical limitations of the algorithm.
39:
analysis, it has been applied to other games. It also is a useful term used when describing computer
91:– in which this term is most common – it may also refer to the sequence of moves that is currently 124: 44: 67: 48: 148: 168: 109: 17: 129: 104: 84: 75: 40: 119: 114: 72: 159: 59:
the term "winning variation" or "losing variation" is sometimes used.
66: 52: 36: 149:"Searches, tree pruning and tree ordering in Go" 8: 140: 27:A specific sequence of moves in a game 7: 25: 71:The principal variation of this 43:-search algorithms (for example 1: 180:Game artificial intelligence 47:) for playing games such as 211: 175:Combinatorial game theory 89:artificial intelligence 79: 70: 195:Trees (graph theory) 151:. 21 December 2007. 63:Principal variation 18:Principal variation 125:Alpha-beta pruning 80: 185:Search algorithms 16:(Redirected from 202: 153: 152: 145: 87:-searching game 78:is shown in blue 21: 210: 209: 205: 204: 203: 201: 200: 199: 165: 164: 156: 147: 146: 142: 138: 101: 65: 28: 23: 22: 15: 12: 11: 5: 208: 206: 198: 197: 192: 190:Computer chess 187: 182: 177: 167: 166: 163: 162: 155: 154: 139: 137: 134: 133: 132: 127: 122: 117: 112: 107: 100: 97: 64: 61: 26: 24: 14: 13: 10: 9: 6: 4: 3: 2: 207: 196: 193: 191: 188: 186: 183: 181: 178: 176: 173: 172: 170: 161: 158: 157: 150: 144: 141: 135: 131: 128: 126: 123: 121: 118: 116: 113: 111: 108: 106: 103: 102: 98: 96: 94: 90: 86: 77: 74: 69: 62: 60: 56: 54: 50: 46: 42: 38: 33: 19: 143: 110:Backtracking 92: 81: 57: 31: 29: 169:Categories 160:Variations 136:References 130:Negascout 105:Game tree 76:game tree 32:variation 99:See also 93:believed 120:Negamax 115:Minimax 73:minimax 45:minimax 53:Chess 37:Chess 85:tree 41:tree 51:or 171:: 55:. 49:Go 30:A 20:)

Index

Principal variation
Chess
tree
minimax
Go
Chess

minimax
game tree
tree
artificial intelligence
Game tree
Backtracking
Minimax
Negamax
Alpha-beta pruning
Negascout
"Searches, tree pruning and tree ordering in Go"
Variations
Categories
Combinatorial game theory
Game artificial intelligence
Search algorithms
Computer chess
Trees (graph theory)

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