| [1] Turing A M. Computing machinery and intelligence. Mind,1950, 59: 433-460.[2] Samuel A L. Some studies in machine learning using the gameof checkers. IBM Journal on Research and Development,1959, 3(3): 210-229.[3] Newborn M. Kasparov versus Deep Blue. Computer ChessComes of Age. New York: Springer-Verlag, 1996.[4] Campbell M, Hoane Jr. A J, Hsu F H. Deep blue. ArtificialIntelligence, 2002, 134(1-2): 57-83.[5] Schaeffer J. One Jump Ahead: Computer Perfection atCheckers (2nd edition). New York: Springer, 2009.[6] Sastry K, Goldberg D, Kendall G. Chapter 4: Genetic algo-rithms. In Search Methodologies: Introductory Tutorials inOptimization and Decision Support Techniques, Burke E K,Kendall G (eds.), Springer, 2005, pp.97-125.[7] Koza J, Poli R. Chapter 5: Genetic programming. In SearchMethodologies: Introductory Tutorials in Optimization andDecision Support Techniques, Burke E K, Kendall G (eds.),Springer, 2005, pp.127-164.[8] Fausett L V. Fundamentals of Neural Networks: Architec-tures, Algorithms and Applications, Prentice Hall, 1993.[9] Yao X. Evolving artificial neural networks. Proc. the IEEE,1999, 87(9): 1423-1447.[10] Jong K A D. Evolutionary Computation: A Unified Ap-proach. Cambridge, USA: MIT Press, 2006.[11] Eiben A E, Smith J E. Introduction to Evolutionary Com-puting (1st edition). Springer, 2003.[12] Fogel D B. Evolutionary Computation: Toward a New Philos-ophy of Machine Intelligence (3rd edition). Piscataway, USA:IEEE Press, 1995.[13] Michalewicz Z, Fogel D. How to Solve It: Modern Heuristics.Springer-Verlag, 2000.[14] Fogel D B. Blondie24: Playing at the Edge of AI. San Fran-cisco, USA: Morgan Kaufmann Publishers, 2002.[15] Fogel D B, Hays T J, Hahn S L, Quon J. A self-learning evolu-tionary chess program. Proceeding of the IEEE, 2004, 92(12):1947-1954.[16] Fogel D B, Hays T J, Hahn S L, Quon J. Further evolution ofa self-learning chess program. In Proc. the IEEE 2005 Sym-posium on Computational Intelligence & Games, April 2005,pp.73-77.[17] Fogel D B, Hays T J, Hahn S L, Quon J. The Blondie25 chessprogram competes against Fritz 8.0 and a human chess mas-ter. In Proc. the IEEE 2006 Symposium on ComputationalIntelligence and Games, May 2006, pp.230-235.[18] Al-Khateeb B, Kendall G. The importance of look-aheaddepth in evolutionary checkers. In Proc. the 2011 IEEECongress on Evolutionary Computation, June 2011, pp.2252-2258.[19] Chellapilla K, Fogel D B. Anaconda defeats Hoyle 6-0: Acase study competing an evolved checkers program againstcommercially available software. In Proc. the 2000 Congresson Evolutionary Computation, July 2000, 2: 857-863.[20] Chellapilla K, Fogel D B. Evolution, neural networks, games,and intelligence. Proceedings of the IEEE, 1999, 87(9): 1471-1496.[21] Chellapilla K, Fogel D B. Evolving an expert checkers playingprogram without using human expertise. IEEE Transactionson Evolutionary Computation, 2001, 5(4): 422-428.[22] Chellapilla K, Fogel D B. Evolving neural networks to playcheckers without relying on expert knowledge. IEEE Trans-actions on Neural Networks, 1999, 10(6): 1382-1391.[23] Kendal G, Shaw S. Investigation of an adaptive cribbageplayer. In Proc. the 3rd International Conference on Com-puters and Games, July 2002, pp.29-41.[24] Cai X, Venayagamoorthy G K, Wunsch D C II. Evolutionaryswarm neural network game engine for capture go. NeuralNetworks, 2010, 23(2): 295-305.[25] Binner J M, Gazely A M, Kendall G. An evaluation of UKrisky money: An artificial intelligence approach. Global Busi-ness and Economics Review, 2009, 11(1): 1-18.[26] Kendall G, Su Y. Imperfect evolutionary systems. IEEETransactions on Evolutionary computation, 2007, 11 (3): 294-307.[27] Cameron B B, Powley E, Whitehouse D, Lucas S M, Cowl-ing P I, Rohlfshagen P, Tavener S, Perez D, SamothrakisS, Colton S. A survey of Monte Carlo tree search methods.IEEE Transactions on Computational Intelligence and AI inGames, 2012, 4(1): 1-43.[28] Samuel A L. Some studies in machine learning using the gameof checkers II: Recent progress. IBM Journal on Research andDevelopment, 1967, 11(6): 601-617.[29] Kaelbling L P, Littman M L, Moore A W. Reinforcementlearning: A survey. Journal of Artificial Intelligence Re-search, 1996, 4: 237-285.[30] Sutton R S, Barto A G. Reinforcement Learning: An Intro-duction. Cambridge, USA: MIT Press, 1998.[31] Vrakas D, Vlahavas I P L. Artificial Intelligence for AdvancedProblem Solving Techniques. Hershey, USA: Information Sci-ence Reference, 2008.[32] Mitchell T M. Machine Learning. McGraw-Hill, 1997.[33] Von Neumann J. Zur Theorie der Gesellschaftsspiele. Math.Annalen, 1928, 100(1): 295-320.[34] Edwards D J, Hart T P. The Alpha-Beta Heuristic (AIM-030). Massachusetts Institute of Technology, 1963, http://dspace.mit.edu/handle/1721.1/6098.[35] Schaeffer J, Lake R, Lu P, Bryant M. Chinook: The worldman-machine checkers champion. AI Magazine, 1996, 17(1):21-30.[36] Russell S, Norvig P. Artificial Intelligence: A Modern Ap-proach (3rd edition). Prentice Hall, 2009.[37] Schaeffer J, Culberson J C, Treloar N, Knight B, Lu P, SzafronD. A world championship caliber checkers program. ArtificialIntelligence, 1992, 53(2/3): 273-289.[38] Fogel D B. Evolutionary Computation: Toward a New Philos-ophy of Machine Intelligence (2nd edition). USA: Wiley-IEEEPress, 2000.[39] Schaeffer J, Burch N, Björnsson Y, Kishimoto A, Müller M,Lake R, Lu P, Sutphen S. Checkers is solved. Science Express,2007, 317(5844): 1518-1522.[40] Fogel D B, Chellapilla K. Verifying anaconda's expert ratingby competing against Chinook: Experiments in co-evolving aneural checkers player. Neurocomputing, 2002, 42(1-4): 69-86.[41] Al-Khateeb B, Kendall G. Introducing a round robin tourna-ment into Blondie24. In Proc. the IEEE 2009 Symposium onComputational Intelligence and Games, Sept. 2009, pp.112-116.[42] Levene M, Fenner T I. The effect of mobility on minimaxingof game trees with random leaf values. Artificial Intelligence,2001, 130(1): 1-26.[43] Nau D S, Lu穝trek M, Parker A, Bratko I, Gams M. Whenis it better not to look ahead?. Artificial Intelligence, 2010,174(16-17): 1323-1338.[44] Smet P, Calbert G, Scholz J, Gossink D, Kwok H-W,Webb M.The effects of material, tempo and search depth on win-lossratios in chess. In Proc. the 16th Australian Conf. ArtificialIntelligence, Dec. 2003, pp.501-510.[45] Bettadapur P, Marsland T A. Accuracy and savings indepth-limited capture search. International Journal of Man-Machine Studies, 1988, 29(5): 497-502.[46] Runarsson T P, Jonsson E O. Effect of look-ahead searchdepth in learning position evaluation functions for Othellousing "-greedy exploration. In Proc. the IEEE 2007 Sympo-sium on Computational Intelligence and Games, April 2007,pp.210-215.[47] Hughes E J. Piece difference: Simple to evolve. In Proc.the 2003 Congress on Evolutionary Computation, Dec. 2003,pp.2470-2473.[48] Al-Khateeb B, Kendall G. The importance of a piece differ-ence feature to Blondie24. In Proc. the 10th Annual Work-shop on Computational Intelligence, Sept. 2010, pp.1-6. |