On the computational complexity of a game of cops and robbers.
Marcello MaminoPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- computational complexity
- game theory
- np complete
- nash equilibrium
- high computational complexity
- video games
- game theoretic
- game playing
- game design
- computationally efficient
- computational efficiency
- computer games
- educational games
- optimal strategy
- game play
- low complexity
- memory requirements
- special case
- knowledge sharing
- computational cost
- np hard
- professional development
- virtual world
- bit rate
- worst case
- game development
- imperfect information
- perfect information
- real time strategy games
- pac man