102 search results - page 8 / 21 » On Acyclicity of Games with Cycles |
GAMEON
2009
13 years 6 months ago
2009
This article, assuming that player motivations are the outcome of continuous player-environment interactions, applies the needs framework of Murray (1938) to a computer game and i...
CONCUR
2007
Springer
14 years 2 months ago
2007
Springer
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
DIGRA
2005
Springer
14 years 1 months ago
2005
Springer
This paper details a research methodology that emerged during an inquiry into game design aimed at promoting conceptual learning in physics. The methodology, Research as DesignDes...
HICSS
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper describes the design of a competitive game to support “offense” and “defense” teams as they develop and improve their scenarios and plans about possible crisis ...
CJCDGCGT
2005
Springer
13 years 10 months ago
2005
Springer
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...