Abstract
Serious Games research has become an active research topic in the recent years. In order to design Serious Games with an appropriate degree of complexity such that the games are neither boring nor frustrating, it is necessary to have a good understanding of the factors that determine the difficulty of a game. The present work is based on the idea that a game’s difficulty is reflected in the structure of its underlying state space. Therefore, we propose metrics to capture the structure of a state space and examine if their values correlate with the difficulty of the game. However, we find that only one of the metrics, namely the length of the optimal solution, influences the difficulty of the game. In addition, by focusing on the part of the state space, which is actually explored by human players, we can identify properties that predict the game’s difficulty perceived by the players. We thus conclude that it is not the structure of the whole state space that determines the difficulty of a game, but the rather limited part that is explored by human players.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Frensch, P., Funke, J.: Complex problem solving: The European Perspective. Lawrence Erlbaum Associates, New York (1995)
Funke, J.: Problemlösendes Denken (2003)
Newell, A., Simon, H.A.: Human Problem Solving. Prentice Hall, Englewood Cliffs (1972)
Halford, G.S., Wilson, W.H., Phillips, S.: Processing capacity defined by relational complexity: implications for comparative, developmental, and cognitive psychology. Behavioral & Brain Sciences 21, 803–865 (1998)
Kotovsky, K., Hayes, J.R., Simon, H.A.: Why are some problems hard? Evidence from Tower of Hanoi. Cognitive psychology 17, 248–294 (1985)
Anderson, J.R.: Cognitive Psychology and its Implications. W. H. Freeman and Co., New York (1980)
Newell, A.: Reasoning, problem solving and decision processes: the problem space as a fundamental category (1979)
Newman, M.E.: Networks: An Introduction. OUP Oxford (2010)
Bockholt, M.: Ein netzwerkanalytischer Ansatz zur Untersuchung der Komplexität des Rush-Hour-Spiels. Bachelor thesis, Heidelberg University, Institute for Computer Science (2013)
Anderson, J.R.: Problem solving and learning. American Psychologist 48 (1993)
Jarušek, P., Pelánek, R.: What determines difficulty of transport puzzles. In: Proc. of Florida Artificial Intelligence Research Society Conference (FLAIRS 2011), pp. 428–433 (2011)
Jarušek, P.: Modeling problem solving times in tutoring systems. Masarykova univerzita, Fakulta informatiky, Disertacnı práce (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Bockholt, M., Zweig, K.A. (2015). Why Is This So Hard? Insights from the State Space of a Simple Board Game. In: Göbel, S., Ma, M., Baalsrud Hauge, J., Oliveira, M., Wiemeyer, J., Wendel, V. (eds) Serious Games. JCSG 2015. Lecture Notes in Computer Science(), vol 9090. Springer, Cham. https://doi.org/10.1007/978-3-319-19126-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-19126-3_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19125-6
Online ISBN: 978-3-319-19126-3
eBook Packages: Computer ScienceComputer Science (R0)