Abstract
In order to reach as many players as possible, videogames usually allow the user to choose the difficulty level. To do it, game designers have to decide the values that some game parameters will have depending on that decision. In simple videogames this is almost trivial: minesweeper is harder with longer board sizes and number of mines. In more complex games, game designers may take advantage of data mining to establish which of all the possible parameters will affect positively to the player experience. This paper describes the use of Formal Concept Analysis to help to balance the game using the logs obtained in the tests made prior the release of the game.
Supported by the Spanish Committee of Education & Science (TIN2005-09382-C02-01)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Bopp. The Future of Learning: Affective and Emotional Aspects of Human-Computer Interaction, volume 1, chapter Didactic Analysis of Digital Games and Game-Based Learning, pages 8–37. IOS Press, 2006.
B. Díaz-Agudo, M. A. Gómez-Martín, P. P. Gömez-Martín, and P. A. González-Calero. Formal concept analysis for knowledge refinement in case based reasoning. In M. Bramer, F. Coenen, and T. Allen, editors, XXV International Conference on Innovative Techniques and Applications of Artificial Intelligence (AI 2005), pages 233–245. Springer, 2005.
B. Díaz-Agudo and P. A. González-Calero. Formal Concept Analysis as a Support Technique for CBR. In Knowledge-Based Systems, 14 (3-4), pages 163–172. Elsevier, June 2001.
B. Ganter and R. Wille. Formal concept analysis.
J.-L. Guigues and V. Duquenne. Familles minimales d’implications informatives resultant d’un tableau de données binaires. Math. Sei. Humanies 95, 1986, 5–18.
M. Luxenburguer. Implications partiellesdans un contexte. Mathématiques,Informatique et Sciences Humaines, 113(29):35–55, 1991.
C. Mauduit. U61. Available at http://www.ufoot.org/u61 (last access, June 2006).
J. A. Recio-García, M. A. Gómez-Martín, B. Díaz-Agudo, and P. A. González-Calero. Improving annotation in the semantic web and case authoring in textual cbr. In 8th European Conference on Case-Based Reasoning (ECCBR’06). Springer Verlag, 2006.
G. Stumme. Efficient data mining based on formal concept analysis. In A. Hameurlain, R. Cicchetti, and R. Traunmüller, editors, Database and Expert Systems Applications, 13th International Conference, volume 2453 of Lecture Notes in Computer Science. Springer, September 2002.
Wikipedia, the free encyclopedia. Tetris entry. Available at http://en. wikipedia.org/wiki/Tetris.
R. Wille. Restructuring Lattice Theory: an approach based on hierarchies of concepts. Ordered Sets, 1982.
I. Witten and E. Frank. Data Mining, practical machine learning tools and techniques wiht Java Implementations. 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag London Limited
About this paper
Cite this paper
Gómez-Martín, M.A., Gómez-Martín, P.P., Gonzâlez-Calero, P.A., Díaz-Agudo, B. (2007). Adjusting game difficulty level through Formal Concept Analysis. In: Bramer, M., Coenen, F., Tuson, A. (eds) Research and Development in Intelligent Systems XXIII. SGAI 2006. Springer, London. https://doi.org/10.1007/978-1-84628-663-6_16
Download citation
DOI: https://doi.org/10.1007/978-1-84628-663-6_16
Publisher Name: Springer, London
Print ISBN: 978-1-84628-662-9
Online ISBN: 978-1-84628-663-6
eBook Packages: Computer ScienceComputer Science (R0)