1) The history of chess-playing machines dates back to 1769 when an automaton that could play chess was built to entertain the Austrian empress. However, it was merely a mechanical device disguising a hidden chess master. 2) In 1914, Torres y Quevedo built a machine that could finish a game of king and rook vs king, demonstrating basic endgame play. 3) In 1947, Turing designed one of the first chess programs to be tested using pencil and paper. Modern applications of chess programs use techniques like searching game trees, position evaluation, and quiescence search.

2. 第⼀一部分:
历史

4. 早在1769年年，匈⽛牙利利⼯工程师, 男爵
沃尔夫冈 · 冯 · Kempelen 建造了了
⼀一个下棋的机器器取悦于奥地利利⼥女女皇
-玛丽亚· 特蕾⻄西娅(Maria
Theresia).但是它完全是⼀一个机械
式驱动,表⾯面具有突厥⼈人的外观.
很⾃自然的表现出来优秀的棋⼒力力是由
⼀一名很巧妙的躲藏在这个机器器中的
国际象棋⼤大师来⾛走棋.实质上这个
机器器只是个伪装.

6. 在1914年年,托雷雷斯 应当(Torresy
Quevedo )制造了了⼀一个机器器设
备,它下完⼀一终局,⼀一⽅方国王+城
堡,⼀一⽅方单国王(Vigneron,
1914).这个机器器持国王+城堡
⼀一⽅方,在很少的步数将死对⽅方,
尽管对⽅方还是⼈人类.
直到现今⼀一些精确的(⾛走棋)规则
可以⽤用来填补令⼈人满意的⾛走法
在终局的时候,虽说问题简单,
但是这个理理念在当时可是相当
的超前了了.

7. Gonzales Torres y Quevedo demonstrating the chess automaton to Norbert Wiener in 1951

8. ● 在1947年年, 图灵设
计了了第⼀一个下国际
象棋的程序,并且
把⾃自⼰己当成电脑⽤用
铅笔和⽩白纸亲⾃自测
试通过.

9. “尽管可能没有实际的可⾏行行性，但
是很多⼈人从原理理上对此感兴趣
并希望得到⼀一个令⼈人满意的解
决⽅方法.这个⽅方法可以起到前锋
的作⽤用,去进攻与其本质类似或
者⽐比其更更加重要的问题….”
”为了了下棋去写⼀一些电脑程序”

10. 英格兰的迪特利希 普林茨博
士在1951年编写了第一个
功能有限的下棋程序.
亚历克斯 伯恩斯坦,一个经验
丰富的棋手且在IBM是个程
序员,在1985年也写了一个
程序能够下一局完整的国际
象棋(尽管这程序能被新手
打败).

12. 高级人机对战是针对国际象棋有一种相关的新的表现方式,人类棋手利用计算机电脑
程序的帮助得到更多可以选择的着法下棋.另一方面人类棋手,不用电脑的辅助计算,
仍然全盘控制双方(人和电脑)的走棋.
世界上最大的计算机棋类游戏组织基于互联网-CCO(Computer Chess Organization）

13. 第⼆二部分:
现代应⽤用

14. • 香侬 “类型A”策略
• 香侬 “类型A”策略
• 香侬 理念
现代应⽤用

15. Evaluating Function:
1) The relative values of queen, rook, bishop, knight and pawn are about 9, 5, 3, 3, 1,
respectively.
2) Rooks should be placed on open files. This is part of a more general principle that the
side with the greater mobility, other things equal, has the better game.
3) Backward, isolated and doubled pawns are weak.
4) An exposed king is a weakness (until the end game).
f(P) = 200(K-K') + 9(Q-Q') + 5(R-R') + 3(B-B'+N-N')
+ (P-P') – 0.5(D-D'+S-S'+I-I') + 0.1(M-M') + ...
K,Q,R,B,B,P are the number of White kings, queens, rooks, bishops, knights and pawns
on the board. D,S,I are doubled, backward and isolated White pawns. Weakness – ie.
exchange of queens

16. ”Type A” strategy considered all possible moves to a fixed depth.
A world champion can construct (at best) combinations say,
15 or 20 moves deep. Some variations given by Alekhine ("My
Best Games of Chess 1924-1937") are of this length.
Let M_1, M_2, M_3, ..., M_s be the moves that can be made
in position P and let M_1P, M_2P, etc. denote symbolically
the resulting positions when M_1, M_2, etc. are applied to P.
Then one chooses the M_m which maximizes f(M_mP).
A deeper strategy would consider the opponent's replies which
are minimized...

17. “Type B” strategy used chess knowledge to explore the more promising
lines to a greater depth.
1) Examine forceful variations out as far as possible and evaluate only
at reasonable positions, where some quasi-stability has been
established.
2) Select the variations to be explored by some process so that
the machine does not waste its time in totally pointless variations.
A crude definition might be:
● g(P) = 1 - if any piece is attacked by a piece of lower value or by more
pieces than defences or if any check exists on a square controlled by the
opponent
● g(P) = 0 otherwise
Using this function, variations could be explored until g(P)=0, always,
however, going at least two moves and never more, say, 10.

18. (...) the machine once designed would always make the same move in the
same position. If the opponent made the same moves this would always
lead to the same game.
(...) the opening is another place where statistical variation can be introduced.
It would seem desirable to have a number of the standard openings
stored in a slow-sped memory in the machine. Perhaps a few hundred
would be satisfactory.
(...) program based on "type position" could not be constructed. (...). Although
there are various books analysing combination play and the middle game,
they are written for human consumption, not for computing machines.
(...)To program such a strategy we might suppose that any position in the
machine is accompanied by a rather elaborate analysis of the tactical
structure of the position suitably encoded. This analytical data will state
that, for example, the Black knight at f6 is pinned by a bishop, that the
White rook at e1 cannot leave the back rank because of a threatened mate
on c1, that a White knight at a4 has no move, etc.;
- These data would be supplied by a program and would be continually
changed and kept up-to-date as the game progressed.

19. 1) 棋盘描述和步法⽣生成
2) 搜索树/剪枝
3) 位置评估

20. DeepThought bit boards

21. A model chess program has three phases to its search:
1) Typically, from the root node an exhaustive examination of
layers of moves occurs,
2) This is followed by a phase of selective searches up to a
limiting depth (the horizon).
3) An evaluation function is applied at the frontier nodes to
assess the material balance and the structural properties of
the position (e.g., relative placement of pawns). To aid in this
assessment a third phase is used, a variable depth
quiescence search of those moves that are not dead (i.e.,
cannot be accurately assessed).

22. 位置评估

23. 1) Claude E. Shannon (1949) Programming a Computer for
Playing Chess. In: Philosophical Magazine, Ser.7, Vol. 41, No. 314 -
March 1950.
2) T.A. Marsland (1992) Computer Chess and Search.
Encyclopedia of Artificial Intelligence, S.C. Shapiro (ed), pp.
224r-241, Wiley & Sons, 2nd ed. 1992, ISBN 0471-50305-3.
3) Ernst A. Heinz (1997) How DarkThought Plays Chess, ICC A
Journal 20(3), pp. 166-176, Sept. 1997.
4) John L. Jerz (2009) A Proposed Heuristic for a Computer Chess
Program
5) Computer History Museum, Mastering the Game – A History
of Computer Chess, http://www.computerhistory.org/chess/
6) Wikipedia, accessed November 2009

25. } 谢谢!