Research Repository

Measuring interestingness of continuous game problems

Roberts, Samuel A and Lucas, Simon M (2013) Measuring interestingness of continuous game problems. In: 2013 IEEE Conference on Computational Intelligence and Games (CIG), 2013-08-11 - 2013-08-13.

Full text not available from this repository.


This paper investigates the relationship between the difficulty and the interestingness of individual problem candidates from within a class of related problems, using Lunar Lander as a case study. In this class of problems, a 2D spaceship must be controlled by a simple set of macro-actions, including both linear and angular impulses, such that it fulfils a set of weighted criteria relating to landing on a jagged landscape with flat landing pads. It is demonstrated that a very simple measure based on standard deviations of improvement can be used to guide evolution to develop interesting problems in this class of problems, which in turn can be solved using evolution strategies to get a high level of improvement based on initial random performance. We examine the impact of the measure used on the evolution of the problems, and also what aspects of this problem class affect the difficulty and interestingness the most. © 2013 IEEE.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Published proceedings: IEEE Conference on Computatonal Intelligence and Games, CIG
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science and Health
Faculty of Science and Health > Computer Science and Electronic Engineering, School of
SWORD Depositor: Elements
Depositing User: Elements
Date Deposited: 15 Jul 2015 13:26
Last Modified: 15 Jan 2022 00:50

Actions (login required)

View Item View Item