个人信息
象棋世家
文章分类
访客
新浪博客推荐文章
内容
  •  
    2008-05-10 17:36:08
    标签:维基百科 游戏
    引用自 象棋软件 栏目


    The databases are generated by storing in memory the values of positions which have been encountered so far, and using these results to lop off the ends of the search trees if they arise again. Although the number of possible games after a number of moves rises exponentially with the number of moves, the number of possible positions with a few pieces is exponential only in the number of pieces — and effectively limited however many end game moves are searched. The simple expediency of remembering the value of all previously reached positions means that the limiting factor in solving end games is simply the amount of memory available in the computer. While computer memory sizes are increasing exponentially, there is no reason why end games of increasing complexity should not continue to be solved.

    通过把迄今为止遇到的盘面值保存到记忆体中的办法来生成数据库的,通过这种办法可以砍掉一些重复的搜索树的末端节点。虽然在走了若干步以后,盘面可能出现的数量会指数级增长,但是,棋子的可能位置数目只会根据子力数来指数增长,且当很多残局步都被搜索到时,这个数字会被有效地限制。这种记住以前所有到达过的位置的简单好处是:影响解决残局库问题的有限因素仅仅是电脑里的记忆体的大小。当电脑里记忆体的大小在指数级增长的今天,残局库的增长复杂性可以被持续解决。

    A computer using these databases will, upon reaching a position in them, be able to play perfectly, and immediately determine whether the position is a win, loss or draw, plus the fastest or longest way of getting to that result. Knowledge of whether a position is a win, loss or draw is also helpful in advance since this can help the computer avoid or head towards such positions depending on the situation.

    使用这些残局库的电脑,一旦发现残局库里有当前的盘面,就会走出完美的着法,并且立即决定当前盘面是胜,平,或是负,同时还可以找到最快或最长的办法来达到这些结果。这些胜,负,和的知识也可以提前帮助电脑根据当前形势,避免或引导自己走向某特定的盘面 

    Endgame databases featured prominently in 1999, when Kasparov played an exhibition match on the Internet against the Rest of the World. A seven piece Queen and pawn endgame was reached with the World Team fighting to salvage a draw. Eugene Nalimov helped by generating the six piece ending tablebase where both sides had two Queens which was used heavily to aid analysis by both sides.

    1999年,残局库显著地表现了它的特征,当小卡在互联网上和世界上的所有人作一场表演赛时。一个7子的后兵残局形成了,世界联队处于求和的地位。Eugene Nalimov 通过生成一个6子的双方都各有1个后的残局库,拼命使用它来帮助分析。

数据加载中...