Why Is This So Hard? Insights from the State Space of a Simple Board


Why Is This So Hard? Insights from the State Space of a Simple Board Game Joint International Conference on Serious Games JCSG 2015: Serious Games pp 147-157 | Cite as Mareike Bockholt (1) Email author ([email protected]) Katharina Anna Zweig (1) 1. Graph Theory and Complex Network Analysis Group, Department of Computer Science, TU Kaiserslautern, Kaiserslautern, Germany Conference paper First Online: 28 May 2015 1 Citations 5 Readers 1.2k Downloads Part of the Lecture Notes in Computer Science book series (LNCS, volume 9090)

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.

Keywords Serious games Human problem solving Complexity Rush hour Network analysis This is a preview of subscription content, log in to check access

Preview Unable to display preview. Download preview PDF. Unable to display preview. Download preview PDF.

References 1.

Frensch, P., Funke, J.: Complex problem solving: The European Perspective. Lawrence Erlbaum Associates, New York (1995) Google Scholar (http://scholar.google.com/scholar_lookup? title=Complex%20problem%20solving%3A%20The%20European%20Perspective&author=P.%20Frensch&author=J.%20Funke&publicatio n_year=1995)


Funke, J.: Problemlösendes Denken (2003) Google Scholar (http://scholar.google.com/scholar?q=Funke%2C%20J.%3A%20Probleml%C3%B6sendes%20Denken%20%282003%29)


Newell, A., Simon, H.A.: Human Problem Solving. Prentice Hall, Englewood Cliffs (1972) Google Scholar (http://scholar.google.com/scholar_lookup? title=Human%20Problem%20Solving&author=A.%20Newell&author=HA.%20Simon&publication_year=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) Google Scholar (http://scholar.google.com/scholar_lookup? title=Processing%20capacity%20defined%20by%20relational%20complexity%3A%20implications%20for%20comparative%2C%20develo pmental%2C%20and%20cognitive%20psychology&author=GS.%20Halford&author=WH.%20Wilson&author=S.%20Phillips&journal=Beh avioral%20%26%20Brain%20Sciences&volume=21&pages=803-865&publication_year=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) CrossRef (http://doi.org/10.1016/0010-0285(85)90009-X) Google Scholar (http://scholar.google.com/scholar_lookup? title=Why%20are%20some%20problems%20hard%3F%20Evidence%20from%20Tower%20of%20Hanoi&author=K.%20Kotovsky&author =JR.%20Hayes&author=HA.%20Simon&journal=Cognitive%20psychology&volume=17&pages=248-294&publication_year=1985)


Anderson, J.R.: Cognitive Psychology and its Implications. W. H. Freeman and Co., New York (1980) Google Scholar (http://scholar.google.com/scholar_lookup? title=Cognitive%20Psychology%20and%20its%20Implications&author=JR.%20Anderson&publication_year=1980)


Newell, A.: Reasoning, problem solving and decision processes: the problem space as a fundamental category (1979) Google Scholar (http://scholar.google.com/scholar? q=Newell%2C%20A.%3A%20Reasoning%2C%20problem%20solving%20and%20decision%20processes%3A%20the%20problem%20spac e%20as%20a%20fundamental%20category%20%281979%29)


Newman, M.E.: Networks: An Introduction. OUP Oxford (2010) Google Scholar (http://scholar.google.com/scholar? q=Newman%2C%20M.E.%3A%20Networks%3A%20An%20Introduction.%20OUP%20Oxford%20%282010%29)


Bockholt, M.: Ein netzwerkanalytischer Ansatz zur Untersuchung der Komplexität des Rush-Hour-Spiels. Bachelor thesis, Heidelberg University, Institute for Computer Science (2013) Google Scholar (http://scholar.google.com/scholar? q=Bockholt%2C%20M.%3A%20Ein%20netzwerkanalytischer%20Ansatz%20zur%20Untersuchung%20der%20Komplexit%C3%A4t%20de s%20Rush-HourSpiels.%20Bachelor%20thesis%2C%20Heidelberg%20University%2C%20Institute%20for%20Computer%20Science%20%282013%29)


Anderson, J.R.: Problem solving and learning. American Psychologist 48 (1993) Google Scholar (http://scholar.google.com/scholar? q=Anderson%2C%20J.R.%3A%20Problem%20solving%20and%20learning.%20American%20Psychologist%2048%20%281993%29)


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) Google Scholar (http://scholar.google.com/scholar? q=Jaru%C5%A1ek%2C%20P.%2C%20Pel%C3%A1nek%2C%20R.%3A%20What%20determines%20difficulty%20of%20transport%20puz zles.%20In%3A%20Proc.%20of%20Florida%20Artificial%20Intelligence%20Research%20Society%20Conference%20%28FLAIRS%20201 1%29%2C%20pp.%20428%E2%80%93433%20%282011%29)


Jarušek, P.: Modeling problem solving times in tutoring systems. Masarykova univerzita, Fakulta informatiky, Disertacnı práce (2013) Google Scholar (http://scholar.google.com/scholar? q=Jaru%C5%A1ek%2C%20P.%3A%20Modeling%20problem%20solving%20times%20in%20tutoring%20systems.%20Masarykova%20un iverzita%2C%20Fakulta%20informatiky%2C%20Disertacn%C4%B1%20pr%C3%A1ce%20%282013%29)

Copyright information © Springer International Publishing Switzerland 2015

About this paper Cite this paper as: 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 DOI (Digital Object Identifier) http://doi.org/10.1007/978-3-319-19126-3_13 Publisher Name Springer, Cham Print ISBN 978-3-319-19125-6 Online ISBN 978-3-319-19126-3 eBook Packages Computer Science About this book Reprints and Permissions

Personalised recommendations

© 2017 Springer International Publishing AG. Part of Springer Nature. Not logged in Not affiliated


Why Is This So Hard? Insights from the State Space of a Simple Board

Why Is This So Hard? Insights from the State Space of a Simple Board Game Joint International Conference on Serious Games JCSG 2015: Serious Games pp ...

48KB Sizes 1 Downloads 6 Views

Recommend Documents

Why Is Innovation So Hard? - Forbes
Aug 4, 2014 - But it is hard to define. ... The process results in innovation when we co-create something with customers

Why Is Healthcare So Expensive? | Yale Insights
Feb 12, 2016 - The data covers 2007 to 2011 and more than 88 million unique individuals, or nearly one in three individu

Why Is It So Hard To Rehabilitate Shallow Lakes?
Shallow lakes have changed profoundly! ... compared to deeper lakes-why? a) Fish abundance is much higher in shallow lak

5 Reasons Why Falling In Love Is So Hard - Pinterest
Fondos de Tom Cruise en Jerry Maguire. Imagenes y fotos de Tom Cruise en Jerry Maguire. Fondos de pantalla, wallpapers y

Why Is English So Hard to Learn? - Oxford Royale Academy
Jun 17, 2014 - We consider why English is so hard to learn. ... One of the reasons why English is known for being diffic

Why Is the First Year of Teaching So Hard - The Atlantic
Apr 13, 2016 - Right before winter break, Duklewski switched to an individual-point system to reward students for indepe

Why is this game so shallow - Overwatch Forums - Battle.net
Why is this game so shallow ... Blizzard keeps trying to push the competitive aspect of this game out their, but its so

May 9, 2017 - REGULAR SCHOOL BOARD MEETING AGENDA. May 9, 2017 ... No agenda items. 3. Minutes a. Request approval of mi

Why is absolute advantage determined by a simple comparison of
An absolute advantage is defined as an ability to produce something at a lower cost per unit than any competitor, or to

This Is Why Warren Buffett Is a Billionaire | Inc.com
Oct 22, 2016 - Answer by Amaury Fernandez, analyst at Citigroup, on Quora: One of the smartest maneuvers I've seen in bu