六子棋計(jì)算機(jī)博弈系統(tǒng)的研究與實(shí)現(xiàn)-資料下載頁
2025-06-28 18:10本頁面
【正文】 (6期):961－969.[21] Yen S J,Chen J C,Yang T Chinese chess[J].ICGA Journal,2004,(3):318.[22] Russell, Stuart J.。 Norvig, Peter (2003), Artificial Intelligence: A Modern Approach (2nd ed.), Upper Saddle River, NJ: Prentice Hall, pp.111114.[23] L. Ingber, Simulated annealing: Practice versus theory, Mathl. Comput. Modelling, Vol. 18 No. 11, , 1993. [24] Holland J H. A daptation i n nat ure and artif icial system[M] . Ann Arbor : The University of Michigan Press , 1975. [25] Marsland T A. Computer chess and search[D]. Edmonton: University of Alberta, 1991. [26] J. Schaeffer, Distributed Gametree Searching, Journal of Parallel and Distributed Computing, Vol. 6, 1989[27] , , , Bruin, Bestfirst Fixeddepth Minimax Algorithms, Aritificial Intelligence, 1996.[28] David j. Kruglinski, Scot Wingoamp。George Shepherd. Programming MicrosoftVisual C++.Sth Edition, Microsoft Press, 1999.[29] Rivest, , Game Tree Searching by MinMax Approximation. Artificial 1998, Vol. 34, No. 1 [30] G. C. Stockman, A Minimax Algorithm Better than Alphabeta? Aritificial Intelligence, , No. 2, 1979.[31] H. J. Berliner, C. McConnell, B* Probability Based Search, Artificial Intelligence, Vol. 86,No. 1, 1996.[32] L. Victor Allis: Searching for Solutions in Games and Artificial intelligence PartI. PhDThesis, September 1994, ISBN 9090074880.[33] L. Victor Allis: Searching for Solutions in Games and Artificial intelligence Thesis, September 1994, ISBN 9090074880.[34] Martin Schmidt: Temporal Difference Learning and Chess Part I. Aarhus University. [35]Knuth, Moore, . An Analysis of AlphaBeta Pruning. Artificial Intelligence,. 6, No. 4, pp. 293326 [36] Knuth . and Moore . An Analysis of AlphaBeta Pruning. Artificial Intelligence, . 6, No. 4, pp. 293326. (15, 160)[37] T. Anthony Marsland. A review of gametree pruning. ICCA Journal, March1986, Vol 9,No 1: 3 19.[38] Hall . and Loeb . (1992). Thoughts on Programming a Diplomat. Heuristic Programming in Artificial Intelligence 3: thethird puter olympiad (eds. . Van denHerik and . Allis), pp. 123145. Ellis Horwood Ltd, Chichester. (6) [39] Owner’s Handbook. Chess program design[M]. , Turbo Pascal GameWorks, , Borland, 1987. [40] Knuth D E, Moore R N. An analyze of alphabeta pruning[J]. Artificial Intelligence, 1975,6:293326.[41] Jonathan Schaeffer. The history heuristic and alphabeta search enhancements in Transactions on Pattern Analysis and Machine Intelligence, November 1989, pami11(1):12031212.[42] David J Slate, Laweence R Atkin. northwestern university chess program, chess skill in man and machine[M]. New York, SpringerVerlag, 1997:82118.[43] Hermann Kaindl, Reza Shams, Helmut Horacek. Minimax search algorithms with and without aspiration windows[J]. IEEE Transactions Pattern Analysis and Machine Intelligence, December 1991,13(12):12251235.[44] Knuth, . and Moore, . (1975). An Analysis of AlphaBeta Pruning. Artificial Intelligence, Vol. 6, No. 4, pp. 293326[45] Knuth . and Moore . (1975). An Analysis of AlphaBeta Pruning. Artificial Intelligence, Vol. 6, No. 4, pp. 293326. (15, 160)[46] IChen Wu,DeiYen Huang,and HsiuChen . Hsinchu, Taiwan. 2005. 12. [47] Shannon, Claude E. Programming a puter for playing chess [J]. Philosophical Magazine, 1950,41:256275.[48] 李果. 六子棋計(jì)算機(jī)博弈及其系統(tǒng)的研究與實(shí)現(xiàn) [D].重慶:重慶大學(xué),2007.[49] 王驕, 王濤, 羅艷紅, 徐心和. 中國象棋計(jì)算機(jī)博弈系統(tǒng)評(píng)估函數(shù)的自適應(yīng)遺傳算法實(shí)現(xiàn)[J].東北大學(xué)學(xué)報(bào),2005,26卷(10期):949－952.[50] Angeline J,Pollack environments evolve better solution for plex tasks[A].Proceedings of the Fifth International Conf erence on Genetic Algorithms[C].Urbana Champaign,1993:264270.[51] Fukuyama Y. Fundamentals of particle swarm techniques [A]. Lee K Y, ElSharkawi M A. Modern Heuristic Optimization Techniques With Applications to Power Systems [M]. IEEE Power Engineering Society, 2002. 45~51.[52] Angeline P. Using selection to improve particle swarm optimization [A]. Proceedings of IJCNN 99 [C].Washington, USA, 1999. 84~89.[53] 徐海,劉石,馬勇,[J].計(jì)算機(jī)工程與應(yīng)用,2000, (7): 62~63.[54] Marsland T A. Computer chess and search[D]. Edmonton: University of Alberta, 1991.
物理相關(guān)推薦
鄂ICP備17016276號(hào)-1