找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Computer Chess Compendium; David Levy Book 1988 David Levy 1988 Processing.chess.complexity.computer.computer science.control.controlling.

[復(fù)制鏈接]
查看: 20658|回復(fù): 60
樓主
發(fā)表于 2025-3-21 18:36:01 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Computer Chess Compendium
編輯David Levy
視頻videohttp://file.papertrans.cn/234/233521/233521.mp4
圖書封面Titlebook: Computer Chess Compendium;  David Levy Book 1988 David Levy 1988 Processing.chess.complexity.computer.computer science.control.controlling.
描述For many years I have been interested in computer chess and have collected almost every learned paper and article on the subject that I could find. My files are now quite large, and a considerable amount of time, effort and expense has been required to build up this collection. I have often thought how difficult it must be for many computer chess enthusiasts to acquire copies of articles that they see referenced in some other work. Unless one has access to a good reference library, the task is almost impossible. I therefore decided to try to make available, in one volume, as many as possible of the most interesting and important articles and papers ever written on the subject. Such a selection is naturally somewhat subjective, and I hope that I will not offend authors whose works have been excluded. In particular I have decided to exclude any material which has appeared in the Journal of the International Computer Chess Association (ICCA), or in its precursor, the ICCA Newsletter. The reason is simply that the ICCA itself is in the process of compiling a compendium containing the most important material published in those sources. For further information on ICCA membership and publ
出版日期Book 1988
關(guān)鍵詞Processing; chess; complexity; computer; computer science; control; controlling; programming; robot; technolo
版次1
doihttps://doi.org/10.1007/978-1-4757-1968-0
isbn_softcover978-1-4757-1970-3
isbn_ebook978-1-4757-1968-0
copyrightDavid Levy 1988
The information of publication is updating

書目名稱Computer Chess Compendium影響因子(影響力)




書目名稱Computer Chess Compendium影響因子(影響力)學(xué)科排名




書目名稱Computer Chess Compendium網(wǎng)絡(luò)公開度




書目名稱Computer Chess Compendium網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Computer Chess Compendium被引頻次




書目名稱Computer Chess Compendium被引頻次學(xué)科排名




書目名稱Computer Chess Compendium年度引用




書目名稱Computer Chess Compendium年度引用學(xué)科排名




書目名稱Computer Chess Compendium讀者反饋




書目名稱Computer Chess Compendium讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 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.
板凳
發(fā)表于 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
地板
發(fā)表于 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
5#
發(fā)表于 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
6#
發(fā)表于 2025-3-22 16:49:14 | 只看該作者
7#
發(fā)表于 2025-3-22 20:13:36 | 只看該作者
8#
發(fā)表于 2025-3-22 21:41:43 | 只看該作者
9#
發(fā)表于 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
10#
發(fā)表于 2025-3-23 07:51:13 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-9 07:32
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
封开县| 北碚区| 石泉县| 贡山| 阜宁县| 友谊县| 基隆市| 尼玛县| 吉首市| 临汾市| 北宁市| 丰顺县| 温泉县| 阜平县| 高州市| 石林| 威宁| 四子王旗| 海丰县| 平塘县| 景东| 景洪市| 噶尔县| 大关县| 闻喜县| 新建县| 象山县| 阿城市| 牟定县| 清远市| 绍兴县| 沿河| 光山县| 寻乌县| 文水县| 方城县| 新乡市| 庆安县| 甘洛县| 西峡县| 芒康县|