Computershavebeatenhumanworldchampionsatchessand,earlie...
问题详情:
Computers have beaten human world champions at chess and, earlier this year, the board game Go(围棋). So far, though, they have struggled at the card table. So we challenged one AI(artificial intelligence) to a game.
Why is poker so difficult? Chess and Go are “information complete” games where all players can see all the relevant information. In poker, other players’ cards are hidden, making it an “information incomplete” game. Players have to guess opponents’ hands from their actions----tricky for computers. Solving poker could lead to many breakthroughs, from cyber security to driverless cars.
Scientists believe it is only a matter of time before AI once again vanquishes humans, so our human-machine match comes up in a game of Texas Hold’s Em Limit Poker. The AI was developed by Johannes Heinrich, a researcher studying machine learning at UCL. It combines two techniques: neural(神经的)networks and reinforcement learning(强化学习).
Neural networks, to some degree, copy the structure of human brains: their processors are highly interconnected and work at the same time to solve problems. They are good at spotting patterns in huge amounts of data. Reinforcement learning is when a machine, given a task, carries it out, learning from mistakes it makes. In this case, it means playing poker against itself billions of times to get better.
Mr Heinrich told Sky News: “Today we are presenting a new procedure that has learned in a different way, more similar to how humans learn. In particular, it is able to learn abstract patterns, represented by its neural network, which allow it to deal with new and unseen situations.”
After two hours of quite defensive play, from the computer at least, we called it a draw.
25. Why can’t the computer beat humans at the poker game?
A. Because humans are cleverer than the computer
B. Because humans practice playing the poker game every day
C. Because the computer can’t learn the regular rules of the poker game
D. Because the computer can’t know the other players’ cards completely
26. What does the underlined word “vanquishes” in Paragraph 3mean?
A. Leaves B. Defeats C. Cheats D. Serves
27. What do we know about the reinforcement learning of AI?
A. It solves problems correctly every time
B. It is the same as the learning of humans
C. It learns from the mistakes appearing in a task
D. It is more developed than the studying ways of humans
28. What can be inferred from the text?
A. The new procedure of AI has some features of humans
B. Computers are stronger than humans in every aspect
C. Humans will beat computers at playing poker forever
D. Scientists feel unhappy about the result of the poker game
【回答】
DBCA
知识点:阅读理解
题型:阅读理解
-
某班抽取6名同学进行体育达标测试,成绩如下:80,90,75,80,75,80.下列关于对这组数据的描述错误的...
问题详情:某班抽取6名同学进行体育达标测试,成绩如下:80,90,75,80,75,80.下列关于对这组数据的描述错误的是( )A.众数是80 B.平均数是80 C.中位数是75 D.极差是15【回答】C知识点:数据的集中趋势题型:未分类...
-
蜡烛燃烧刚熄灭时产生的白*是什么?提出问题:蜡烛刚熄灭时,总会有一缕白*冒出,它的成分是什么呢?猜想与假设:A...
问题详情:蜡烛燃烧刚熄灭时产生的白*是什么?提出问题:蜡烛刚熄灭时,总会有一缕白*冒出,它的成分是什么呢?猜想与假设:A.白*是燃烧时生成的二氧化碳;B.白*是燃烧时生成的水蒸气;C.白*是石蜡蒸气凝成的石蜡固体小颗粒进行实验:⑴吹灭蜡烛,立即用一个蘸有澄清石灰水的烧杯罩住白...
-
木直中绳, ,其曲中规。 ,不复挺者, ...
问题详情:木直中绳, ,其曲中规。 ,不复挺者, 。故木受绳则直, 。 ,则知明而行无过矣。(《荀子·离骚》)【回答】輮以为轮 虽有槁曝 ...
-
直角坐标系中,点P(1,4)在A.第一象限 B.第二象限 C.第三象限 D.第四象限
问题详情:直角坐标系中,点P(1,4)在A.第一象限 B.第二象限 C.第三象限 D.第四象限【回答】A知识点:平面直角坐标系题型:选择题...
相关文章
- Sciencecan'texplainthepowerofpets,butmanystudieshavesho...
- Sciencecan'texplainthepowerofpets,butmanystudieshavesho...
- Sciencecan'texplainthepowerofpets,butmanystudieshavesho...
- Recently,we’veoftenheardaboutearthquakesinsomeplacesint...
- Itdoesn'tmatterwhenorhowmuchapersonsleeps,buteveryonene...
- Itdoesn'tmatterwhenorhowmuchapersonsleeps,buteveryonene...
- Sciencecan'texplainthepowerofpets,butmanystudieshavesho...
- Itdoesn'tmatterwhenorhowmuchapersonsleeps,buteveryonene...
- Itdoesn'tmatterwhenorhowmuchapersonsleeps,buteveryonene...
- Itdoesn'tmatterwhenorhowmuchapersonsleeps,buteveryonene...