The Riddle of Togelby

06/10/2019
by   Daniel Ashlock, et al.
0

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.

READ FULL TEXT

page 2

page 4

page 5

page 6

page 7

research
02/22/2020

Conceptual Game Expansion

Automated game design is the problem of automatically producing games th...
research
02/11/2022

Visualising Multiplayer Game Spaces

We compare four different `game-spaces' in terms of their usefulness in ...
research
08/15/2013

Search-Space Characterization for Real-time Heuristic Search

Recent real-time heuristic search algorithms have demonstrated outstandi...
research
11/22/2017

Asymmetric Action Abstractions for Multi-Unit Control in Adversarial Real-Time Games

Action abstractions restrict the number of legal actions available durin...
research
12/27/2011

Search space analysis with Wang-Landau sampling and slow adaptive walks

Two complementary techniques for analyzing search spaces are proposed: (...

Please sign up or login with your details

Forgot password? Click here to reset