The do what's possible representation

Ashlock, Daniel; Gillis, Sierra; McEachern, Andrew; Tsang, Jeffrey

doi:10.1109/cec.2016.7743978

Cited by 13 publications

(6 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The original publication on the DWP representation [5] used the representation on a variety of problems. It was capable of solving self avoiding walk problems [1] of unprecedented size.…”

Section: A Past Work With the Dwp Representationmentioning

confidence: 99%

“…In the original DWP research [5], SDAs were not the only evolvable structures used as CSGs. Another technology, called an alternator list was also used.…”

Section: Sda Are Not the Only Choice For Csgsmentioning

confidence: 99%

“…representation [5] to encode level maps. The open ended nature of the representation encodes a sequence of maps, with the next map in the sequence possessing one additional room.…”

Section: Introduction This Study Uses a Recently Developed Open-ementioning

confidence: 99%

See 2 more Smart Citations

Automatic Generation of Level Maps with the Do What’s Possible Representation

Ashlock

Salge

2019

2019 IEEE Conference on Games (CoG)

Self Cite

View full text Add to dashboard Cite

Automatic generation of level maps is a popular form of automatic content generation. In this study, a recently developed technique employing the do what's possible representation is used to create open-ended level maps. Generation of the map can continue indefinitely, yielding a highly scalable representation. A parameter study is performed to find good parameters for the evolutionary algorithm used to locate high quality map generators. Variations on the technique are presented, demonstrating its versatility, and an algorithmic variant is given that both improves performance and changes the character of maps located. The ability of the map to adapt to different regions where the map is permitted to occupy space are also tested.

show abstract

“…The original publication on the DWP representation [5] used the representation on a variety of problems. It was capable of solving self avoiding walk problems [1] of unprecedented size.…”

Section: A Past Work With the Dwp Representationmentioning

confidence: 99%

“…In the original DWP research [5], SDAs were not the only evolvable structures used as CSGs. Another technology, called an alternator list was also used.…”

Section: Sda Are Not the Only Choice For Csgsmentioning

confidence: 99%

See 1 more Smart Citation

Automatic Generation of Level Maps with the Do What’s Possible Representation

Ashlock

Salge

2019

2019 IEEE Conference on Games (CoG)

Self Cite

View full text Add to dashboard Cite

show abstract

“…A general technique for generating highly enriched search spaces is the do what's possible representation [4]. In a paper accepted to the CoG 2019 it was found that this representation can lay out rooms using a tiny data structure.…”

Section: B the Do What's Possible Representationmentioning

confidence: 99%

“…In a paper accepted to the CoG 2019 it was found that this representation can lay out rooms using a tiny data structure. The original publication on the DWP representation [4] used the representation on a variety of problems. It was capable of solving self avoiding walk problems [1] of unprecedented size.…”

Section: B the Do What's Possible Representationmentioning

confidence: 99%

The Riddle of Togelby

Ashlock

Salge

2019

2019 IEEE Conference on Games (CoG)

Self Cite

View full text Add to dashboard Cite

At the 2017 Artificial and Computational Intelligence in Games meeting at Dagstuhl, Julian Togelius asked how to make spaces where every way of filling in the details yielded a good game. This study examines the possibility of enriching search spaces so that they contain very high rates of interesting objects, specifically game elements. While we do not answer the full challenge of finding good games throughout the space, this study highlights a number of potential avenues. These include naturally rich spaces, a simple technique for modifying a representation to search only rich parts of a larger search space, and representations that are highly expressive and so exhibit highly restricted and consequently enriched search spaces.

show abstract