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...
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 ...
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...
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 ...
Murray Turoff, Michael Chumer, Starr Roxanne Hiltz...
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...