Common
Game complexity
Notion in combinatorial game theory
Game complexity
Combinatorial game theory measures game complexity in several ways: State-space complexity (the number of legal game positions from the initial position) Game tree size (total number of possible games) Decision complexity (number of leaf nodes in the smallest decision tree for initial position) Game-tree complexity (number of leaf nodes in the smallest full-width decision tree for initial position) Computational complexity (asymptotic difficulty of a game as it grows arbitrarily large) These measures involve understanding the game positions, possible outcomes, and computational complexity of various game scenarios.
Open boosters, collect cards and trade them. Free to play.
Play for free