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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bierman, A.: Theoretical issues related to computer game playing programs. Personal Computing, 86–88 (1978)
Schaffer, J.: One Jump Ahead. Springer, New York (1997)
Newborn, M.: Kasparov versus Deep Blue. Springer, New York (1997)
Yan, A. (ed.): Chinese-chess computer crushes grandmasters. China Daily, http://en.chinabroadcast.cn/2946/2006/08/10/167124918.htm (accessed October 1, 2006)
Chen, X.: First human vs computer Chinese chess challenge: Neuchess wins by a narrow margin of 11-9. 首届中国象棋人机大战见分晓浪潮天梭11比9 险胜 (2006), http://www.ciw.com.cn/News/hotnews/2006-08-16/7478.shtml (accessed October 1, 2006)
Thompson, K.: Computer chess strength. In: Clarke, M. (ed.) Advances in computer chess 3. Pergamon Press, Oxford (1982)
Hamilton, S., Garber, L.: Deep Blue’s hardware-software synergy. IEEE Computer 30, 29–35 (1997)
Duran, F.: Advance and be mechanized (2003), http://www.fduran.com/wordpress/?p=10 (accessed October 10, 2006)
Shannon, C.: Programming a computer for playing chess. Philosophical Magazine, 256–275 (1950)
Hsu, F., Anantharaman, T., Campbell, M., Nowatzyk, A.: A grandmaster chess machine. Scientific American 263, 44–50 (1990)
Fogel, D.: Blondie24: Playing at the edge of AI. Morgan Kaufmann, San Francisco (2002)
Fogel, D.: Evolutionary computation: Toward a new philosophy of machine intelligence. IEEE Press, New York (2005)
Hsu, S.: Introduction to computer chess and computer Chinese chess. Journal of Computer 2, 1–8 (1990)
Moreland, B.: Alpha-beta search (2002), http://www.seanet.com/~brucemo/topics/alphabeta.htm (accessed October 3, 2006)
Reinefeld, A.: Spielbaum-Suchverfahren. Informatik-Fachbericht 200. Springer, Berlin (1989)
Tu, Z., Zong, L.: (2003) (accessed October 5, 2006)
Donniger, C.: Null Move Forward Pruning (1993)
Heinz, E.: Scalable search in computer chess: Algorithmic enhancements and experiments at high search depths. Viewag-Verlag, Wiesbaden (2000)
Anon, Source code for open-source Chinese chess program: Elephant Eye (2006), http://www.elephantbase.net/download/xqwizard_source.7z (accessed October 2, 2006)
Yan, W., Zhang, Q.: The formats and principles of chess openings. 布局定式与战理. Beijing University of Physical Education (2004)
Tu, J.: Examples of Chinese chess endgame. 象棋残局例典. Shanghai (1990)
Holland, J.: Outline for a logical theory of adaptive systems. Journal of the Association for Computing Machinery 3, 197–217 (1962)
Baker, J.: Reducing bias and inefficiency in the selection algorithm. In: Proceedings of the second international conference on genetic algorithms and their applications. Lawrence Erlbaum Associates, New Jersey (1987)
Bäck, T., Schütz, M.: Intelligent mutation rate control in canonical genetic algorithms. In: Ras, Z., Michalewicz, M. (eds.). Lecture notes in artificial intelligence. Springer, Berlin (1996)
Goldberg, D.: Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Massachusetts (1989)
Ong, C., Quek, H., Tan, K., Tay, A.: Discovering Chinese chess strategies through coevolutionary approaches. In: Proceedings of the IEEE symposium series on computational intelligence: Computational intelligence and games. IEEE Press, Piscataway (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Quek, H.Y., Chan, H.H., Tan, K.C., Tay, A. (2009). Evolving Computer Chinese Chess Using Guided Learning. In: Lewis, A., Mostaghim, S., Randall, M. (eds) Biologically-Inspired Optimisation Methods. Studies in Computational Intelligence, vol 210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01262-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-01262-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01261-7
Online ISBN: 978-3-642-01262-4
eBook Packages: EngineeringEngineering (R0)