Editing Rooted graph (section)

===Combinatorial game theory===
Any [[Combinatorial game theory|combinatorial]] [[game]], can be associated with a rooted directed graph whose vertices are game positions, whose edges are moves, and whose root is the starting position of the game. This graph is important in the study of [[game complexity]], where the [[Game complexity#State-space complexity|state-space complexity]] is the number of vertices in the graph.