Generating heuristics for novice players

Fernando De Mesentier Silva; Aaron Isaksen; Julian Togelius; Andy Nealen

doi:10.1109/CIG.2016.7860407

Generating heuristics for novice players

Fernando De Mesentier Silva, Aaron Isaksen, Julian Togelius, Andy Nealen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We consider the problem of generating compact sub-optimal game-playing heuristics that can be understood and easily executed by novices. In particular, we seek to find heuristics that can lead to good play while at the same time be expressed as fast and frugal trees or short decision lists. This has applications in automatically generating tutorials and instructions for playing games, but also in analyzing game design and measuring game depth. We use the classic game Blackjack as a testbed, and compare condition induction with the RIPPER algorithm, exhaustive-greedy search in statement space, genetic programming and axis-aligned search. We find that all of these methods can find compact well-playing heuristics under the given constraints, with axis-aligned search performing particularly well.

Original language	English (US)
Title of host publication	2016 IEEE Conference on Computational Intelligence and Games, CIG 2016
Publisher	IEEE Computer Society
ISBN (Electronic)	9781509018833
DOIs	https://doi.org/10.1109/CIG.2016.7860407
State	Published - Jul 2 2016
Event	2016 IEEE Conference on Computational Intelligence and Games, CIG 2016 - Santorini, Greece Duration: Sep 20 2016 → Sep 23 2016

Publication series

Name	IEEE Conference on Computatonal Intelligence and Games, CIG
Volume	0
ISSN (Print)	2325-4270
ISSN (Electronic)	2325-4289

Other

Other	2016 IEEE Conference on Computational Intelligence and Games, CIG 2016
Country/Territory	Greece
City	Santorini
Period	9/20/16 → 9/23/16

ASJC Scopus subject areas

Artificial Intelligence
Computer Graphics and Computer-Aided Design
Computer Vision and Pattern Recognition
Human-Computer Interaction
Software

Access to Document

10.1109/CIG.2016.7860407

Cite this

Generating heuristics for novice players. / De Mesentier Silva, Fernando; Isaksen, Aaron; Togelius, Julian et al.
2016 IEEE Conference on Computational Intelligence and Games, CIG 2016. IEEE Computer Society, 2016. 7860407 (IEEE Conference on Computatonal Intelligence and Games, CIG; Vol. 0).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

De Mesentier Silva, F, Isaksen, A, Togelius, J & Nealen, A 2016, Generating heuristics for novice players. in 2016 IEEE Conference on Computational Intelligence and Games, CIG 2016., 7860407, IEEE Conference on Computatonal Intelligence and Games, CIG, vol. 0, IEEE Computer Society, 2016 IEEE Conference on Computational Intelligence and Games, CIG 2016, Santorini, Greece, 9/20/16. https://doi.org/10.1109/CIG.2016.7860407

@inproceedings{2bdfa2ff60ba49db83295af22e4533e6,

title = "Generating heuristics for novice players",

abstract = "We consider the problem of generating compact sub-optimal game-playing heuristics that can be understood and easily executed by novices. In particular, we seek to find heuristics that can lead to good play while at the same time be expressed as fast and frugal trees or short decision lists. This has applications in automatically generating tutorials and instructions for playing games, but also in analyzing game design and measuring game depth. We use the classic game Blackjack as a testbed, and compare condition induction with the RIPPER algorithm, exhaustive-greedy search in statement space, genetic programming and axis-aligned search. We find that all of these methods can find compact well-playing heuristics under the given constraints, with axis-aligned search performing particularly well.",

author = "{De Mesentier Silva}, Fernando and Aaron Isaksen and Julian Togelius and Andy Nealen",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 IEEE Conference on Computational Intelligence and Games, CIG 2016 ; Conference date: 20-09-2016 Through 23-09-2016",

year = "2016",

month = jul,

day = "2",

doi = "10.1109/CIG.2016.7860407",

language = "English (US)",

series = "IEEE Conference on Computatonal Intelligence and Games, CIG",

publisher = "IEEE Computer Society",

booktitle = "2016 IEEE Conference on Computational Intelligence and Games, CIG 2016",

}

TY - GEN

T1 - Generating heuristics for novice players

AU - De Mesentier Silva, Fernando

AU - Isaksen, Aaron

AU - Togelius, Julian

AU - Nealen, Andy

PY - 2016/7/2

Y1 - 2016/7/2

N2 - We consider the problem of generating compact sub-optimal game-playing heuristics that can be understood and easily executed by novices. In particular, we seek to find heuristics that can lead to good play while at the same time be expressed as fast and frugal trees or short decision lists. This has applications in automatically generating tutorials and instructions for playing games, but also in analyzing game design and measuring game depth. We use the classic game Blackjack as a testbed, and compare condition induction with the RIPPER algorithm, exhaustive-greedy search in statement space, genetic programming and axis-aligned search. We find that all of these methods can find compact well-playing heuristics under the given constraints, with axis-aligned search performing particularly well.

AB - We consider the problem of generating compact sub-optimal game-playing heuristics that can be understood and easily executed by novices. In particular, we seek to find heuristics that can lead to good play while at the same time be expressed as fast and frugal trees or short decision lists. This has applications in automatically generating tutorials and instructions for playing games, but also in analyzing game design and measuring game depth. We use the classic game Blackjack as a testbed, and compare condition induction with the RIPPER algorithm, exhaustive-greedy search in statement space, genetic programming and axis-aligned search. We find that all of these methods can find compact well-playing heuristics under the given constraints, with axis-aligned search performing particularly well.

UR - http://www.scopus.com/inward/record.url?scp=85015380157&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015380157&partnerID=8YFLogxK

U2 - 10.1109/CIG.2016.7860407

DO - 10.1109/CIG.2016.7860407

M3 - Conference contribution

AN - SCOPUS:85015380157

T3 - IEEE Conference on Computatonal Intelligence and Games, CIG

BT - 2016 IEEE Conference on Computational Intelligence and Games, CIG 2016

PB - IEEE Computer Society

T2 - 2016 IEEE Conference on Computational Intelligence and Games, CIG 2016

Y2 - 20 September 2016 through 23 September 2016

ER -

Generating heuristics for novice players

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this