Knowledge (XXG)

Variation (game tree)

Source 📝

57: 47:
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
71:
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
23:
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
168: 163: 183: 173: 178: 77: 84:
to be the most advantageous, but is not guaranteed due to the technical limitations of the algorithm.
28:
analysis, it has been applied to other games. It also is a useful term used when describing computer
80:– in which this term is most common – it may also refer to the sequence of moves that is currently 113: 33: 56: 37: 137: 157: 98: 118: 93: 73: 64: 29: 108: 103: 61: 148: 48:
the term "winning variation" or "losing variation" is sometimes used.
55: 41: 25: 138:"Searches, tree pruning and tree ordering in Go" 8: 129: 16:A specific sequence of moves in a game 7: 14: 60:The principal variation of this 32:-search algorithms (for example 1: 169:Game artificial intelligence 36:) for playing games such as 200: 164:Combinatorial game theory 78:artificial intelligence 68: 59: 184:Trees (graph theory) 140:. 21 December 2007. 52:Principal variation 114:Alpha-beta pruning 69: 174:Search algorithms 191: 142: 141: 134: 76:-searching game 67:is shown in blue 199: 198: 194: 193: 192: 190: 189: 188: 154: 153: 145: 136: 135: 131: 127: 90: 54: 17: 12: 11: 5: 197: 195: 187: 186: 181: 179:Computer chess 176: 171: 166: 156: 155: 152: 151: 144: 143: 128: 126: 123: 122: 121: 116: 111: 106: 101: 96: 89: 86: 53: 50: 15: 13: 10: 9: 6: 4: 3: 2: 196: 185: 182: 180: 177: 175: 172: 170: 167: 165: 162: 161: 159: 150: 147: 146: 139: 133: 130: 124: 120: 117: 115: 112: 110: 107: 105: 102: 100: 97: 95: 92: 91: 87: 85: 83: 79: 75: 66: 63: 58: 51: 49: 45: 43: 39: 35: 31: 27: 22: 132: 99:Backtracking 81: 70: 46: 20: 18: 158:Categories 149:Variations 125:References 119:Negascout 94:Game tree 65:game tree 21:variation 88:See also 82:believed 109:Negamax 104:Minimax 62:minimax 34:minimax 42:Chess 26:Chess 74:tree 30:tree 40:or 160:: 44:. 38:Go 19:A

Index

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.