首页
外语
计算机
考研
公务员
职业资格
财经
工程
司法
医学
专升本
自考
实用职业技能
登录
外语
Early in the film "A Beautiful Mind", the mathematician John Nash is seen sitting in a Princeton courtyard, hunched over a playi
Early in the film "A Beautiful Mind", the mathematician John Nash is seen sitting in a Princeton courtyard, hunched over a playi
admin
2012-04-23
78
问题
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. "
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”。
转载请注明原文地址:https://www.kaotiyun.com/show/FPiO777K
0
专业英语八级
相关试题推荐
IrememberMaxverywell.HehadaPh.D.fromPrinceton.HewasaChaucerian.Hewasbrilliant,eloquent,andprofessorial.He
A、Becauseitcostsless.B、Becauseteacherswilllearnquickly.C、Becauseitisrequiredbyexperts.D、Becausetheculturalpatt
InApril1995,ayoungChinesechemistrystudentatBeijingUniversitylaydyinginaBeijinghospital.Shewasinacoma,anda
TherichestagriculturalregionofAmericais______.
Youknowher—thatniceteenageracrossthestreet?Chloe.Theresheis,sittinginoneofthetwocaptain’sseatsinthemidsect
Youknowher—thatniceteenageracrossthestreet?Chloe.Theresheis,sittinginoneofthetwocaptain’sseatsinthemidsect
ItwasadaythatMichaelEisnerwouldundoubtedlyliketoforget.SittinginaLosAngeleswitnessboxforfourhourslastweek
Nowadaysmoreandmorepeoplespendtheirleisuretimetraveling,havingsightseeingofthebeautifulspotsandplacesofhistor
随机试题
若反密码子为UGC,则与其互补的密码子为
行文规则的主要内容有()
2006年11月,某市得利灯具有限责任公司职员郑某因劳动合同方面的几个问题与得利公司发生争议。郑某遂求助于市法律援助协会。设你是法律援助协会工作人员,请就本案回答郑某提出的下列问题:
多品牌战略的优点有()。
某零件A工序加工原定额为15工分/件,已知其实耗工时统计资料为:14,13,15,12,10,9(工分/件)。请根据上述资料,利用简单算术平均法,计算平均先进值和先进平均值。
设函数f(x)=cosωx(ω>0),将y=f(x)的图象向右平移个单位长度后,所得的图象与原图象重合,则ω的最小值等于()
清末设立的机构中,对开启中国传统法律走向近代化作出贡献最大的是()。
以人为本、全面协调可持续发展的科学发展观首次出现在()
在SQL中,“基本表”对应于数据库三级模式结构的
Ifpollutioncontinuestoincreaseatthepresentrate,formationofaerosols(浮质)intheatmospherewillcausetheonsetofan
最新回复
(
0
)