Communications of the ACM
Hans Berliner, Master Chess Player and Programmer, Dies at 87
Hans Berliner, a former world champion of correspondence chess who helped develop game-playing computers, passed away Friday at the age of 87.
Credit: Carnegie-Mellon University archives
Hans Berliner, a former world champion of correspondence chess who won one of the greatest games ever played on his way to the title, and who later helped develop game-playing computers, died on Friday in Riviera Beach, Fla. He was 87.
His death was confirmed by Carl Ebeling, a former student and retired computer science professor at the University of Washington. He is handling Mr. Berliner’s estate.
Mr. Berliner was an expert at correspondence chess, in which moves can be sent by postcard or, more recently, over the internet. Players have days to think about each move, and games usually last months or even years. When Mr. Berliner won the Fifth World Correspondence Chess Championship, the final began on April Fools’ Day in 1965 and did not end until three years later.
Mr. Berliner’s margin of victory in the final was three points, the largest in history. But it was his game against Yakov Estrin, a Russian correspondence grandmaster who finished 13th in the field of 17, that followers of chess remember.
Mr. Berliner, playing Black, essayed the Two Knights Defense, one of the more complicated openings. For many months the players traded what would be described as haymakers in boxing, with each attack met by a counterattack. After a dramatic series of moves, the game wound down to a rook-and-pawn ending, which Mr. Berliner won.
Andy Soltis, a grandmaster of over-the-board (conventional) play, ranked the game No. 1 in his book “The 100 Best Chess Games of the 20th Century” (2000). The game has often been analyzed by people using increasingly powerful chess computers, but only a few small improvements in the moves of both players have ever been found.
Mr. Berliner was also an accomplished over-the-board player. He was an international master — the rank just below grandmaster — and played in United States Championships in the 1950s and early ’60s.
In the early ’60s, inspired by the work of programming pioneers in artificial intelligence, Mr. Berliner, who was working at IBM at the time, began writing a program to play chess.
At 40, just after becoming world correspondence champion, he entered Carnegie Mellon University in Pittsburgh to pursue a doctorate in computer science. He joined the faculty afterward.
As he worked to create a chess computer, he realized that the approach he had previously used — trying to get a computer to use logic — was never going to be as effective as brute force, having the computer analyze as many moves as possible. The problem was that the number of possible moves in a chess game is estimated to rival the number of atoms in the universe. How could a computer tackle such a task?
He looked for a solution by programming a computer to play what he thought was a simpler game: backgammon. But that was also extremely complex: There were about 60 possible moves at any one time, and 21 possible results from the roll of the dice.
He designed a program that played backgammon well up to a point, but something would almost invariably go wrong. He analyzed the problem and discovered that the computer made mistakes when the situation in the game began to change — for example, when the computer went from having a clearly better position to one in which the outcome was in doubt — and the program failed to adjust its strategy. He applied fuzzy set theory to allow the program to make estimates of possible outcomes, and that worked.
In July 1979, the newly redesigned program, called BKG 9.8, played and won a match, 7-1, against Luigi Villa, the reigning world backgammon champion. Mr. Berliner’s program thus became the first to defeat a world champion at any board game, though he acknowledged that the program had better dice rolls than Mr. Villa throughout the match.
Mr. Berliner returned to building a chess computer, working with some of his students, including Mr. Ebeling, who went on to become one of the country’s best-known computer experts, and Murray Campbell, who was later part of the team that designed and built Deep Blue, the computer that beat Garry Kasparov, the reigning champion, in 1997.
In spring 1985, the new computer, HiTech, made its debut. It quickly ascended to the rank of master and then to senior master, becoming the world’s strongest chess computer. In 1988, it became the first computer to beat a grandmaster in a match, defeating Arnold Denker, 3.5 to 0.5, though Mr. Denker was well past his prime.
In an email, Mr. Ebeling recalled Mr. Berliner as demanding but fair. “One of my fondest memories,” he wrote, “was working with him one day on a breakthrough idea that completely changed how we designed HiTech. It was an insightful question about how to use the hardware, which he didn’t really understand, that sparked the new ideas.”
Mr. Berliner was born in Berlin on Jan. 27, 1929. His father was an electrical engineer, and his mother a homemaker. His great-uncle was Emile Berliner, who invented recording discs, otherwise known as records.
In 1937, amid the rise of Nazism, Mr. Berliner’s family emigrated to Washington, D.C. He learned to play chess at 13 during a rainy day at summer camp.
He became a chess master at 20 and by 23 was good enough to be part of the United States team that played in Helsinki at the biennial Chess Olympiad.
Mr. Berliner, who lived in Riviera Beach, was married twice. He is survived by a brother, Ernest.
In a 2005 interview with the Computer History Museum, Mr. Berliner said that one of the most exciting times of his life was in 1985, when HiTech was first being put together. There were so many parts, he recalled, that he was not sure if it would work.
“Sooner or later, the moment of truth comes where you put them all together and see what it does,” he said. “And from the very beginning, I could see that it had the potential — maybe not every single time — it had the potential to play better than any device that existed.”
From The New York Times
View Full Article
No entries found