Difference between revisions of "Game complexity"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (→See also) |
Karl Jones (Talk | contribs) (→See also) |
||
Line 21: | Line 21: | ||
* [[Game]] | * [[Game]] | ||
* [[Game theory]] | * [[Game theory]] | ||
+ | * [[Go and mathematics]] | ||
+ | * [[List of NP-complete games and puzzles]] | ||
+ | * [[List of PSPACE-complete games and puzzles]] | ||
* [[Mathematics]] | * [[Mathematics]] | ||
* [[Shannon number]] | * [[Shannon number]] | ||
+ | * [[Solved game]] | ||
== External Links == | == External Links == |
Revision as of 15:54, 9 May 2016
Game complexity is a system of measurement in combinatorial game theory.
Description
Various game complexity systems exist, including:
- State-space complexity
- Game tree size
- Decision complexity
- Game-tree complexity
- Computational complexity
See also
- Combinatorial game theory
- Complexity
- Computating
- Computation
- Computational complexity
- Computational complexity theory
- Game
- Game theory
- Go and mathematics
- List of NP-complete games and puzzles
- List of PSPACE-complete games and puzzles
- Mathematics
- Shannon number
- Solved game
External Links
- Game complexity @ Wikipedia