Evolutionary game design

IEEE Transactions on Computational Intelligence and AI in Games

Volumn 2, Issue 1, 2010, Pages 1-16

  Browne, Cameron ^a   Maire, Frederic ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

Aesthetics; Artificial intelligence (AI); Combinatorial game; Evolutionary search; Game design

Indexed keywords

AUTOMATED MEASUREMENT; COMBINATORIAL GAME; EVOLUTIONARY GAMES; EVOLUTIONARY SEARCH; GAME DESIGN; GAME SYSTEM; HUMAN PLAYERS; NEW HIGH; SELF-PLAY;

ARTIFICIAL INTELLIGENCE; EVOLUTIONARY ALGORITHMS;

DESIGN;

EID: 77955705286     PISSN: 1943068X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCIAIG.2010.2041928     Document Type: Article

References (43)

1. B. Pell, "METAGAME: A new challenge for games and learning," in Heuristic Programming in Artificial Intelligence 3, H. Van den Kerik and L. Allis, Eds. Chichester, U.K.: Ellis Horwood, 1992.
2. K. Salen and E. Zimmerman, Rules of Play. Cambridge, MA: MIT Press, 2004.
3. E. Berlekamp, J. Conway, and R. Guy, Winning Ways for Your Mathematical Plays. London, U.K.: Academic, 1982, vol.1 and 2.
4. R. Dawkins, The Selfish Gene. Oxford, U.K.: Oxford Univ. Press, 1976.
5. A. Borvo, Anatomie D'un Jeu de Cartes: L'Aluette ou le Jeu de Vache. Nantes, France: Librarie Nantaise Yves Vachon, 1977.
6. D. Parlett, "What is a ludeme?," Incompleat Gamester, 2007 [Online]. Available: http://www.davidparlett.co.uk/gamester/ludemes.html
7. C. Browne, Hex Strategy: Making the Right Connections. Natick, MA: AK Peters, 2000.
8. J. Holland, Emergence: From Chaos to Order. Redwood City, CA: Addison-Wesley, 1998.
9. L. Horsten, Philosophy of Mathematics, 2007 [Online]. Available: http://plato.stanford.edu/entries/philosophy-mathematics
10. J. Pitrat, "Realization of a general game-playing program," in Proc. Int. Fed. Inf. Process. Congr., 1968, vol.2, pp. 1570-1574.
11. M. Genesereth, N. Love, and B. Pell, "General game playing: Overview of the AAAI competition," AI Mag., vol.26, no.2, pp. 62-72, 2005.
12. N. Love, T. Hinrichs, D. Haley, E. Schkufza, and M. Genesereth, "General game playing: Game description language specification," Stanford Logic Group, Stanford, CA, Tech. Rep. LG-2006-2101, 2006.
13. J. Mallett and M. Lefler, Zillions of Games, 1998 [Online]. Available: http://www.zillions-of-games.com
14. B. Kernighan and R. Pike, The Practice of Programming. Reading, MA: Addison-Wesley, 1999.
15. C. Browne, "Automatic generation and evaluation of recombination games," Ph.D. dissertation, FIT, Queensland Univ. Technol., Brisbane, Australia, 2008.
16. S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, 2nd ed. Englewood Cliffs, NJ: Prentice Hall, 2003.
17. S. Epstein, "Deep forks in strategic maps: Playing to win," in Heuristic Programming in Artificial Intelligence 2, D. Levy and D. Beal, Eds. Chichester, U.K.: Ellis Horwood, 1991, pp. 189-203.
18. B. Pell, "Strategy generation and evaluation for meta-game playing," Ph.D. dissertation, Trinity College, Univ. Cambridge, Cambridge, U.K., 1993.
19. T. Bäck, F. Hoffmeister, and H. Schwefel, "Basic aspect of evolution strategies," Stat. Comput., vol.4, no.2, pp. 51-63, 1994.
20. M. Thompson, "Defining the abstract," The Games J., 2000 [Online]. Available: http://www.thegamesjournal.com/articles/ DefiningtheAbstract. shtml
21. I. I. Althöfer, "Computer-aided game inventing," Friedrich Schiller Universität, Jena, Germany, Tech. Rep., 2003 [Online]. Available: http://www.minet...uni-jena.de.preprints/althoefer-03/CAGI.pdf
22. H. Iida, K. Takahara, J. Nagashima, Y. Kajihara, and T. Hashimoto, "An application of game-refinement theory to Mah Jong," in Proceedings of the International Conference on Entertainment Computing, ser. Lecture Notes in Computer Science, M. Rauterberg, Ed. Berlin, Germany: Springer-Verlag, 2004, vol.3116, pp. 445-450.
23. C. Browne, Connection Games: Variations on a Theme. Natick, MA: AK Peters, 2005.
24. W. Kramer, "What makes a game good?," The Games J., 2000 [Online]. Available: http://www.thegamesjournal.com/articles/What- MakesaGame.shtml
25. M. Gardner, "Theory of everything," The New Criterion, vol.23, no.2, 2004 [Online]. Available: http://www.newcriterion.com/articles.cfm/ theory-of-everything-1136
26. H. Ellis, Impressions and Comments. Boston, MA: Houghton Mifflin, 1914.
27. G. Birkhoff, Aesthetic Measure. Cambridge, MA: Harvard Univ. Press, 1933.
28. G. Stiny and J. Gips, Algorithmic Aesthetics: Computer Models for Criticism and Design in the Arts. Berkeley, CA: Univ. California Press, 1978.
29. A. Perlis, "Epigrams on programming," SIGPLAN Notices, vol.17, no.9, pp. 7-13, 1982.
30. T. Rolle, "Development of a multi-game engine," Diploma thesis, Faculty Math. Comput. Sci., Friedrich-Schiller-University, Jena, Germany, 2003.
31. L. Hansheng and K. Lishan, "Balance between exploration and exploitation in genetic search,"Wuhan Univ. J. Natural Sci., vol.4, no.1, pp. 28-32, 1999.
32. T. Bäck, F. Hoffmeister, and H. Schwefel, "A survey of evolution strategies," in Genetic Algorithms, R. Belew and L. Booker, Eds. San Mateo, CA: Morgan Kaufman, 1991, pp. 2-9.
33. J. Baker, "Reducing bias and inefficiency in the selection algorithm," in Proc. 2nd Int. Conf. Genetic Algorithms Appl., Mahwah, NJ, 1987, pp. 14-21.
34. J. Koza, "Genetic programming as a means for programming computers by natural selection," Stat. Comput., vol.4, pp. 87-112, 1994.
35. W. Langdon, "Data structures and genetic programming," in Advances in Genetic Programming 2. Cambridge, MA: MIT Press, 1996, pp. 395-414.
36. D. Montana, "Strongly typed genetic programming," J. Evol. Comput., vol.3, pp. 199-230, 1995.
37. Z. Michalewicz and G. Nazhiyath, "Genocop III: A co-evolutionary algorithm for optimisation problems with nonlinear constraints," in Proc. 2nd IEEE Conf. Evol. Comput., 1995, pp. 647-651.
38. J. Greene, Angband, 2007 [Online]. Available: http://members.cox.net/ nppangband/download.htm
39. G. Costikyan, "Don't be a vidiot: What computer game designers can learn from non-electronic games," 2005 [Online]. Available: http://www.costik.com/vidiot.html
40. T. Soule and J. Foster, "Code size and depth flows in genetic programming," in Proc. 2nd Conf. Genetic Programm., 1997, pp. 313-320.
41. N. R. Andrés, Nestorgames, 2009 [Online]. Available: http://www.nestorgames.com
42. S. Alden, BoardGameGeek, 2000 [Online]. Available: http://www. boardgamegeek.com
43. L. Kocsis and C. Szepesvári, "Bandit based Monte-Carlo planning," in Proc. 15th Eur. Conf. Mach. Learn., 2006, pp. 282-293.