[1]黄 晨.棋类游戏中的先行权[J].智能系统学报,2007,2(03):91-94.
 HUANG Chen.The firstmove advantage in board games[J].CAAI Transactions on Intelligent Systems,2007,2(03):91-94.
点击复制

棋类游戏中的先行权(/HTML)
分享到:

《智能系统学报》[ISSN:1673-4785/CN:23-1538/TP]

卷:
第2卷
期数:
2007年03期
页码:
91-94
栏目:
出版日期:
2007-06-25

文章信息/Info

Title:
The firstmove advantage in board games
文章编号:
1673-4785(2007)03-0091-04
作者:
黄  晨
复旦大学化学系,上海200433
Author(s):
HUANG Chen
Department of Chemistry, Fudan University, Shanghai 200433, China
关键词:
先行权六子棋计算机博弈奇偶层效应空着裁剪
Keywords:
firstmove advantage ConnectSix computer games evenodd effect nullmove pruning
分类号:
TP18
文献标志码:
A
摘要:
通过对一些典型的棋类和球类游戏规则的考察,指出先行权问题在游戏规则中的重要作用,由先行权引发的规则问题甚至导致了诸如六子棋这样全新的棋类游戏的产生. 还结合奇偶层效应对先行权作了量化,指出空着裁剪的本质同其他基于AlphaBeta窗口的诸多裁剪算法是一致的,并阐述了诸多裁剪算法的作用被空着裁剪算法所掩盖的原因.
Abstract:
The importance of the first-move advantage in rules of board and ball games is presented in this article. Consideration of the firstmove advantage i n ConnectFive lead to the invention of a new board game, ConnectSix. The valu e of the firstmove advantage can be calculated after studying the evenodd effe ct in computer gaming programs. Since the firstmove advantage can be evaluated, t he principle of nullmove pruning is identical to other pruning algorithms base d on an AlphaBeta window. This is the reason the functions of other pruning alg orithms are concealed by nullmove pruning in chess programs. 

参考文献/References:

[1]黄 晨. ELO等级分计算公式详解[W]. 2004.
[2]台湾交通大学资讯工程系. 六子棋首页[W]. 2005.
[3]Wu IC. Connect 6[J]. ICGA J,2009,29(4):234241.
[4]黄 晨. 中国象棋对弈程序ElephantEye[W]. 2006.
[5]PLATT A. MTD(f)A Minimax Algorithm faster than NegaScout[W].1997.
[6]陈志行.电脑围棋小洞天[M].广州:中山大学出版社,2001.
[7]DONNINGER C. Null move and deep search: selective search heuristics for obtuse chess programs[J]. ICGA J,1993,16(3):137-143.
[8]HEINZ E A. AEL pruning[J]. ICGA J, 2000,23(1):21-32.

相似文献/References:

[1]李学俊,王小龙,吴蕾,等.六子棋中基于局部“路”扫描方式的博弈树生成算法[J].智能系统学报,2015,10(02):267.[doi:10.3969/j.issn.1673-4785.201401022]
 LI Xuejun,WANG Xiaolong,WU Lei,et al.Game tree generation algorithm based on local-road scanning method for connect 6[J].CAAI Transactions on Intelligent Systems,2015,10(03):267.[doi:10.3969/j.issn.1673-4785.201401022]

备注/Memo

备注/Memo:
收稿日期:2006-08-21
.作者简介:
黄晨,男,1981年生,硕士研究生,主要研究方向为量子化学计算理论和应用的研究,业余从事中国象棋的计算机博弈理论研究.
E-mail:webmaster@elephantbase.net.
更新日期/Last Update: 2009-05-07