Content deleted Content added
No edit summary |
|||
Line 36:
This is an estimate of the number of positions one would have to evaluate in a [[minimax]] search to determine the value of the initial position.
{{Wording cleanup|date=December 2024|for=clarity}}
It is hard even to estimate the game-tree complexity, but for some games an approximation can be given by raising the game's average [[branching factor]] ''b'' to the power of the number of [[Ply (chess)|plies]] ''d'' in an average game, or:
| |||