找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Algorithms for Games; G. M. Adelson-Velsky,V. L. Arlazarov,M. V. Donskoy Book 1988 Springer-Verlag New York Inc. 1988 DEX.algorithms.chess

[复制链接]
查看: 7329|回复: 35
发表于 2025-3-21 17:37:01 | 显示全部楼层 |阅读模式
期刊全称Algorithms for Games
影响因子2023G. M. Adelson-Velsky,V. L. Arlazarov,M. V. Donskoy
视频video
图书封面Titlebook: Algorithms for Games;  G. M. Adelson-Velsky,V. L. Arlazarov,M. V. Donskoy Book 1988 Springer-Verlag New York Inc. 1988 DEX.algorithms.chess
影响因子.Algorithms for Games. aims to provide a concrete example of the programming of a two-person game with complete information, and to demonstrate some of the methods of solutions; to show the reader that it is profitable not to fear a search, but rather to undertake it in a rational fashion, make a proper estimate of the dimensions of the "catastrophe", and use all suitable means to keep it down to a reasonable size. The book is dedicated to the study of methods for limiting the extent of a search. The game programming problem is very well suited to the study of the search problem, and in general for multi-step solution processes. With this in mind, the book focuses on the programming of games as the best means of developing the ideas and methods presented. While many of the examples are related to chess, only an elementary knowledge of the game is needed.
Pindex Book 1988
The information of publication is updating

书目名称Algorithms for Games影响因子(影响力)




书目名称Algorithms for Games影响因子(影响力)学科排名




书目名称Algorithms for Games网络公开度




书目名称Algorithms for Games网络公开度学科排名




书目名称Algorithms for Games被引频次




书目名称Algorithms for Games被引频次学科排名




书目名称Algorithms for Games年度引用




书目名称Algorithms for Games年度引用学科排名




书目名称Algorithms for Games读者反馈




书目名称Algorithms for Games读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:39:37 | 显示全部楼层
,Vom Eismann zum Tiefkühlkostkönig,within a preselected time limit. An arbitrary algorithm for choosing a move in the positions of a given game may be looked on as an algorithm for choosing the best move in the base position of the game tree of another game, which we shall call a . game. The tree for the model game is a subtree of the original game tree.
发表于 2025-3-22 02:13:15 | 显示全部楼层
发表于 2025-3-22 05:54:03 | 显示全部楼层
发表于 2025-3-22 10:31:23 | 显示全部楼层
https://doi.org/10.1007/978-3-8349-9611-4rting from the latter. If we are to devise algorithms that use this method, we must analyze a) the notion of analogous moves (later we shall often use the term ‘the same’ rather than ‘analogous’) and b) the notion of the difference between positions essential for given variations.
发表于 2025-3-22 16:23:13 | 显示全部楼层
发表于 2025-3-22 17:34:07 | 显示全部楼层
The Method of Analogy,rting from the latter. If we are to devise algorithms that use this method, we must analyze a) the notion of analogous moves (later we shall often use the term ‘the same’ rather than ‘analogous’) and b) the notion of the difference between positions essential for given variations.
发表于 2025-3-22 22:18:54 | 显示全部楼层
Algorithms for Games and Probability Theory,s on the value of .(.). Nevertheless, the method we used (recursive determination of the probability that the model score is correct, as a function of the value of the evaluation function .(.) for positions . of rank .(.) = .) can be applied under a much more general set of postulates.
发表于 2025-3-23 02:50:17 | 显示全部楼层
Book 1988l for multi-step solution processes. With this in mind, the book focuses on the programming of games as the best means of developing the ideas and methods presented. While many of the examples are related to chess, only an elementary knowledge of the game is needed.
发表于 2025-3-23 06:08:30 | 显示全部楼层
in general for multi-step solution processes. With this in mind, the book focuses on the programming of games as the best means of developing the ideas and methods presented. While many of the examples are related to chess, only an elementary knowledge of the game is needed.978-1-4612-8355-3978-1-4612-3796-9
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-20 08:06
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表