A derived relations analysis of computer gaming complexity

Linehan, Conor and Roche, Bryan and Stewart, Ian (2010) A derived relations analysis of computer gaming complexity. European Journal of Behavior Analysis, 11 (1). pp. 69-78. ISSN 1502-1149

Documents
A derived relations analysis of computer gaming complexity
[img]
[Download]
Request a copy
[img] PDF
linehan,_roche_and_stewart_eprints_version.pdf - Whole Document
Restricted to Repository staff only

172kB

Official URL: http://www.ejoba.org/

Abstract

Computer game designers have frequently identified game complexity or “challenge”
as a key variable in determining the level of enjoyment users derive from computer
games. However, no technical and psychological definition of complexity exists in
the gaming literature. The current paper reports on an experiment designed to test a
derived relations approach to defining game complexity. Twenty three participants
were recruited and exposed to a stimulus equivalence training procedure, designed to
train two five-member equivalence relations. Subsequently, participants were
presented with a simulated computer game in which they were required to
demonstrate responding in accordance with both one-node and three-node derived
stimulus equivalence relations under severe time constraints in order to gain a high
score. Participants demonstrated consistently correct responding in accordance with
DRR. In addition, significantly more correct responses were produced at the
relationally less complex (i.e., one-node) level. It is suggested that a derived relations
analysis of game complexity may serve as a viable framework within which to
investigate the complex processes involved in game playing.

Item Type:Article
Additional Information:Computer game designers have frequently identified game complexity or “challenge” as a key variable in determining the level of enjoyment users derive from computer games. However, no technical and psychological definition of complexity exists in the gaming literature. The current paper reports on an experiment designed to test a derived relations approach to defining game complexity. Twenty three participants were recruited and exposed to a stimulus equivalence training procedure, designed to train two five-member equivalence relations. Subsequently, participants were presented with a simulated computer game in which they were required to demonstrate responding in accordance with both one-node and three-node derived stimulus equivalence relations under severe time constraints in order to gain a high score. Participants demonstrated consistently correct responding in accordance with DRR. In addition, significantly more correct responses were produced at the relationally less complex (i.e., one-node) level. It is suggested that a derived relations analysis of game complexity may serve as a viable framework within which to investigate the complex processes involved in game playing.
Keywords:computer games, complexity, Psychology, behavioural psychology, challenge, derived relational responding
Subjects:G Mathematical and Computer Sciences > G440 Human-computer Interaction
C Biological Sciences > C830 Experimental Psychology
Divisions:College of Science > School of Computer Science
ID Code:3395
Deposited By: Conor Linehan
Deposited On:01 Oct 2010 07:21
Last Modified:13 Mar 2013 08:47

Repository Staff Only: item control page