This paper discusses emerging creative practices that involve interacting with generative computational systems, and the effect of such cybernetic interactions on our conceptions of creativity and agency. As computing systems have become more powerful in recent years, real time interaction with intelligent computational processes and models has emerged as a basis for innovative creative practices. Examples of these practices include interactive digital media installations, generative art works, live coding performances, virtual theatre, interactive cinema, and adaptive processes in computer games. In these types of activities computational systems have assumed a significant level of agency, or autonomy, that provoke questions about shared authorship and originality that are redefining our relationship with technologies and prompting new questions about human capabilities, values and the meaning of productive activities.

In this paper we introduce a prototype of ’meta-score’, a novel visual editor in PWGL, aimed at defining the structural, temporal and procedural properties of a musical composition. Meta-score is a music notation editor, thus, the score can be created manually by inputting the information using a GUI. However, meta-score extends the concept of a musical score so that the musical content can be defined not only manually but also procedurally. The composition is defined by placing scores (hence the name meta-score) on a timeline, creating dependencies between the objects, and defining the compositional processes associated with them. Meta-score presents the users with a three-stage compositional process beginning from the sketching of the overall structure along with the associated harmonic, rhythmic and melodic material; continuing with the procedural description of the composition and ending with the automatic production of the performance score. In this paper, we describe the present state of meta-score.

One of the goals of the study of music theory is to develop sets of rules to describe different styles of music. By formalising these rules so that their semantics are machine intelligible, it is possible to use computers to reason about and analyse these rules -- computational music theory. Anton is an automatic composition system based on this approach. It formalises the rules of Renaissance Counterpoint using AnsProlog and uses an answer set solver to compose pieces. This paper discusses Anton, presenting the ideas behind the system and focusing on the challenges of modelling and synthesising rhythm.

In this paper, we discuss motivations for studying interactive narrative in shared, persistent worlds using the established conventions of quest-based MMORPGs.  We present a framework for categorizing the various techniques used in these games according to the interaction between the world model and the quest model .  Using this framework we generalize recent games to present a more dynamic world model, and investigate extensions to the quest model to support storytelling through adaptive quest narratives.

In previous research we concluded that a personality profile, based on the Five Factor Model, can be constructed from observations of a player’s behavior in a module that we designed for Neverwinter Nights (Lankveld et al. 2011a). In the present research, we investigate whether we can do the same thing in an actual modern commercial video game, in this case the game Fallout 3. We stored automatic observations on 36 participants who played the introductory stages of Fallout 3. We then correlated these observations with the participants’ personality profiles, expressed by values for five personality traits as measured by the standard NEO-FFI questionnaire. Our analysis shows correlations between all five personality traits and the game observations. These results validate and generalize the results from our previous research (Lankveld et al. 2011a). We may conclude that Fallout 3, and by extension other modern video games, allows players to express their personality, and can therefore be used to create personality profiles.

In this paper, we present a set of crowdsourcing and data processing techniques for annotating, segmenting and analyzing spoken dialog data to track topics of discussion between multiple users. Specifically, our system records the dialog between the parent and child as they interact with a reading game on a tablet, crowdsources the audio data to obtain transcribed text, and models topics of discussion from speech transcription using ConceptNet, a freely available commonsense knowledge base. We present preliminary results evaluating our technique using dialog collected using an interactive reading game for children 3-5 years of age. We successfully demonstrate the ability to form discussion topics by grouping words with similar meaning. The presented approach is entirely domain independent and in future work can be applied to a broad range of interactive entertainment applications, such as mobile devices, tablets and games.

Building complete interactive narrative systems is hard. Building systems that are satisfying for naïve users is especially hard since small deficiencies in component technologies can easily destroy the experience for a user. In this paper I argue that we can ameliorate some of these technical limitations through careful choice of genre and style, and discuss a number of properties of farce that make it a particularly attractive choice. Then I will describe work in progress on Punch and Judy AI Playset, a system that allows users to explore possible narratives in the Punch and Judy story world.

The Intentional Fast-Forward (IFF) planner is an attempt to apply fast forward-chaining state-space search methods to intentional planning---planning such that every action is directed toward some character's goal. The IFF heuristic is based on Hoffmann's original Fast Forward heuristic (2001), which solves a simplified version of the problem and uses that solution as a guide for the real problem. IFF incorporates constraints imposed by intentional planning to narrow down the set of steps which can be taken next, and it identifies fruitless branches of the search space early.

In recent years various games have been developed to generate useful data for scientific and commercial purposes. Current human computation games are tailored around a task they aim to solve, adding game mechanics to conceal monotonous workflows. These gamification approaches, although providing valuable gaming experience, do not cover the wide range of experiences seen in digital games today. This work presents a new use for design concepts for human computation games and an evaluation of player experiences.

Monte-Carlo Tree Search (MCTS) is an online planning algorithm that combines the ideas of best-first tree search and Monte-Carlo evaluation. Since MCTS is based on sampling, it does not require a transition function in explicit form, but only a generative model of the domain. Because it grows a highly selective search tree guided by its samples, it can handle huge search spaces with large branching factors. By using Monte-Carlo playouts, MCTS can take long-term rewards into account even with distant horizons. Combined with multi-armed bandit algorithms to trade off exploration and exploitation, MCTS has been shown to guarantee asymptotic convergence to the optimal policy, while providing approximations when stopped at any time. The relatively new MCTS approach has started a revolution in computer Go. Furthermore, it has achieved considerable success in domains as diverse as the games of Hex, Amazons, LOA, and Ms. Pacman; in General Game Playing, planning, and optimization. Whereas the focus of previous MCTS research has been on the practical application, current research begins to address the problem of understanding the nature, the underlying principles, of MCTS. A careful understanding of MCTS will lead to more effective search algorithms. Hence, my two interrelated research questions are: How can we formulate models that increase our understanding of how MCTS works? and How can we use the developed understanding to create effective search algorithms? This research summary describes the first steps I undertook in these directions, as well as my plans for future work.