首页
外语
计算机
考研
公务员
职业资格
财经
工程
司法
医学
专升本
自考
实用职业技能
登录
外语
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
2011-04-11
27
问题
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. "
Which of the following elements does NOT contribute to the complexity of programming a computer to play Go?
选项
A、Playing Go involves decision-making.
B、Playing Go involves pattern-matching.
C、The limitation of computer’s processing speed.
D、There exist too many possibilities in each move.
答案
A
解析
以下哪一要素不是围棋程序编写的困难? A选项错在虽然人工智能涉及到了决策制定,但文中并没有提到是这一点使围棋程序编写尤其困难,以常识而言,象棋程序中也涉及决策制定。而其他选项在下文都有特别提到,以强调围棋程序编写之难。
转载请注明原文地址:https://kaotiyun.com/show/CVYO777K
0
专业英语八级
相关试题推荐
EducationinU.K.iscompulsoryforallbetweenagesof______.
Beforeconsideringthisquestionitisinterestingtoreviewbrieflytheevolutionofthe【M1】______
Thetraditionalimageofcavedwellersisprobablyape-likecreaturescladinskimpyanimalskins,completewithclubsandmatte
IrememberMaxverywell.HehadaPh.D.fromPrinceton.HewasaChaucerian.Hewasbrilliant,eloquent,andprofessorial.He
FashionWiththeprogressionofthehumansociety,peopleareincreasinglydemandingtheirclothestobebeautifulaswellas
Recently,apossiblealternativewayofproducingpaperhasbeensuggestedbyagriculturalists:andenvironmentalists:aplant
汉、唐时期既是经济繁荣的盛世,也是中外交流的盛世。张骞出使西域,开拓举世闻名的“丝绸之路”;玄奘万里取经,带回南亚国家的古老文化;明代郑和七下西洋,把中华文化传向远方的国度。但是后来,特别是清代晚期,封建统治者实行闭关锁国的政策,阻碍了中国的进步和中外交流
C美国文学之作家概况。WaltWhitman是美国著名诗人,代表作为《草叶集》(LeavesofGrass),他是第一位使用自由体(FreeVerse)的诗人。
IrememberMaxverywell.HehadaPh.D.fromPrinceton.HewasaChaucerian.Hewasbrilliant,eloquent,andprofessorial.He
C英国文学之作家作品。DonJuan,中文名为《唐璜》,是英国浪漫主义诗歌代表人拜伦所写的长诗。
随机试题
患者男性,因上前牙牙龈反复出现瘘管,X线片显示根管钙化,经过多次正规治疗后无效,拟行根尖手术该患者适宜采用的手术切口是A.半月形瓣B.扇形瓣C.全厚粘骨膜瓣D.矩形瓣E.以上皆不正确
下列个人理财业务人员的做法中,需要负刑事责任的是()
“园本教研”的三要素是()
2014年一季度,A省货物运输增长较快,全省各种运输方式共完成货运量89294万吨,比上年同期增长15.4%;完成货物周转量2444.60亿吨公里,增长17.7%。全省货运增长较快主要依靠公路和水路拉动。一季度,公路完成货运量64944万吨,货物
AroundhalfofallteenagersintheUKareputtingthemselvesatriskoffoodpoisoningbecausetheydon’twashtheirhandsbefo
OneafternooninJanuary1989,SusanSharp,43,andher8-year-oldson,David,werewalkinghard【C1】______anicyparkinglot,【C2
Youwillhearaninterviewaboutdifferentmoneytypesinorder:guardians,idealists,artisans,rationalsandthemixedtype.F
STOMACH:
SomeTheoriesofHistoryI.TheproblemsofunderstandinghistoryHistorywithwrittenrecords:therecordsmaybe【T1】______
DisagreementmarkshistoricalappraisalsofAmerica’semergenceasagreatpowerattheturnofthetwentiethcentury.Ontheo
最新回复
(
0
)