[1] KNUTH D E, MOORE R W. An analysis of alpha-beta pruning [J]. Artificial Intelligence, 1975, 6(4): 293-326.[2] KJELDSEN T H. John von Neumann's conception of the minimax theorem: a journey through different mathematical contexts [J]. Archive History Exact Sciences, 2001, 56(1): 39-68. [3] 尚宇红.极小极大值理论的历史发展[J].西北大学学报:自然科学版,2003,33(2):245-248.[4] FISHBURN J, FINKEL R. Parallel alpha-beta search on Arachne [R]. Madison, USA: University of Wisconsin, Department of Computer Sciences, 1980.[5] PEARL J. Asymptotic properties of minimax trees and game searching procedures [J]. Artificial Intelligence, 1980, 14(2): 113-138.[6] PLAAT A, SCHAEFFER J, PIJLS W, et al. A new paradigm for minimax search, TR-CS-94-18 [R]. Edmonton, Canada: University of Alberta, Department of Computing Science, 1994.[7] PLAAT A, SCHAEFFER J, PIJLS W, et al. Best-first fixed-depth minimax algorithms [J]. Artificial Intelligence, 1996, 87(1/2): 255-293.[8] SLAGLE J R, DIXON J K. Experiment with some programs that search game trees [J]. Journal of the Association for Computing Machinery, 1969, 16(2): 189-207.[9] 张明亮,李凡长.一种新的博弈树搜索方法[J].山东大学学报:工学版,2009,39(6):1-8.[10] 张明亮.一种新的博弈树搜索算法及其应用研究[D].苏州:苏州大学,2007.[11] 张明亮,吴俊,李凡长.极小树叶结点数定理的补充证明及有关分析[J].模式识别与人工智能,2011,24(4):521-526.[12] 叶品星.一种博弈树静态估值算法——△Feature状态估值[J].计算机工程与设计,2004,25(7):1214-1217.[13] 徐长明,马宗民,徐心和.一种新的连珠棋局面表示法及其在六子棋中的应用[J].东北大学学报:自然科学版,2009,30(4):514-517.[14] 王秀坤,刘健男.优化博弈问题评估函数参数的自适应遗传算法[J].计算机工程与应用,2009,45(20):42-44.[15] CAMPBELL M, HOANE A, HU F-H. Deep blue [J]. Artificial Intelligence, 2002, 134: 57-83.[16] 王晓鹏,王骄,徐心和,等.中国象棋与国际象棋比较分析[J].重庆工学院学报:自然科学版,2007,21(1):71-76.[17] 莫建文,林士敏,张顺岚.基于TD强化学习智能博弈程序的设计与实现[J].计算机应用,2004,24(S1):287-288.[18] CRACRAFT S. Bitmap move generation in chess [J]. Journal of the International Computer Chess Association, 1984, 7(3): 146- 153.[19] HYATT R M. Rotated bitmaps a new twist on an old idea [ J]. Journal of the International Computer Chess Association, 1999, 22(4): 213- 222. |