DocumentCode
1652670
Title
Evolving speciated checkers players with crowding algorithm
Author
Kim, Kyung-Joong ; Cho, Sung-Bae
Author_Institution
Dept. of Comput. Sci., Yonsei Univ., Seoul, South Korea
Volume
1
fYear
2002
Firstpage
407
Lastpage
412
Abstract
Conventional evolutionary algorithms have a property that only one solution often dominates and it is sometimes useful to find diverse solutions and combine them because there might be many different solutions to one problem in real-world problems. Recently, developing checkers players using evolutionary algorithms has been widely exploited to show the power of evolution for machine learning. In this paper, we propose an evolutionary checkers player that is developed by a speciation technique called the "crowding algorithm". In many experiments, our checkers player with an ensemble structure showed better performance than non-speciated checkers players. A neural network is used to validate the game board, and a min-max search finds the optimal board. The neural network evaluator is evolved using the evolutionary algorithm
Keywords
competitive algorithms; computer games; evolutionary computation; games of skill; neural nets; problem solving; search problems; unsupervised learning; crowding algorithm; diverse solution combination; dominating solution; draughts; ensemble structure; evolutionary algorithms; game board validation; game player evolution; machine learning; min-max search; neural network; optimal board; speciated checkers players; Computer science; Databases; Diversity reception; Evolutionary computation; Genetic mutations; Humans; Machine learning; Machine learning algorithms; Neural networks; Voting;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on
Conference_Location
Honolulu, HI
Print_ISBN
0-7803-7282-4
Type
conf
DOI
10.1109/CEC.2002.1006269
Filename
1006269
Link To Document