Please use this identifier to cite or link to this item:
|Title:||Discovering Chinese chess strategies through coevolutionary approaches|
|Citation:||Ong, C.S., Quek, H.Y., Tan, K.C., Tay, A. (2007). Discovering Chinese chess strategies through coevolutionary approaches. Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Games, CIG 2007 : 360-367. ScholarBank@NUS Repository. https://doi.org/10.1109/CIG.2007.368121|
|Abstract:||Coevolutionary techniques have been proven to be effective in evolving solutions to many game related problems, with successful applications in many complex chess-like games like Othello, Checkers and Western Chess. This paper explores the application of coevolutionary models to learn Chinese Chess strategies. The proposed Chinese Chess engine uses alpha-beta search algorithm, quiescence search and move ordering. Three different models are studied: single-population competitive, hostparasite competitive and cooperative coevolutionary models. A modified alpha-beta algorithm is also developed for performance evaluation and an archiving mechanism is implemented to handle intransitive behaviour. Interesting traits are revealed when the coevolution models are simulated under different settings - with and without opening book. Results show that the coevolved players can perform relatively well, with the cooperative model being best for finding good players under random strategy initialization and the host-parasite model being best for the case when strategies are initialized with a good set of starting seeds. © 2007 IEEE.|
|Source Title:||Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Games, CIG 2007|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 14, 2018
WEB OF SCIENCETM
checked on Jun 19, 2018
checked on Jun 1, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.