[1]HUANG Chen.The firstmove advantage in board games[J].CAAI Transactions on Intelligent Systems,2007,2(3):91-94.
Copy

The firstmove advantage in board games

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 2 Number of periods: 2007 3 Page number: 91-94 Column: 综述 Public date: 2007-06-25
Title:
The firstmove advantage in board games
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
CLC:
TP18
DOI:
-
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.
Similar References:

Memo

-

Last Update: 2009-05-07

Copyright © CAAI Transactions on Intelligent Systems