首页
登录
职称英语
Early in the film "A Beautiful Mind", the mathematician John Nash is seen si
Early in the film "A Beautiful Mind", the mathematician John Nash is seen si
游客
2024-12-24
29
管理
问题
Early in the film "A Beautiful Mind", the mathematician John Nash is seen sitting in a Princeton courtyard, hunched over a playing board covered with small black and white pieces that look like pebbles. He was playing Go, an ancient Asian game. Frustration at losing that game inspired the real Nash to pursue the mathematics of game theory, research for which he eventually was awarded a Nobel Prize.
In recent years, computer experts, particularly those specializing in artificial intelligence, have felt the same fascination and frustration. Programming other board games has been a relative snap. Even chess has succumbed to the power of the processor. Five years ago, a chess-playing computer called Deep Blue not only beat but thoroughly humbled Garry Kasparov, the world champion at that time. That is because chess, while highly complex, can be reduced to a matter of brute force computation. Go is different. Deceptively easy to learn, either for a computer or a human, it is a game of such depth and complexity that it can take years for a person to become a strong player. To date, no computer has been able to achieve a skill level beyond that of the casual player.
The game is played on a board divided into a grid of 19 horizontal and 19 vertical lines. Black and white pieces called stones are placed one at a time on the grid’s intersections. The object is to acquire and defend territory by surrounding it with stones. Programmers working on Go see it as more accurate than chess in reflecting the ways the human mind works. The challenge of programming a computer to mimic that process goes to the core of artificial intelligence, which involves the study of learning and decision-making, strategic thinking, knowledge representation, pattern recognition and perhaps most intriguingly, intuition.
Along with intuition, pattern recognition is a large part of the game. While computers are good at crunching numbers, people are naturally good at matching patterns. Humans can recognize an acquaintance at a glance, even from the back.
Daniel Bump, a mathematics professor at Stanford, works on a program called GNU Go in his spare time.
"You can very quickly look at a chess game and see if there’s some major issue," he said. But to make a decision in Go, he said, players must learn to combine their pattern-matching abilities with the logic and knowledge they have accrued in years of playing.
"Part of the challenge has to do with processing speed. The typical chess program can evaluate about 300,000 positions in a second, and Deep Blue was able to evaluate some 200 million positions in a second. By mid-game, most Go programs can evaluate only a couple of dozen positions each second," said Anders Kierulf, who wrote a program called SmartGo.
In the course of a chess game, a player has an average of 25 to 35 moves available. In Go, on the other hand, a player can choose from an average of 240 moves. A Go-playing computer would need about 30,000 years to look as far ahead as Deep Blue can with chess in three seconds, said Michael Reiss, a computer scientist in London. But the obstacles go deeper than processing power. Not only do Go programs have trouble evaluating positions quickly; they have trouble evaluating them correctly. Nonetheless, the allure of computer Go increases as the difficulties it poses encourage programmers to advance basic work in artificial intelligence.
For that reason, Fotland said, "writing a strong Go program will teach us more about making computers think like people than writing a strong chess program. " [br] According to the passage, what causes the fascination in programming a computer to play GO?
选项
A、The award of Nobel Prize.
B、The ambition of beating human in playing Go like Deepblue did in playing chess.
C、The possibility to advance basic work in artificial intelligence.
D、The possibility to make computers behave like man.
答案
C
解析
文章在结束出提到,“尽管围棋程序的开发如此之难,编程人员越发产生了浓厚的兴趣”可见正因为其难,一旦攻克就可以在人工智能方面取得重大进展,这正是激励科学家们的最重要原因,A、B选项流于肤浅,D选项错在“behave”,应该是“think”。
转载请注明原文地址:http://tihaiku.com/zcyy/3882666.html
相关试题推荐
Earlyinthefilm"ABeautifulMind",themathematicianJohnNashisseensi
Earlyinthefilm"ABeautifulMind",themathematicianJohnNashisseensi
PatriciaFleetisdistinguishedwithherbeautifulvoicewhichwonherthenatio
Earlyinthefilm"ABeautifulMind",themathematicianJohnNashisseensi
Earlyinthefilm"ABeautifulMind",themathematicianJohnNashisseensi
Earlyinthefilm"ABeautifulMind",themathematicianJohnNashisseensi
Earlyinthefilm"ABeautifulMind",themathematicianJohnNashisseensi
Tobecalledbeautifulisthoughttonamesomethingessentialtowomen’scha
Tobecalledbeautifulisthoughttonamesomethingessentialtowomen’scha
Tobecalledbeautifulisthoughttonamesomethingessentialtowomen’scha
随机试题
TheresponseoftheClintonAdministrationtotheresultofthereferendumwas_
ShouldWeHelpStrangers?1.有人认为帮助陌生人是一种美德2.有人却认为帮助陌生人很容易让自己陷入危险之中3.你的看法
二尖瓣脱垂综合征,下列哪项是错误的A.一般是后瓣中1/3处更易受累,前瓣被累及时
筛窦外侧壁为()A.有中鼻甲和上鼻甲附着的鼻腔粘膜外侧壁上部 B.
女,33岁,4年前始反复上腹痛,餐前出现,餐后缓解。今晨突然出现剧烈腹痛,来诊。
症见头目眩晕,目胀耳鸣,脑部热痛,面色如醉,心中烦热,肢体渐觉不利。口眼渐形喁斜
提出痴呆是"髓减脑消"所致的是A.张仲景 B.张景岳 C.巢元方 D.陈士
动态原理对应的原则是A.反馈原则 B.动力原则 C.能级原则 D.弹性原则
以学习之火,熔铸精神之魂 从孔子的“朝闻道,夕死可矣”到庄子的“吾生也有涯
项目规模评估的方法有()。A:盈亏平衡点比较法B:净现值比较法C:最低成本分
最新回复
(
0
)