1306 search results - page 11 / 262 » Strategy Acquisition for the Game |
112
click to vote
AIED
2005
Springer
15 years 6 months ago
2005
Springer
Modern computer games show potential not just for engaging and entertaining users, but also in promoting learning. Game designers employ a range of techniques to promote long-term ...
CORR
2008
Springer
15 years 24 days ago
2008
Springer
We prove that optimal strategies exist in perfect-information stochastic games with finitely many states and actions and tail winning conditions.
102
Voted
JCP
2007
15 years 18 days ago
2007
Abstract— In this paper, we develop a mixed-initiative intelligent tutor for the game of Sudoku called MITS. We begin by developing a characterization of the strategies used in S...
87
Voted
JSYML
2011
14 years 3 months ago
2011
We locate winning strategies for various Σ0 3-games in the L-hierarchy in order to prove the following:
133
Voted
MST
2011
14 years 7 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...