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 15: | Line 15: | ||
* [[Combinatorial game theory]] | * [[Combinatorial game theory]] | ||
* [[Complexity]] | * [[Complexity]] | ||
| − | |||
| − | |||
* [[Computational complexity]] | * [[Computational complexity]] | ||
* [[Computational complexity theory]] | * [[Computational complexity theory]] | ||
| Line 25: | Line 23: | ||
* [[List of NP-complete games and puzzles]] | * [[List of NP-complete games and puzzles]] | ||
* [[List of PSPACE-complete games and puzzles]] | * [[List of PSPACE-complete games and puzzles]] | ||
| − | |||
* [[Shannon number]] | * [[Shannon number]] | ||
* [[Solved game]] | * [[Solved game]] | ||
Revision as of 09:09, 6 September 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 - see Game tree
- Decision complexity
- Game-tree complexity
- Computational complexity
See also
- Combinatorial game theory
- Complexity
- Computational complexity
- Computational complexity theory
- Game
- Game theory
- Game tree
- Go and mathematics
- List of NP-complete games and puzzles
- List of PSPACE-complete games and puzzles
- Shannon number
- Solved game
External Links
- Game complexity @ Wikipedia
