標(biāo)題: Titlebook: Computers, Chess, and Cognition; T. Anthony Marsland,Jonathan Schaeffer Conference proceedings 1990 Springer-Verlag New York Inc. 1990 art [打印本頁] 作者: 指責(zé) 時(shí)間: 2025-3-21 16:38
書目名稱Computers, Chess, and Cognition影響因子(影響力)
書目名稱Computers, Chess, and Cognition影響因子(影響力)學(xué)科排名
書目名稱Computers, Chess, and Cognition網(wǎng)絡(luò)公開度
書目名稱Computers, Chess, and Cognition網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computers, Chess, and Cognition被引頻次
書目名稱Computers, Chess, and Cognition被引頻次學(xué)科排名
書目名稱Computers, Chess, and Cognition年度引用
書目名稱Computers, Chess, and Cognition年度引用學(xué)科排名
書目名稱Computers, Chess, and Cognition讀者反饋
書目名稱Computers, Chess, and Cognition讀者反饋學(xué)科排名
作者: 裂隙 時(shí)間: 2025-3-22 00:00 作者: 周興旺 時(shí)間: 2025-3-22 01:59
Verifying and Codifying Strategies in a Chess Endgamethe arrival of supercomputers which overcame the previous storage limitations, and which had enough computational power to handle the complexity issue in reasonable time. For a treatment of these issues, see the works of Dekker, van den Herik and Herschberg (1987b), and van den Herik and Dekker (1988).作者: 導(dǎo)師 時(shí)間: 2025-3-22 06:55
Erhaltungss?tze und Sto?prozesseew points against humans in chess tournaments in the early 1970s. This started to cause some bad feelings from humans who lost points to the computers, feeling that they had been adversely affected by the participation of the programs.作者: 神化怪物 時(shí)間: 2025-3-22 12:45
Advances in Man-Machine Playew points against humans in chess tournaments in the early 1970s. This started to cause some bad feelings from humans who lost points to the computers, feeling that they had been adversely affected by the participation of the programs.作者: Antioxidant 時(shí)間: 2025-3-22 14:19 作者: Antioxidant 時(shí)間: 2025-3-22 20:04
Hitechmerican Computer Chess Championship of 1985 as the highest rated program of all time, and duly won the tournament, though not without some assists from lady luck. Since that time . has played in dozens of events, and won 70% of all its games, almost all of which were against Expert and Master competitors.作者: gain631 時(shí)間: 2025-3-22 21:51
The Bratko-Kopec Test Revisiteding to time-consuming and expensive “matches” against other subjects. Clearly there is considerable scope for improvement, as the success of test sets in related areas like pattern recognition attest.作者: 其他 時(shí)間: 2025-3-23 01:36 作者: ARY 時(shí)間: 2025-3-23 07:30
1989 World Computer Chess ChampionshipThe participants measure the tournament in terms of their program’s success and how much they enjoyed themselves. For the organizers, the costs, publicity and attendance of the event are their metrics. And, of course, from the audience’s point of view, the event must be entertaining.作者: 狂熱文化 時(shí)間: 2025-3-23 11:00 作者: sterilization 時(shí)間: 2025-3-23 15:51
Experiments with the Null-Move Heuristicwith only a small chance of error. Although the technique has been previously used in specialized programs for chess tactics, this chapter describes an implementation suitable for general chess programs.作者: subacute 時(shí)間: 2025-3-23 19:51 作者: Mendicant 時(shí)間: 2025-3-24 01:45
https://doi.org/10.1007/978-3-540-74869-4merican Computer Chess Championship of 1985 as the highest rated program of all time, and duly won the tournament, though not without some assists from lady luck. Since that time . has played in dozens of events, and won 70% of all its games, almost all of which were against Expert and Master competitors.作者: Recess 時(shí)間: 2025-3-24 05:34
Koordinatensystem, Translation und Rotationing to time-consuming and expensive “matches” against other subjects. Clearly there is considerable scope for improvement, as the success of test sets in related areas like pattern recognition attest.作者: Commodious 時(shí)間: 2025-3-24 10:29
Elastischer Sto? von zwei Teilchenitially my thoughts were not entirely clear when choosing this topic, but now I can expand the subject slightly so as to allow discussion of the . of AI (artificial intelligence) in a more general sense.作者: intrigue 時(shí)間: 2025-3-24 11:07 作者: 闡釋 時(shí)間: 2025-3-24 15:06 作者: 催眠藥 時(shí)間: 2025-3-24 20:22 作者: 悶熱 時(shí)間: 2025-3-25 01:01 作者: 集中營 時(shí)間: 2025-3-25 04:34
Koordinatensystem, Translation und Rotationgnificance, ‘!’s (“very good moves”) and ‘!!’s (“excellent moves”) do not (since it is not possible to turn a game-theoretically lost position into a draw or win). The meaning of a ‘!’s (and other evaluative symbols) must therefore be found, not in a game-theoretic analysis of the game, but rather in its “psychological” aspects.作者: 身體萌芽 時(shí)間: 2025-3-25 10:24
https://doi.org/10.1007/978-3-540-88575-7ning World Chess Champion, Gary Kasparov, soundly thrashed the reigning World Computer Chess Champion, .. A few weeks later . crushed the author of this chapter, a retired International Master who had hitherto never lost a match against a computer program.作者: 低位的人或事 時(shí)間: 2025-3-25 13:57
Unged?mpfte Schwingung und der Resonanzfall Toolworks Championship with Grandmaster Anthony Miles, defeating four-time World Championship candidate Grandmaster Bent Larsen along the way. Since then, the machine has been successful against other Grandmasters.作者: 卷發(fā) 時(shí)間: 2025-3-25 16:06
https://doi.org/10.1007/978-1-4613-9080-0artificial intelligence; cognition; computer chess; evolution; intelligence; knowledge representation; lea作者: exostosis 時(shí)間: 2025-3-25 21:38
978-1-4613-9082-4Springer-Verlag New York Inc. 1990作者: SEVER 時(shí)間: 2025-3-26 03:29
Koordinatensystem, Translation und Rotation began playing in computer-chess events when it entered ACM’s 1976 North American Computer Chess Championship. It has participated in nearly all major computer-chess events since then using the name . and later ..作者: electrolyte 時(shí)間: 2025-3-26 08:09 作者: 牌帶來 時(shí)間: 2025-3-26 08:31 作者: THE 時(shí)間: 2025-3-26 14:09
Brute Force in Chess and ScienceIt would be easy to imagine that at this 6th World Computer Chess Championship we shall learn more about how well today’s computer programs play chess. What we will actually learn is more restricted, although none-the-less interesting, namely: How well do today’s chess programs play against each other? Levy (1986a) has written:作者: 個阿姨勾引你 時(shí)間: 2025-3-26 16:52 作者: manifestation 時(shí)間: 2025-3-27 00:48 作者: Adulterate 時(shí)間: 2025-3-27 01:18 作者: 埋伏 時(shí)間: 2025-3-27 08:28 作者: 跳動 時(shí)間: 2025-3-27 10:26 作者: cloture 時(shí)間: 2025-3-27 14:24
https://doi.org/10.1007/978-3-540-74869-41.5 in its first competition in a human tournament, losing points only to Masters. By September it was good enough to share first place in a tournament which included four Masters, and thereby raised its USCF rating to 2233, thus eclipsing .’s high-water rating mark of 2206. It went into the North A作者: 不能根除 時(shí)間: 2025-3-27 20:06
https://doi.org/10.1007/978-3-540-74869-4d the process of searching for a solution of the given problem can be represented by a search tree (more generally an acyclic graph, because of transpositions). For instance, in games like chess, the board positions correspond to nodes (or vertices) and the moves to directed arcs. This chapter revie作者: hemoglobin 時(shí)間: 2025-3-27 22:27
Streuprobleme und Wirkungsquerschnitte tree search usually results in a stronger program. Here we describe a technique, called the ., that can be effectively used to improve search speed with only a small chance of error. Although the technique has been previously used in specialized programs for chess tactics, this chapter describes a作者: 先行 時(shí)間: 2025-3-28 02:53
Koordinatensystem, Translation und Rotationmething like 23. Rel? -+, indicating that white’s 23rd move was bad (‘?’) and the position is now lost (‘-+’). Whereas ‘?’s can have game-theoretic significance, ‘!’s (“very good moves”) and ‘!!’s (“excellent moves”) do not (since it is not possible to turn a game-theoretically lost position into a 作者: CLEFT 時(shí)間: 2025-3-28 08:20 作者: 使熄滅 時(shí)間: 2025-3-28 11:50 作者: Terminal 時(shí)間: 2025-3-28 15:08
Koordinatensystem, Translation und Rotation computers and human subjects. Although one may disagree with the choice of test set, question its adequacy and completeness and so on, the fact remains that the designers of computer-chess programs still do not have an acceptable means of estimating the performance of chess programs, without resort作者: Flagging 時(shí)間: 2025-3-28 22:44
Elastischer Sto? von zwei Teilchent physicists when they complained that he used so much of their precious computer time in a . chess match. This was probably in 1966 during the year-long computer chess telegraph match between Stanford University and the Institute of Theoretical and Experimental Physics in Moscow. Let me say that in作者: 造反,叛亂 時(shí)間: 2025-3-29 02:10
How Will Chess Programs Beat Kasparov?ning World Chess Champion, Gary Kasparov, soundly thrashed the reigning World Computer Chess Champion, .. A few weeks later . crushed the author of this chapter, a retired International Master who had hitherto never lost a match against a computer program.作者: 不規(guī)則的跳動 時(shí)間: 2025-3-29 06:51
Deep Thought Toolworks Championship with Grandmaster Anthony Miles, defeating four-time World Championship candidate Grandmaster Bent Larsen along the way. Since then, the machine has been successful against other Grandmasters.作者: abolish 時(shí)間: 2025-3-29 10:16 作者: BILK 時(shí)間: 2025-3-29 14:32
A Short History of Computer Chess1) and Konrad Zuse of Germany (Zuse 1945), tried a hardware approach, but their computer-chess works did not find wide acceptance. Others, like noted scientist Alan Turing, found success with a more philosophical tone, stressing the importance of the stored program concept (Turing . 1953).. Today, b作者: 證實(shí) 時(shí)間: 2025-3-29 15:54
Learning in Beberemained in the T-table from the first game. We did not explore this idea further until 1986, when the danger of losing the same game twice during the 5th World Computer Championship was large enough to warrant action.作者: Feedback 時(shí)間: 2025-3-29 22:36 作者: FOLLY 時(shí)間: 2025-3-30 01:13
https://doi.org/10.1007/978-3-540-88575-71) and Konrad Zuse of Germany (Zuse 1945), tried a hardware approach, but their computer-chess works did not find wide acceptance. Others, like noted scientist Alan Turing, found success with a more philosophical tone, stressing the importance of the stored program concept (Turing . 1953).. Today, b作者: 兩棲動物 時(shí)間: 2025-3-30 06:03
Unged?mpfte Schwingung und der Resonanzfallremained in the T-table from the first game. We did not explore this idea further until 1986, when the danger of losing the same game twice during the 5th World Computer Championship was large enough to warrant action.作者: 男生如果明白 時(shí)間: 2025-3-30 10:11
A Short History of Computer Chess’s tricks and grand hoaxes, as Bell (1978) and Levy and Newborn (1982) explain. In contrast, around 1890 a Spanish engineer, Torres y Quevedo, designed a true mechanical player for KRK (king and rook against king) endgames. A later version of that machine was displayed at the Paris Exhibition of 191作者: Bureaucracy 時(shí)間: 2025-3-30 13:37
Advances in Man-Machine Playe few people took the entry of programs into tournaments seriously. The programs were viewed primarily as a curiosity and, perhaps, a slight bother. Inevitably, the terminals on which the computer’s moves were relayed to the tournament site were noisy, disturbing the other participants. Hence specia作者: Cardiac-Output 時(shí)間: 2025-3-30 18:33 作者: 元音 時(shí)間: 2025-3-30 23:25 作者: GONG 時(shí)間: 2025-3-31 03:38 作者: 脫離 時(shí)間: 2025-3-31 07:06 作者: 語言學(xué) 時(shí)間: 2025-3-31 09:54
Tree Searching Algorithmsd the process of searching for a solution of the given problem can be represented by a search tree (more generally an acyclic graph, because of transpositions). For instance, in games like chess, the board positions correspond to nodes (or vertices) and the moves to directed arcs. This chapter revie
