Jump to content

State-space complexity

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 67.8.139.207 (talk) at 05:12, 15 March 2004. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

State-space complexity refers to the number of different game-positions that can exist in a game. Game-tree complexity is normally defined as the product of the games average branching factor and the number of plies (half-moves) in an average game. The game-tree complexity is normally higher than the state space complexity due to the fact that the same position can occur in multiple games.