Evolutionary algorithms for board game players with domain knowledge

Kyung Joong Kim, Sung-Bae Cho

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

Abstract

Incorporating a priori knowledge, such as expert knowledge, metaheuristics, human preferences, and most importantly domain knowledge discovered during evolutionary search, into evolutionary algorithms has gained increasing interest in recent years. In this chapter, we present a method for systematically inserting expert knowledge into evolutionary board game framework at the opening, middle, and endgame stages. In the opening stage, openings defined by the experts are used. In this work, we use speciation techniques to search for diverse strategies that embody different styles of game play and combine them using voting for higher performance. This idea comes from the common knowledge that the combination of diverse well-playing strategies can defeat the best one because they can complement each other for higher performance. Finally, we use an endgame database. Experimental results on checkers and Othello games show that the proposed method is promising to evolve better strategies.

Original languageEnglish
Title of host publicationAdvanced Intelligent Paradigms in Computer Games
EditorsNorio Baba, Lakhmi Jain, Hisashi Handa
Pages71-89
Number of pages19
DOIs
Publication statusPublished - 2007 Jul 9

Publication series

NameStudies in Computational Intelligence
Volume71
ISSN (Print)1860-949X

Fingerprint

Evolutionary algorithms

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Cite this

Kim, K. J., & Cho, S-B. (2007). Evolutionary algorithms for board game players with domain knowledge. In N. Baba, L. Jain, & H. Handa (Eds.), Advanced Intelligent Paradigms in Computer Games (pp. 71-89). (Studies in Computational Intelligence; Vol. 71). https://doi.org/10.1007/978-3-540-72705-7_4
Kim, Kyung Joong ; Cho, Sung-Bae. / Evolutionary algorithms for board game players with domain knowledge. Advanced Intelligent Paradigms in Computer Games. editor / Norio Baba ; Lakhmi Jain ; Hisashi Handa. 2007. pp. 71-89 (Studies in Computational Intelligence).
@inbook{d13889e3a608440b89390a0004c2749b,
title = "Evolutionary algorithms for board game players with domain knowledge",
abstract = "Incorporating a priori knowledge, such as expert knowledge, metaheuristics, human preferences, and most importantly domain knowledge discovered during evolutionary search, into evolutionary algorithms has gained increasing interest in recent years. In this chapter, we present a method for systematically inserting expert knowledge into evolutionary board game framework at the opening, middle, and endgame stages. In the opening stage, openings defined by the experts are used. In this work, we use speciation techniques to search for diverse strategies that embody different styles of game play and combine them using voting for higher performance. This idea comes from the common knowledge that the combination of diverse well-playing strategies can defeat the best one because they can complement each other for higher performance. Finally, we use an endgame database. Experimental results on checkers and Othello games show that the proposed method is promising to evolve better strategies.",
author = "Kim, {Kyung Joong} and Sung-Bae Cho",
year = "2007",
month = "7",
day = "9",
doi = "10.1007/978-3-540-72705-7_4",
language = "English",
isbn = "3540727043",
series = "Studies in Computational Intelligence",
pages = "71--89",
editor = "Norio Baba and Lakhmi Jain and Hisashi Handa",
booktitle = "Advanced Intelligent Paradigms in Computer Games",

}

Kim, KJ & Cho, S-B 2007, Evolutionary algorithms for board game players with domain knowledge. in N Baba, L Jain & H Handa (eds), Advanced Intelligent Paradigms in Computer Games. Studies in Computational Intelligence, vol. 71, pp. 71-89. https://doi.org/10.1007/978-3-540-72705-7_4

Evolutionary algorithms for board game players with domain knowledge. / Kim, Kyung Joong; Cho, Sung-Bae.

Advanced Intelligent Paradigms in Computer Games. ed. / Norio Baba; Lakhmi Jain; Hisashi Handa. 2007. p. 71-89 (Studies in Computational Intelligence; Vol. 71).

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Evolutionary algorithms for board game players with domain knowledge

AU - Kim, Kyung Joong

AU - Cho, Sung-Bae

PY - 2007/7/9

Y1 - 2007/7/9

N2 - Incorporating a priori knowledge, such as expert knowledge, metaheuristics, human preferences, and most importantly domain knowledge discovered during evolutionary search, into evolutionary algorithms has gained increasing interest in recent years. In this chapter, we present a method for systematically inserting expert knowledge into evolutionary board game framework at the opening, middle, and endgame stages. In the opening stage, openings defined by the experts are used. In this work, we use speciation techniques to search for diverse strategies that embody different styles of game play and combine them using voting for higher performance. This idea comes from the common knowledge that the combination of diverse well-playing strategies can defeat the best one because they can complement each other for higher performance. Finally, we use an endgame database. Experimental results on checkers and Othello games show that the proposed method is promising to evolve better strategies.

AB - Incorporating a priori knowledge, such as expert knowledge, metaheuristics, human preferences, and most importantly domain knowledge discovered during evolutionary search, into evolutionary algorithms has gained increasing interest in recent years. In this chapter, we present a method for systematically inserting expert knowledge into evolutionary board game framework at the opening, middle, and endgame stages. In the opening stage, openings defined by the experts are used. In this work, we use speciation techniques to search for diverse strategies that embody different styles of game play and combine them using voting for higher performance. This idea comes from the common knowledge that the combination of diverse well-playing strategies can defeat the best one because they can complement each other for higher performance. Finally, we use an endgame database. Experimental results on checkers and Othello games show that the proposed method is promising to evolve better strategies.

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

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

U2 - 10.1007/978-3-540-72705-7_4

DO - 10.1007/978-3-540-72705-7_4

M3 - Chapter

AN - SCOPUS:34347381690

SN - 3540727043

SN - 9783540727040

T3 - Studies in Computational Intelligence

SP - 71

EP - 89

BT - Advanced Intelligent Paradigms in Computer Games

A2 - Baba, Norio

A2 - Jain, Lakhmi

A2 - Handa, Hisashi

ER -

Kim KJ, Cho S-B. Evolutionary algorithms for board game players with domain knowledge. In Baba N, Jain L, Handa H, editors, Advanced Intelligent Paradigms in Computer Games. 2007. p. 71-89. (Studies in Computational Intelligence). https://doi.org/10.1007/978-3-540-72705-7_4