Evolving both search and strategy for Reversi players using genetic programming

Amit Benbassat; Moshe Sipper

doi:10.1109/CIG.2012.6374137

Evolving both search and strategy for Reversi players using genetic programming

Amit Benbassat
, Moshe Sipper

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

Abstract

We present the application of genetic programming to the zero-sum, deterministic, full-knowledge board game of Reversi. Expanding on our previous work on evolving boardstate evaluation functions, we now evolve the search algorithm as well, by allowing evolved programs control of game-tree pruning. We use strongly typed genetic programming, explicitly defined introns, and a selective directional crossover method. We show that our system regularly churns out highly competent players and our results prove easy to scale.

Original language	English
Title of host publication	2012 IEEE Conference on Computational Intelligence and Games, CIG 2012
Pages	47-54
Number of pages	8
DOIs	https://doi.org/10.1109/CIG.2012.6374137
State	Published - 1 Dec 2012
Event	2012 IEEE International Conference on Computational Intelligence and Games, CIG 2012 - Granada, Spain Duration: 11 Sep 2012 → 14 Sep 2012

Publication series

Name	2012 IEEE Conference on Computational Intelligence and Games, CIG 2012

Conference

Conference	2012 IEEE International Conference on Computational Intelligence and Games, CIG 2012
Country/Territory	Spain
City	Granada
Period	11/09/12 → 14/09/12

ASJC Scopus subject areas

Artificial Intelligence
Computer Graphics and Computer-Aided Design
Human-Computer Interaction
Software

Access to Document

10.1109/CIG.2012.6374137

Cite this

@inproceedings{1f89f979070146fcab3975c2e9afb095,

title = "Evolving both search and strategy for Reversi players using genetic programming",

abstract = "We present the application of genetic programming to the zero-sum, deterministic, full-knowledge board game of Reversi. Expanding on our previous work on evolving boardstate evaluation functions, we now evolve the search algorithm as well, by allowing evolved programs control of game-tree pruning. We use strongly typed genetic programming, explicitly defined introns, and a selective directional crossover method. We show that our system regularly churns out highly competent players and our results prove easy to scale.",

author = "Amit Benbassat and Moshe Sipper",

year = "2012",

month = dec,

day = "1",

doi = "10.1109/CIG.2012.6374137",

language = "English",

isbn = "9781467311922",

series = "2012 IEEE Conference on Computational Intelligence and Games, CIG 2012",

pages = "47--54",

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

note = "2012 IEEE International Conference on Computational Intelligence and Games, CIG 2012 ; Conference date: 11-09-2012 Through 14-09-2012",

}

Benbassat, A & Sipper, M 2012, Evolving both search and strategy for Reversi players using genetic programming. in 2012 IEEE Conference on Computational Intelligence and Games, CIG 2012., 6374137, 2012 IEEE Conference on Computational Intelligence and Games, CIG 2012, pp. 47-54, 2012 IEEE International Conference on Computational Intelligence and Games, CIG 2012, Granada, Spain, 11/09/12. https://doi.org/10.1109/CIG.2012.6374137

Evolving both search and strategy for Reversi players using genetic programming. / Benbassat, Amit; Sipper, Moshe.
2012 IEEE Conference on Computational Intelligence and Games, CIG 2012. 2012. p. 47-54 6374137 (2012 IEEE Conference on Computational Intelligence and Games, CIG 2012).

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

TY - GEN

T1 - Evolving both search and strategy for Reversi players using genetic programming

AU - Benbassat, Amit

AU - Sipper, Moshe

PY - 2012/12/1

Y1 - 2012/12/1

N2 - We present the application of genetic programming to the zero-sum, deterministic, full-knowledge board game of Reversi. Expanding on our previous work on evolving boardstate evaluation functions, we now evolve the search algorithm as well, by allowing evolved programs control of game-tree pruning. We use strongly typed genetic programming, explicitly defined introns, and a selective directional crossover method. We show that our system regularly churns out highly competent players and our results prove easy to scale.

AB - We present the application of genetic programming to the zero-sum, deterministic, full-knowledge board game of Reversi. Expanding on our previous work on evolving boardstate evaluation functions, we now evolve the search algorithm as well, by allowing evolved programs control of game-tree pruning. We use strongly typed genetic programming, explicitly defined introns, and a selective directional crossover method. We show that our system regularly churns out highly competent players and our results prove easy to scale.

UR - https://www.scopus.com/pages/publications/84871956842

U2 - 10.1109/CIG.2012.6374137

DO - 10.1109/CIG.2012.6374137

M3 - Conference contribution

SN - 9781467311922

T3 - 2012 IEEE Conference on Computational Intelligence and Games, CIG 2012

SP - 47

EP - 54

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

T2 - 2012 IEEE International Conference on Computational Intelligence and Games, CIG 2012

Y2 - 11 September 2012 through 14 September 2012

ER -

Evolving both search and strategy for Reversi players using genetic programming

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this