Abstract
This paper describes how Genetic Algorithm can be used to control the level of difficulty in a game based on a user’s skill. An algorithm is proposed to control the difficulty of a game according to user’s propensity in our previous work [1], [2]. But the searching spaces are very narrow and convergence of chromosomes is also slow because the game progresses step-by-step and chromosomes are evaluated simultaneously while playing the game. Thus, a method is presented to expand the searching spaces and converge quickly on the Genetic Algorithm in the domain of sequential progress.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Um, S.W., Kim, T.Y., Choi, J.S.: Player dependent difficulty control algorithm using G.A. Journal of the Korean Society for Computer Game 1 (October 2002)
Um, S.W., Kim, T.Y., Choi, J.S.: User Adaptive Algorithm for Game Difficulty Control. In: ADCOG (2003)
Woodcock, S.: Game AI: The State of the Industry. Gamasutra Magazine (November 2000)
Pottinger, D.C., Laird, J.E.: Game AI: The State of the Industry Part 2. Gamasutra (November 2000)
Schaeffer, J.: The games computers (and people) play. In: AAAI/IAAI, p. 1179 (2000)
Campbell, M., Joseph Hoane Jr., A., Hsu, F.-h.: Deep blue. Artificial Intelligence 134, 57–83 (2002); Also in Schaeffer, J., Jaap van den Herik, H. (eds.): Chips challenging champions, pp. 97–123. Elsevier Science, Amsterdam (2001)
McCarthy, J.: Partial formalizations and the lemmings game. Technical report, Stanford University, Formal Reasoning Group (1995)
Carmel, D., Markovitch, S.: Learning Models of Opponent’s Strategy in Game Playing. CIS Report #9318 (1993)
Goldberg, D.: Genetic Algorithms in search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Poli, R., Langdon, W.B.: A New Schema Theory for Genetic Programming with One-point Crossover and Point Mutation. Technical Report CSRP-97-13 (1997)
Beasley, D., Bull, D., Martin, R.: An overview of Genetic Algorithms: Part 1, fundamentals. University Computing 15(2), 58–69 (1993)
Koza, J.: Genetic Programming: On the programming of computers by means of Natural Selection. In: chapter four introductory examples of Genetic Programming, pp. 147–162. The MIT Press, Cambridge (1992)
Goldberg, D.E., Sastry, K.: A Practical Schema Theorem for Genetic Algorithms Design and Tuning. IlliGAL Report No. 10 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Um, SW., Lee, SH., Kim, TY., Choi, JS. (2006). Cyclic Reproduction Scheme in Genetic Algorithm for Evolutionary Game. In: Pan, Z., Aylett, R., Diener, H., Jin, X., Göbel, S., Li, L. (eds) Technologies for E-Learning and Digital Entertainment. Edutainment 2006. Lecture Notes in Computer Science, vol 3942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11736639_76
Download citation
DOI: https://doi.org/10.1007/11736639_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33423-1
Online ISBN: 978-3-540-33424-8
eBook Packages: Computer ScienceComputer Science (R0)