Abstract
We present initial research regarding a system capable of generating novel card games. We furthermore propose a method for computationally analysing existing games of the same genre. Ultimately, we present a formalisation of card game rules, and a context-free grammar G cardgame capable of expressing the rules of a large variety of card games. Example derivations are given for the poker variant Texas hold 'em, Blackjack and UNO. Stochastic simulations are used both to verify the implementation of these well-known games, and to evaluate the results of new game rules derived from the grammar. In future work, this grammar will be used to evolve completely novel card games using a grammar-guided genetic program. © Springer-Verlag Berlin Heidelberg 2013.
Author supplied keywords
Cite
CITATION STYLE
Font, J. M., Mahlmann, T., Manrique, D., & Togelius, J. (2013). A card game description language. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7835 LNCS, pp. 254–263). Springer Verlag. https://doi.org/10.1007/978-3-642-37192-9_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
