Considerate 发表于 2025-3-21 18:36:01

书目名称Computer Chess Compendium影响因子(影响力)<br>        http://impactfactor.cn/if/?ISSN=BK0233521<br><br>        <br><br>书目名称Computer Chess Compendium影响因子(影响力)学科排名<br>        http://impactfactor.cn/ifr/?ISSN=BK0233521<br><br>        <br><br>书目名称Computer Chess Compendium网络公开度<br>        http://impactfactor.cn/at/?ISSN=BK0233521<br><br>        <br><br>书目名称Computer Chess Compendium网络公开度学科排名<br>        http://impactfactor.cn/atr/?ISSN=BK0233521<br><br>        <br><br>书目名称Computer Chess Compendium被引频次<br>        http://impactfactor.cn/tc/?ISSN=BK0233521<br><br>        <br><br>书目名称Computer Chess Compendium被引频次学科排名<br>        http://impactfactor.cn/tcr/?ISSN=BK0233521<br><br>        <br><br>书目名称Computer Chess Compendium年度引用<br>        http://impactfactor.cn/ii/?ISSN=BK0233521<br><br>        <br><br>书目名称Computer Chess Compendium年度引用学科排名<br>        http://impactfactor.cn/iir/?ISSN=BK0233521<br><br>        <br><br>书目名称Computer Chess Compendium读者反馈<br>        http://impactfactor.cn/5y/?ISSN=BK0233521<br><br>        <br><br>书目名称Computer Chess Compendium读者反馈学科排名<br>        http://impactfactor.cn/5yr/?ISSN=BK0233521<br><br>        <br><br>

前兆 发表于 2025-3-21 22:01:04

The Chess Machine: An Example of Dealing with a Complex Task by Adaptioning computable; (2) The computer shall be so fast that it does not matter how complicated the way is; and (3) Man shall be so intelligent that he will be able to discern the way and instruct the computer.

催眠 发表于 2025-3-22 02:19:32

Chess Playing Programs and the Problem of Complexityem specified by Shannon. As shown in the Table, all alternatives were considered: all continuations were explored to a depth of two moves (i. e., two moves for Black and two for White): the static evaluation function consisted of a sum of material and mobility measures; the values were integrated by

积习难改 发表于 2025-3-22 08:03:40

Computer v Chess-Playerhere it was invented; millions of games have been played and thousands of books have been written about it; yet the play is still fresh and forever new. Simple arithmetic tells why. On the average, each move in chess offers a choice of about 30 possibilities, and the average length of a full game is

Anonymous 发表于 2025-3-22 10:24:27

A Chess Playing Program for the IBM 7090 Computer at either an arbitrary maximum, or at a stable position. Two schemes of controlling material balance are discussed. Of major significance is the use of the “alpha-beta” heuristic, a method of pruning the tree of moves. This heuristic makes use of values obtained at previous branches in the tree to

synovial-joint 发表于 2025-3-22 16:49:14

http://reply.papertrans.cn/24/2336/233521/233521_6.png

synovial-joint 发表于 2025-3-22 20:13:36

http://reply.papertrans.cn/24/2336/233521/233521_7.png

accrete 发表于 2025-3-22 21:41:43

http://reply.papertrans.cn/24/2336/233521/233521_8.png

SPECT 发表于 2025-3-23 03:50:39

Tree-Searching and Tree-Pruning Techniqueslar the killer heuristic. It then describes a new and very powerful technique that we have termed ‘razoring’. Unlike the alpha-beta technique, razoring cannot guarantee finding the optimum solution but it will, however, always find a good solution in a much shorter time. Typically a four-ply tree wi

projectile 发表于 2025-3-23 07:51:13

http://reply.papertrans.cn/24/2336/233521/233521_10.png
页: [1] 2 3 4 5 6 7
查看完整版本: Titlebook: Computer Chess Compendium; David Levy Book 1988 David Levy 1988 Processing.chess.complexity.computer.computer science.control.controlling.