Please use this identifier to cite or link to this item:
Title: Evolving computer chinese chess using guided learning
Authors: Quek, H.Y.
Chan, H.H.
Tan, K.C. 
Tay, A. 
Issue Date: 2009
Citation: Quek, H.Y.,Chan, H.H.,Tan, K.C.,Tay, A. (2009). Evolving computer chinese chess using guided learning. Studies in Computational Intelligence 210 : 325-354. ScholarBank@NUS Repository.
Abstract: This chapter explores the feasibility of using genetic algorithms to improve the evaluation of Chinese chess programs. A game engine that uses the negascout search algorithm in combination with internal iterative deepening search is developed. As a means to enhance the search process, techniques such as nullmove- pruning, futility pruning, razoring and selective search extensions are used. Unnecessary expensive re-searches for the negascout are avoided through move ordering techniques, which are governed by the Most Valuable Victim (MVV) / Least Valuable Attacker (LVA), killer and history heuristics. To evaluate the game positions at any point of time, a static evaluation function (using hand-tuned weights) is utilized in conjunction with quiescent search, whose weights are tuned by a genetic algorithm using a population of chromosomes. Moves taken from grandmasters' games are used as training data to evaluate the fitness of chromosomes during evolution. This is determined based on the number of 'correct' moves made by the program. The evolved programs are benchmarked against the un-evolved version and random online human players. Results show that evolution with guided learning does improve the playing strength of the Chinese chess program significantly. © 2009 Springer-Verlag Berlin Heidelberg.
Source Title: Studies in Computational Intelligence
ISBN: 9783642012617
ISSN: 1860949X
DOI: 10.1007/978-3-642-01262-4_12
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Aug 3, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.