On Winning Conditions of High Borel Complexity in Pushdown Games.

Published in: Fundam. Informaticae (2005)

Keyphrases

wide range
game design
sufficient conditions
computational complexity
imperfect information
lower bound
search space
dynamic programming
computational cost
worst case
markov chain
case study
high precision
computer games
video games
game play
game playing
complexity analysis
stationary policies