No abstract

Jumping has been an important mechanic since its introduction in Donkey Kong. It has taken a variety of forms and shown up in numerous games, with each jump having a di erent feel. In this paper, we use a modi ed Nintendo Entertainment System (NES) emulator to semi-automatically run experiments on a large subset (∼30%) of NES platform games. We use these experiments to build models of jumps from di erent developers, series, and games across the history of the console. We then examine these models to gain insights into di erent forms of jumping and their associated feel.

We propose and evaluate a new technique for learning hybrid automata automatically by observing the runtime behavior of a dynamical system. Working from a sequence of continuous state values and predicates about the environment, CHARDA recovers the distinct dynamic modes, learns a model for each mode from a given set of templates, and postulates causal guard conditions which trigger transitions between modes. Our main contribution is the use of information-theoretic measures (1) as a cost function for data segmentation and model selection to penalize over-fitting and (2) to determine the likely causes of each transition. CHARDA is easily extended with different classes of model templates, fitting methods, or predicates. In our experiments on a complex videogame character, CHARDA successfully discovers a reasonable over-approximation of the character's true behaviors. Our results also compare favorably against recent work in automatically learning probabilistic timed automata in an aircraft domain: CHARDA exactly learns the modes of these simpler automata.

Game maps are useful for human players, general-game-playing agents, and data-driven procedural content generation. ese maps are generally made by hand-assembling manually-created screenshots of game levels. Besides being tedious and error-prone, this approach requires additional e ort for each new game and level to be mapped. e results can still be hard for humans or computational systems to make use of, privileging visual appearance over semantic information. We describe a so ware system, Mappy, that produces a good approximation of a linked map of rooms given a Nintendo Entertainment System game program and a sequence of bu on inputs exploring its world. In addition to visual maps, Mappy outputs grids of tiles (and how they change over time), positions of non-tile objects, clusters of similar rooms that might in fact be the same room, and a set of links between these rooms. We believe this is a necessary step towards developing larger corpora of high-quality semantically-annotated maps for PCG via machine learning and other applications.

Techniques for procedural content generation via machine learning (PCGML) have been shown to be useful for generating novel game content. While used primarily for producing new content in the style of the game domain used for training, recent works have increasingly started to explore methods for discovering and generating content in novel domains via techniques such as level blending and domain transfer. In this paper, we build on these works and introduce a new PCGML approach for producing novel game content spanning multiple domains. We use a new affordance and path vocabulary to encode data from six different platformer games and train variational autoencoders on this data, enabling us to capture the latent level space spanning all the domains and generate new content with varying proportions of the different domains.

No abstract

Digital games are hindered as an artform by significant technical barriers to entry, which exclude many would-be game developers from participating in this medium of expression. Casual creators for game design attempt to mitigate these barriers, but—like conventional game development tools—often require users to “work their way up” from low-level mechanics to high-level rhetorical or expressive goals, rather than allowing them to start with high-level rhetorical goals and “work their way down.” The constraint-based game generator Gemini is well-suited to the generation of games that meet high-level expressive goals, but is difficult for casual users to work with. We present Germinate, a mixed-initiative casual creator for rhetorical games that extends Gemini with a more approachable graphical user interface. A preliminary expert evaluation revealed that Germinate affords a playful approach to rhetorical game design by generating games that successfully meet user intent in surprising and novel ways.

is paper expands on and re nes the theoretical framework of operational logics, which simultaneously addresses how games operate at a procedural level and how games communicate these operations to players. In the years since their introduction, operational logics have been applied in domains ranging from game studies to game generation and game modeling languages. To support these uses and to enable new ones, we resolve some standing ambiguities and provide a catalog of key, fundamental operational logics. Concretely, we provide an explicit and detailed de nition of operational logics; specify a set of logics which seems fundamental and su ces to interpret a broad variety of games across several genres; give the rst detailed explanation of how exactly operational logics combine; and suggest application domains for which operational logics-based analysis and knowledge representation are especially appropriate. CCS CONCEPTS •Computing methodologies → Knowledge representation and reasoning; Ontology engineering; •Applied computing → Media arts;