Computers and Technology, 13.11.2020 22:10 lilliankae9285

Prove by contradiction that there is no software able to win every time on checkers

Answers: 1

Show answers

Answers

Answer from: ReaLily

Tinsley had been the world's best for 40 years, a time during which he'd ... It's possible no single person had ever dominated a competitive pursuit ... to prove that Chinook could have beaten the man was to beat the game itself. ... So when Schaeffer began building his own software, he went straight back to ...

Explanation:

Marion Tinsley—math professor, minister, and the best checkers player in the world—sat across a game board from a computer, dying.

Tinsley had been the world’s best for 40 years, a time during which he'd lost a handful of games to humans, but never a match. It's possible no single person had ever dominated a competitive pursuit the way Tinsley dominated checkers. But this was a different sort of competition, the Man-Machine World Championship.

His opponent was Chinook, a checkers-playing program programmed by Jonathan Schaeffer, a round, frizzy-haired professor from the University of Alberta, who operated the machine. Through obsessive work, Chinook had become very good. It hadn't lost a game in its last 125—and since they’d come close to defeating Tinsley in 1992, Schaeffer’s team had spent thousands of hours perfecting his machine.

The night before the match, Tinsley dreamt that God spoke to him and said, “I like Jonathan, too,” which had led him to believe that he might have lost exclusive divine backing.

So, they sat in the now-defunct Computer Museum in Boston. The room was large, but the crowd numbered in the teens. The two men were slated to play 30 matches over the next two weeks. The year was 1994, before Garry Kasparov and Deep Blue or Lee Sedol and AlphaGo.

Another question on Computers and Technology

Computers and Technology, 22.06.2019 21:10

Dameas communication challenge is due to which factor

Answers: 2

Answer

Computers and Technology, 23.06.2019 09:00

Before you record your own voice, you should a. record other people's voices b. warm up and practice difficult names c. listen to your favorite songs d. read a transcript of a good radio news segment

Answers: 1

Answer

Computers and Technology, 23.06.2019 23:30

Match the following errors with their definitions. a. #name b. #value c. #ref d. 1. when a formula produces output that is too lengthy to fit in the spreadsheet cell 2. when you enter an invalid cell reference in a formula 3. when you type text in cells that accept numeric data 4. when you type in a cell reference that doesn’t exist

Answers: 1

Answer

Computers and Technology, 24.06.2019 01:30

Suppose a cpu with a write-through, write-allocate cache achieves a cpi of 2. what are the read and write bandwidths (measured by bytes per cycle) between ram and the cache? (assume each miss generates a request for one block.)

Answers: 1

Answer

You know the right answer?

Prove by contradiction that there is no software able to win every time on checkers...

Questions