Game complexity
Combinatorial game theory has several ways of measuring game complexity. This article describes five of them: state-space complexity, game tree size, decision complexity, game-tree complexity, and computational complexity.
- Comment
- enCombinatorial game theory has several ways of measuring game complexity. This article describes five of them: state-space complexity, game tree size, decision complexity, game-tree complexity, and computational complexity.
- Has abstract
- enCombinatorial game theory has several ways of measuring game complexity. This article describes five of them: state-space complexity, game tree size, decision complexity, game-tree complexity, and computational complexity.
- Is primary topic of
- Game complexity
- Label
- enGame complexity
- Link from a Wikipage to an external page
- www.ics.uci.edu/~eppstein/cgt/hard.html
- Link from a Wikipage to another Wikipage
- Abalone (board game)
- Arimaa
- Asymptotic analysis
- Backgammon
- Backward induction
- Bejeweled
- Big O notation
- Branching factor
- Candy Crush Saga
- Carcassonne (board game)
- Category:Combinatorial game theory
- Category:Game theory
- Chess
- Chinese checkers
- Combinatorial game theory
- Complexity
- Complexity class
- Computational complexity theory
- Computational resource
- Computation time
- Computer bridge
- Computer memory
- Congkak
- Connect6
- Connect Four
- Contract bridge
- David Eppstein
- Decision tree
- Depth-first search
- Domineering
- DSPACE
- English draughts
- EXPTIME
- EXPTIME-complete
- Fanorona
- Fifty-move rule
- Game of the Amazons
- Game tree
- Generalized game
- GIPF (game)
- Go (game)
- Go and mathematics
- Gomoku
- Havannah
- Hex (board game)
- Infinite chess
- International draughts
- Janggi
- Kalah
- Lines of Action
- List of NP-complete problems
- List of PSPACE-complete problems
- Logarithm
- M,n,k-game
- Magic: The Gathering
- Minimax
- Minimax strategy
- Nine men's morris
- NP-hard
- NP-hardness
- Oware
- P (complexity class)
- Pentomino
- Ply (chess)
- Ply (game theory)
- PSPACE
- PSPACE-complete
- PSPACE-hard
- Qubic
- Quoridor
- Reversi
- Shannon number
- Shogi
- Sim (pencil game)
- Solved game
- Solving chess
- Stratego
- Tablut
- Thurn and Taxis (board game)
- Tic-tac-toe
- TwixT
- Upper bound
- Wordle
- Xiangqi
- SameAs
- 548eL
- Complejidad en los juegos
- Complexidade de jogos
- m.01v07y
- Q903738
- Spiel-Komplexität
- پیچیدگی بازی
- 游戏复杂度
- 게임 복잡도
- Subject
- Category:Combinatorial game theory
- Category:Game theory
- WasDerivedFrom
- Game complexity?oldid=1121391722&ns=0
- WikiPageLength
- 34864
- Wikipage page ID
- 317419
- Wikipage revision ID
- 1121391722
- WikiPageUsesTemplate
- Template:Dunno
- Template:Game theory
- Template:Reflist
- Template:Refn
- Template:Short description
- Template:Unknown