<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Extracting Physics from Blended Platformer Game Levels</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Adam</forename><surname>Summerville</surname></persName>
							<email>asummerville@cpp.edu</email>
							<affiliation key="aff0">
								<orgName type="institution">California State Polytechnic University</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Anurag</forename><surname>Sarkar</surname></persName>
							<email>sarkar.an@northeastern.edu</email>
							<affiliation key="aff1">
								<orgName type="institution">Northeastern University</orgName>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Sam</forename><surname>Snodgrass</surname></persName>
							<affiliation key="aff2">
								<address>
									<settlement>modl</settlement>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Joseph</forename><surname>Osborn</surname></persName>
							<email>joseph.osborn@pomona.edu</email>
							<affiliation key="aff3">
								<orgName type="institution">Pomona College</orgName>
							</affiliation>
						</author>
						<title level="a" type="main">Extracting Physics from Blended Platformer Game Levels</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">9AC731A58DDFFA2817794C25EC89FA3D</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T04:59+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Several recent PCGML methods have focused on generating game levels and content that blend the properties of multiple games. However, these works ignore the fact that blended levels must in some way have blended physics models that enable playable levels. In this work, we present an approach for extracting jump physics models for such blended game domains. We make use of variational autoencoders (VAEs) trained on level data from six platformers, encoded using a previously introduced path and affordance vocabulary. Our results show that the extraction model is able to reasonably recreate the original physics models when given ground truth paths, and is able to produce physics models that can reliably allow an agent to play the generated levels. We also find that there are promising results for blended physics models behaving intuitively between physics models of the original games being blended.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Introduction</head><p>While methods for procedural content generation via machine learning (PCGML) <ref type="bibr" target="#b16">(Summerville et al. 2018)</ref> were initially motivated by wanting to generate novel content in the style of existing games such as Super Mario Bros. <ref type="bibr" target="#b15">(Summerville and Mateas 2016;</ref><ref type="bibr" target="#b3">Guzdial and Riedl 2016a;</ref><ref type="bibr" target="#b12">Snodgrass and Ontañón 2017)</ref> and The Legend of Zelda <ref type="bibr" target="#b14">(Summerville and Mateas 2015)</ref>, a new body of work has emerged that focuses on PCGML techniques that seek to leverage trained models to blend existing game domains and/or generate new domains altogether. This has produced works that leverage more creative PCGML approaches such as domain transfer <ref type="bibr" target="#b11">(Snodgrass and Ontanon 2016;</ref><ref type="bibr" target="#b13">Snodgrass 2019)</ref>, model blending <ref type="bibr" target="#b4">(Guzdial and Riedl 2016b;</ref><ref type="bibr" target="#b8">Sarkar and Cooper 2018)</ref>, computational creativity <ref type="bibr" target="#b5">(Guzdial and Riedl 2018)</ref>, training on multiple domains to learn blended domains <ref type="bibr" target="#b10">(Sarkar, Yang, and Cooper 2019)</ref> or a combination of the above <ref type="bibr" target="#b13">(Snodgrass and Sarkar 2020)</ref>.</p><p>While some works have included path information, there has been no notion of completing the circle i.e., do the physics latent within generated paths encode a physics</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Related Work</head><p>Most prior techniques for procedural content generation via machine learning (PCGML) <ref type="bibr" target="#b16">(Summerville et al. 2018</ref>) have focused on learning models for a single game. Such methods have involved using autoencoders <ref type="bibr" target="#b7">(Jain et al. 2016)</ref>, LSTMs <ref type="bibr" target="#b15">(Summerville and Mateas 2016)</ref>, GANs <ref type="bibr" target="#b18">(Volz et al. 2018)</ref>, Bayes Nets <ref type="bibr" target="#b3">(Guzdial and Riedl 2016a)</ref>, n-grams <ref type="bibr" target="#b1">(Dahlskog, Togelius, and Nelson 2014)</ref> and Markov models <ref type="bibr" target="#b12">(Snodgrass and Ontañón 2017)</ref> for learning generative models for games such as Super Mario Bros., The Legend of Zelda and Kid Icarus. In an effort to address generalization and lack of data as well as wanting to discover and create new game domains (similar to e.g. the game blending framework of <ref type="bibr" target="#b2">Gow and Corneli (2015)</ref>), more recent works have built models that work with multiple games and domains at the same time. This has included domain transfer <ref type="bibr" target="#b11">(Snodgrass and Ontanon 2016;</ref><ref type="bibr" target="#b13">Snodgrass 2019)</ref>, game generation <ref type="bibr" target="#b5">(Guzdial and Riedl 2018)</ref> and game blending <ref type="bibr" target="#b8">(Sarkar and Cooper 2018;</ref><ref type="bibr" target="#b10">Sarkar, Yang, and Cooper 2019;</ref><ref type="bibr" target="#b13">Snodgrass and Sarkar 2020)</ref>. Recent work <ref type="bibr" target="#b9">(Sarkar et al. 2020)</ref> built on these latter game blending approaches by ex-Figure <ref type="figure">1</ref>: An example of the level representation used (note: color is added only for presentation purposes here). Player path is represented using + with special handling of start ( <ref type="formula">9</ref>`), end (¯), and places where the path overlaps non-empty tiles (ě for a moving hazard and ‹ for a collectable).</p><p>tending their domain from two to six games, introducing a path and affordance vocabulary and training on levels annotated with A* paths derived from the jump arcs of the respective games. This enabled generation of blended levels spanning all the games while also containing traversable paths and jumps. In this paper, we utilize the paths and jumps in the blended levels generated by this latter approach to extract physics models for the blended domains.</p><p>Such physics models have not been the subject of much prior PCGML work with a majority of prior PCGML research focusing on learning models of game levels and only a few attempting to learn models of game physics and game rules. <ref type="bibr" target="#b6">Guzdial, Li, and Riedl (2017)</ref> presented an approach termed game engine search for learning the rules of Super Mario Bros. using video gameplay data. Summerville, Osborn, and Mateas (2017) learned a hybrid automaton describing the jump physics in Mario. Similarly, <ref type="bibr">Summerville et al. (2017)</ref> used data from a Nintendo Entertainment System (NES) emulator to learn automata describing the jump physics of a large number of NES platformer games. To our knowledge, our work is the first to extract such physics models for blended game domains.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Level Data and Representation</head><p>For our approach, we used six classic NES platformer games -Super Mario Bros., Super Mario Bros. II: The Lost Levels, Ninja Gaiden, Metroid, Mega Man, and Castlevania -all represented using the path and affordance vocabulary introduced in <ref type="bibr" target="#b9">(Sarkar et al. 2020)</ref>, which in turn was derived using the Video Game Level Corpus <ref type="bibr" target="#b15">(Summerville et al. 2016)</ref> and the Video Game Affordance Corpus <ref type="bibr" target="#b0">(Bentley and Osborn 2019)</ref>. Because these games have disparate vocabularies of tiles, we need a common language to describe all of the levels -solidity, climbability, passable, powerup, hazard, moving, portal, collectable, and breakable. These affordances can be combined -e.g., a breakable brick would be "breakable+solid" -which leads to 14 unique combinations (see <ref type="bibr" target="#b9">(Sarkar et al. 2020</ref>) for a more detailed description).</p><p>A key difference between the level representations found here and in the earlier work of <ref type="bibr" target="#b9">Sarkar et al. (2020)</ref> is the representation found here includes not just path information but also the directionality of the path -the starting and ending position found in a segment have a special representation. This allows the downstream physics extraction process to extract the correct physics as paths are not necessarily bi-directional (e.g., very large falls should be represented as such, and not very high jumps). See Figure <ref type="figure">1</ref> for an example.</p><p>To account for differences in sizes and dimensions of the levels in each game, we used a uniform segment size of 15 ˆ32 for all games, adding vertical padding as required. We focused on horizontal sections of levels, thereby ignoring the vertical sections found in Ninja Gaiden, Metroid and Mega Man. After a filtering process to discard duplicate segments and segments mixing discrete rooms, we ended up with 1907 segments for Mario (SMB) (referring to both version of Mario mentioned above), 504 segments for Ninja Gaiden, 1833 segments for Metroid, 924 segments for Mega Man and 775 segments for Castlevania.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Generative Model</head><p>For generating levels from which to extract physics, we used a Gated Recurrent Unit-Variational Autoencoder (GRU-VAE), implemented using PyTorch <ref type="bibr">(Paszke et al. 2017)</ref>. The encoder consisted of 3 hidden layers of size 1024 while the decoder had 2 hidden layers of size 256-both using a dropout rate of 50%. To help with convergence, the variational loss was annealed linearly from 0 to 0.05 times the variational loss over the first 5 epochs before the rest of the training continued at that rate-for a total of 50 epochs using the Adam optimizer and a learning rate of 10 ´5. At decoding time, the decoder is initialized with a latent embedding and then decodes in an auto-regressive manner with sampling. For each generation, we sampled 10 segments and kept the one with the lowest perplexity (highest likelihood).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Physics Extraction</head><p>To extract the physics, we must first define the "physics" of a static level. In part, this seems ridiculous, as a static level cannot have a conventional physics model, as there is no notion of time. However, while this seems like an intractable problem, we believe that for several platformer games, there is an implicit correlation between horizontal position and time -e.g., a speedrunner of Mario is almost always moving to the right as quickly as they possibly can. In fact, the A ågent that we use to simulate "playing" the levels also operates under this assumption. Thus, we think it is reasonable to relax the physics models from a notion of y position versus time to a relation of y position to x position -with the understanding that the x position is supposed to be constantly progressing in the direction of the goal. It is important to note that the "physics" model we are extracting actually supports an infinite number of different possible physics models -changing the maximal x speed will result in different physics models. Some games have much slower horizontal speeds (Castlevania has a maximal horizontal speed of "3.7 tiles per second), while others have much faster speeds (Super Mario Bros. has a maximal horizontal speed of 10 tiles We also note that a large number of platformer games allow for the player to control the arc of the jump based on how long they hold the jump button -in this work, Super Mario Bros., Metroid, and Mega Man all allow for this, while Castlevania and Ninja Gaiden do not -and this notion of player control is not contained within the static maps. Again, we make the simplifying assumption that higher jumps are preferred -we want to determine the frontier of what space is reachable. Table <ref type="table" target="#tab_0">1</ref> describes the "physics" in contrast to the standard physics found in the game.</p><p>One final note -many games have different physics models when the player is falling in their jump versus when they are in the rising portion of their jump -e.g., in Super Mario Bros. gravity can more than double when the player is falling. As such, we learn a separate gravity value for the rising and falling portions of a jump.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Extraction</head><p>Having defined the physics model of a static level, we now discuss the process for extracting said physics model. To determine how the path represents the player's position through time, a Breadth-First Search is performed, beginning from the start position and progressing until the end position is found. This provides a coarse notion of the progression of the path. The path is then followed and the algorithm described in Figure <ref type="figure">2</ref> is used to separate the portions of the path that are (1) grounded, (2) jumping, and (3) falling.</p><p>Once segmented, the segments are filtered to remove noisy jumps:</p><p>• Any jump or fall of two or fewer data points is removedthese are too small to derive any useful physics from • Any segment that moves more than 2 tiles in a single step is removed -these represent "broken" paths and are likely to represent a corruption of the physics For each x position in a jump, the highest corresponding y value is recorded -e.g. if a jump consists of  <ref type="figure">2</ref>: Pseudocode describing the segmentation of jumping, falling, and being on the ground from path positions rr0, 0s, r0, 1s, r1, 1s, r1, 2ss then the highest recorded positions per x value are rr0, 1s, r1, 2ss. This is done for all jumps and the statistics for the x positions found across all jumps are calculated. Jumps are then scored by how many of their y positions agree with the P ´percentile y values across all jumps. P is then a hyperparameter that can be tuned to determine what one expects to see from the jumps -given that 3 of the games have variable height jumps, our inductive bias is that jumps higher than the median should be selected given that we wish to find the upper extents of possible jumps. We filter jumps that have more than 50% disagreement with the P ´percentile jump. In the next section, we discuss the criterion for the selection of P . Finally, given the filtered jumps and falls, we perform an Ordinary Least Squares regression where the dependent variable is y position and the independent variables are x (corresponding to Impulse) and x 2 (corresponding to Gravity). x value for the physics models extracted for the original levels and the generated levels when compared to the actual game physics. We also see Castlevania is difficult to extract, in part because its arc does not actually follow a parabola.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Game</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Evaluation/Discussion</head><p>To evaluate the extracted physics, there are a number of concerns.</p><p>1. Faithfulness of the Generated Physics -Do the paths contained in segments generated targeting a specific game domain faithfully recreate the physics found in the original segments? 2. Validity of the Extraction Process -Is the extraction process capable of reconstructing the original jump parameters from the training data (where the paths were generated from an agent using the original parameters)? 3. Interpretability of Blended Physics -Do the segments found in interpolations between the original games result in physics that are interpolated between the games?</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Faithfulness to Original Physics</head><p>To assess whether the original physics can be extracted, we first use the extraction process on the training segmentsthese should have the physics flawlessly encoded within them. We ran a hyperparameter grid search over the Ppercentile to ascertain what percentile leads to the most accurate physics model. We assess the accuracy of the physics model by calculating the Sum of Squared Error (SSE) for y values per x value for the jump models produced by the physics models extracted for the original segments. P " 75% led to the lowest total SSE summed over all of the games, although different games had differing values (From Castlevania at 60% to Super Mario Bros. at 80%). However, the mean value of the percentiles was 72.6%, so we feel comfortable with using the 75th percentile jumps for the physics model (which confirms our inductive bias that we wanted jumps higher than the median). Of course, in some sense, the aesthetics of the reconstructed jump arcs are more important than the error -most importantly, do the extracted jumps result in the same maneuvering and reachability as the true physics? Figure <ref type="figure" target="#fig_0">3</ref> shows the true jump arcs in comparison with the jump arcs extracted from the original segments. We see that the extracted jump for Metroid (orange) reaches the same heights, but does not reach quite as far horizontally, due to a higher falling gravity. We see that the extracted jump for Mario (red) is a bit short in height (reaching only "3.5 tiles high instead of 4 tiles in height) but has the same horizontal space covered. Mega Man (light blue) has a slightly different arc, but reaches the exact same height and has the same horizontal space. Ninja Gaiden's (dark blue) extracted jump falls short of the true jump both in height (reaching a maximum of 3.8 tiles instead of 4) and in distance (9 tiles instead of 10). Finally, Castlevania's extracted jump has the same horizontal reach, but reaches higher (2.8 tiles instead of 2 tiles).</p><p>Generally, these jumps would support much of the same gameplay, although the height differences for Super Mario Bros. and Ninja Gaiden would need to be bumped up to the nearest whole number of tiles to have the same gameplay. With this, we feel satisfied that the physics extraction process works well enough to faithfully extract physics that would support playing the game, and we turn our attention to the generated levels, to see how faithfully they are able to represent the physics.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Latent Reconstructions</head><p>To evaluate the generated physics, we sampled the generative model to produce level segments that were from the latent space of the encoding corresponding to each game.</p><p>To do this, we first obtained the latent encoding for every level segment from a given game. We then calculated the mean and standard deviation for these encodings. Finally, we sampled 2000 encodings from a normal distribution with the calculated parameters -these encodings were then decoded into level segments. As a note, the level segments were sometimes lacking in a beginning and ending (due to the stochastic nature of the generation process) -these segments were excluded from the physics extraction process as it is impossible to determine the progression of the generated path -in all, this led to the dropping of 326 segments in total (3.26% of the generated segments) with Metroid having the highest proportion of corrupted segments (8.1%). The physics models were extracted using the same 75th percentile criterion as computed in the original levels (no hyperparameter search). Table <ref type="table" target="#tab_2">2</ref> shows the RMSEs between the physics models extracted from the original and generated segments when compared with the actual game physics. Both errors are broadly comparable (and is in fact lower for generated segments in the case of Super Mario Bros.).</p><p>As noted above, the aesthetics of the reconstructed jump arcs are as, if not more, important than the errors. Figure <ref type="figure" target="#fig_1">4</ref> shows the true jump arcs in comparison with the jump arcs extracted from the generated segments. We see that the extracted jump for Metroid (orange) reaches the same height, but does not reach quite as far horizontally, due to a higher fall gravity. We also see that the extracted jump for Mario (red) reaches the same height but extends horizontally.</p><p>We note that for the rest of the games, the generated arcs show a regression towards the physics of Super Mario Bros.. The generated Mega Man and Castlevania arcs are nearly identical to the Super Mario Bros. arc. Finally, we see that the generated Ninja Gaiden (dark blue) arc is very similar to the one extracted from the original segments reaching not quite as high but having the same horizontal duration.</p><p>Again, generally, these physics would support the same gameplay -in fact Super Mario Bros. would be playable as is with no intervention with the model extracted from the  generated levels (unlike the model extracted from the original segments). Also, while the models for Castlevania and Mega Man are more lenient for the generated extractions than the true physics, the levels would be playable with the extracted models.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Blended Physics</head><p>Unlike the above categories, there is no direct comparison to see how well the extracted physics recreate the original physics -instead visual inspection is the best way to assess the interpolated physics. Figure <ref type="figure" target="#fig_3">5</ref> shows the physics extracted from interpolations between different games. To get the interpolations, we take 10 segments from each game, encode them into the latent space, interpolate between all pairs of encodings at 25%-75%, 50%-50%, 75%-25%, and then decode 20 times (since the decoding process is stochastic, the same encoding can produce different segments). We note that for most pairs, the interpolated physics seems to settle into a jump that is actually unlike the exemplars, but relatively stable across the blends -a jump that reaches about 3 tiles in height and 8 tiles in width (which is actually quite similar to the jump of Mega Man). This jump is somewhat average across the games (although a jump of 3.5 in height and 9 in width would be closer to average), so it seems that most blends actually go through a sort of in-between average space that just encodes generic platformerness as opposed to any real per-game-pair specific physics. That being said, Metroid -being the most extreme of the physics -does tend to have some blends that incorporate its higher and longer jumps -namely, blends with Castlevania (Figure <ref type="figure" target="#fig_3">5h</ref>), Mega Man (Figure <ref type="figure" target="#fig_3">5j</ref>) and Ninja Gaiden (Figure <ref type="figure" target="#fig_3">5b</ref>).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Conclusion and Future Work</head><p>In this paper, we presented a method for extracting "physics" from static levels of the kind often used in PCGML level generation. We compared the extractions from both ground truth training examples and generations to the ground truth physics. In addition, we explored the physics found within blended domains, with some promising examples of blended physics.</p><p>In the future, we would like to expand this work to explore different level orientations (e.g., vertical levels found in Kid Icarus). We would also like to explore the inverse processgiven a physics model, generate levels that are playable.  </p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 3 :</head><label>3</label><figDesc>Figure 3: The jump arcs for the true physics (solid lines) compared to the extracted training jumps (dotted lines).</figDesc><graphic coords="5,107.58,54.00,396.85,160.04" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 4 :</head><label>4</label><figDesc>Figure 4: The jump arcs for the true physics (solid lines) vs the extracted generated jumps (dash-dotted lines).</figDesc><graphic coords="5,107.58,246.92,396.85,164.18" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head></head><label></label><figDesc>(a) Interpolation between SMB and Ninja Gaiden (b) Interpolation between Ninja Gaiden and Metroid (c) Interpolation between SMB and Metroid (d) Interpolation between Ninja Gaiden and Castlevania (e) Interpolation between SMB and Castlevania (f) Interpolation between Ninja Gaiden and Mega Man (g) Interpolation between SMB and Mega Man (h) Interpolation between Metroid and Castlevania (i) Interpolation between Mega Man and Castlevania (j) Interpolation between Metroid and Mega Man</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 5 :</head><label>5</label><figDesc>Figure5: The jump arcs for the interpolations between games. We note that many of the blended jumps form a sort of "average" jump (found in (a), (b), (c), (d), (e),(f), (g), and (i)) where the jump reaches about 3 tiles in height and 8 tiles in length. However, some blends have more interesting, intuitive blends, such as those between Metroid and both Castlevania and Mega Man.</figDesc><graphic coords="6,55.28,526.30,249.47,101.14" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1 :</head><label>1</label><figDesc>A comparison between the standard physics models as found in platformer games and the extracted physics models produced here.per second) -the rest of the games we looked at have speeds of around 5.5 tiles per second. If one wished to take these extracted physics and use them in a playable game, the different x speeds would result in different feeling games, but somewhere in the 4 to 10 tiles per second range would result in games playable by humans.</figDesc><table><row><cell cols="2">Standard Physics Model Extracted Physics Model</cell></row><row><cell></cell><cell>Parameters</cell></row><row><cell>Impulse ( By Bt ) Gravity ( By Bt 2 )</cell><cell>Impulse ( By Bx ) Gravity ( By Bx 2 ) Assumptions</cell></row><row><cell>Player has control</cell><cell>Player takes the</cell></row><row><cell>over height of jump</cell><cell>highest possible jump</cell></row><row><cell cols="2">Player can alter horizontal Player is always moving at</cell></row><row><cell>position during jump</cell><cell>maximum horizontal speed</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_2"><head>Table 2 :</head><label>2</label><figDesc>Root Mean Squared Error (RMSE) for y values per</figDesc><table><row><cell></cell><cell cols="2">Original Generated</cell></row><row><cell>Castlevania</cell><cell>1.03</cell><cell>4.98</cell></row><row><cell cols="2">Super Mario Bros 0.71</cell><cell>0.25</cell></row><row><cell>Metroid</cell><cell>0.93</cell><cell>0.94</cell></row><row><cell>Mega Man</cell><cell>0.22</cell><cell>2.94</cell></row><row><cell>Ninja Gaiden</cell><cell>0.80</cell><cell>1.03</cell></row><row><cell>Total</cell><cell>3.69</cell><cell>10.14</cell></row></table></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">The videogame affordances corpus</title>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">R</forename><surname>Bentley</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">C</forename><surname>Osborn</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Experimental AI in Games Workshop</title>
				<imprint>
			<publisher>EXAG</publisher>
			<date type="published" when="2019">2019. 2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Linear levels through n-grams</title>
		<author>
			<persName><forename type="first">S</forename><surname>Dahlskog</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Togelius</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">J</forename><surname>Nelson</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 18th International Academic MindTrek</title>
				<meeting>the 18th International Academic MindTrek</meeting>
		<imprint>
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Towards generating novel games using conceptual blending</title>
		<author>
			<persName><forename type="first">J</forename><surname>Gow</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Corneli</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Eleventh Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE)</title>
				<imprint>
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Game level generation from gameplay videos</title>
		<author>
			<persName><forename type="first">M</forename><surname>Guzdial</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Riedl</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Twelfth Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE)</title>
				<imprint>
			<date type="published" when="2016">2016a</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Learning to blend computer game levels</title>
		<author>
			<persName><forename type="first">M</forename><surname>Guzdial</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Riedl</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Seventh International Conference on Computational Creativity (ICCC)</title>
				<imprint>
			<date type="published" when="2016">2016b</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Automated game design via conceptual expansion</title>
		<author>
			<persName><forename type="first">M</forename><surname>Guzdial</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Riedl</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Fourteenth Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE)</title>
				<imprint>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Game engine learning from video</title>
		<author>
			<persName><forename type="first">M</forename><surname>Guzdial</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">O</forename><surname>Riedl</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">26th International Joint Conference on Artificial Intelligence (IJCAI)</title>
				<imprint>
			<date type="published" when="2017">2017</date>
			<biblScope unit="page" from="3707" to="3713" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Autoencoders for level generation, repair and recognition</title>
		<author>
			<persName><forename type="first">R</forename><surname>Jain</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Isaksen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Holmgard</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Togelius</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Lerer</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Conference on Neural Information Processing Systems (NeurIPS) Autodiff Workshop</title>
				<imprint>
			<date type="published" when="2016">2016. 2017</date>
		</imprint>
	</monogr>
	<note>ICCC Workshop on Computational Creativity and Games</note>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Blending levels from different games using LSTMs</title>
		<author>
			<persName><forename type="first">A</forename><surname>Sarkar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Cooper</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Experimental AI in Games Workshop</title>
				<imprint>
			<publisher>EXAG</publisher>
			<date type="published" when="2018">2018. 2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Exploring level blending across platformers via paths and affordances</title>
		<author>
			<persName><forename type="first">A</forename><surname>Sarkar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Summerville</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Snodgrass</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Bentley</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Osborn</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Sixteenth Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE)</title>
				<imprint>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Controllable level blending between games using variational autoencoders</title>
		<author>
			<persName><forename type="first">A</forename><surname>Sarkar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Yang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Cooper</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Experimental AI in Games Workshop</title>
				<imprint>
			<publisher>EXAG</publisher>
			<date type="published" when="2019">2019. 2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">An approach to domain transfer in procedural content generation of twodimensional videogame levels</title>
		<author>
			<persName><forename type="first">S</forename><surname>Snodgrass</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Ontanon</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Twelfth Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE)</title>
				<imprint>
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Learning to generate video game maps using Markov models</title>
		<author>
			<persName><forename type="first">S</forename><surname>Snodgrass</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Ontañón</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Computational Intelligence and AI in Games</title>
		<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Multi-domain level generation and blending with sketches via example-driven BSP and variational autoencoders</title>
		<author>
			<persName><forename type="first">S</forename><surname>Snodgrass</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Sarkar</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Fifteenth Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE)</title>
				<meeting><address><addrLine>Snodgrass, S</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2019">2020. 2019</date>
		</imprint>
	</monogr>
	<note>Fifteenth International Conference on the Foundations of Digital Games (FDG)</note>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Sampling Hyrule: Sampling probabilistic machine learning for level generation</title>
		<author>
			<persName><forename type="first">A</forename><surname>Summerville</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Mateas</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Tenth International Conference on the Foundations of Digital Games (FDG)</title>
				<imprint>
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Mechanics automatically recognized via interactive observation: Jumping</title>
		<author>
			<persName><forename type="first">A</forename><surname>Summerville</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Mateas</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Seventh Workshop on Procedural Content Generation at First Joint International Conference of DiGRA and FDG</title>
				<imprint>
			<date type="published" when="2016">2016. 2016. 2017</date>
			<biblScope unit="page" from="1" to="10" />
		</imprint>
	</monogr>
	<note>Twelfth International Conference on the Foundations of Digital Games (FDG)</note>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Procedural content generation via machine learning (PCGML)</title>
		<author>
			<persName><forename type="first">A</forename><surname>Summerville</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Snodgrass</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Guzdial</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Holmgård</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">K</forename><surname>Hoover</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Isaksen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Nealen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Togelius</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Games (ToG</title>
		<imprint>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Charda: Causal hybrid automata recovery via dynamic analysis</title>
		<author>
			<persName><forename type="first">A</forename><surname>Summerville</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Osborn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Mateas</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">26th International Joint Conference on Artificial Intelligence (IJCAI)</title>
				<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Evolving Mario levels in the latent space of a deep convolutional generative adversarial network</title>
		<author>
			<persName><forename type="first">V</forename><surname>Volz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Schrum</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">M</forename><surname>Lucas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Smith</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Risi</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Genetic and Evolutionary Computation Conference (GECCO)</title>
				<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2018">2018</date>
			<biblScope unit="page" from="221" to="228" />
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
