Hans Berliner

Hans Jack Berliner (January 27, 1929 – January 13, 2017) was a Professor of Computer Science at Carnegie Mellon University, and was the World Correspondence Chess Champion, from 1965–1968. He was a Grandmaster of Correspondence Chess. He directed the construction of the chess computer HiTech, and was also a published chess writer.

Life and career[]

Berliner was born in Berlin. One of his classmates at school was future Estonian President Lennart Meri, whose father was serving as Estonia's ambassador to Germany.^[1] In 1937, the 8 year old Berliner's family, who were Jewish,^[2] moved to America to escape Nazi persecution, taking up residence in Washington, D.C. He learned chess at age 13, and "it quickly became his main preoccupation."

Berliner is mentioned in "How I Started To Write", an essay by Carlos Fuentes, where he is described as "an extremely brilliant boy", with "a brilliant mathematical mind". "I shall always remember his face, dark and trembling, his aquiline nose and deep-set, bright eyes with their great sadness, the sensitivity of his hands..."^[3]

In 1949, he became a master, won the District of Columbia Championship (the first of five wins of that tournament) and the Southern States Championship, and tied for second place with Larry Evans at the New York State Championship. He also won the 1953 New York State Championship (the first win by a non-New Yorker), the 1956 Eastern States Open directed by Norman Tweed Whitaker in Washington, D.C., ahead of William Lombardy, Nicolas Rossolimo, Bobby Fischer (at age 13) and Arthur Feuerstein, and the 1957 Champion of Champions tournament.^[4][5]

Berliner played for his country's Olympiad team at Helsinki 1952, drawing his only game on the second reserve board.^[6] Berliner played four times in the US Chess Championship. In 1954 at New York, he scored 6½/13 to tie 8–9th places; Arthur Bisguier won. The last three times Berliner played in the U.S. Championship, Fischer won the tournament. In 1957–58 at New York, Berliner had his best result, 5th place with 7/13. In 1960–61 at New York, he scored 4½/11, tying for 8th–10th place. Finally in 1962–63 at New York, he scored 5/11 for a tied 7th–8th place.^[4]

Berliner was talented at all aspects of chess. As a teenager he gave a multi-board blindfold simultaneous exhibition at the Washington Chess Divan, winning all six games against top local players.^[7]

Berliner returned to school in 1969 to get a PhD.^[8] He graduated from Carnegie Mellon University in 1974 under the supervision of Allen Newell. His thesis was titled: "Chess as Problem Solving: The Development of a Tactics Analyzer". He died on January 13, 2017 in Riviera Beach, Florida, fourteen days away from his 88th birthday.^[9]

Correspondence play[]

Berliner is remembered most for his feats in correspondence play, in which games, played by mail can take days, months or even years to complete. He won the 5th World Correspondence Chess Championship in 1965, beginning the final game on April 1, 1965 and finishing three years later.^[10] He won with the extraordinary score of 14/16 (twelve wins, four draws), a margin of victory of three points, thrice that of any other winner in these championships.^[11]

Berliner's game in which he played the Two Knights Defense to defeat Yakov Estrin in the 1965 World Correspondence Chess Championship is one of the most famous and important games in correspondence chess.^[12]

As of March 31, 2005, Berliner still had by far the highest International Correspondence Chess Federation (ICCF) rating of any player in the United States, at 2726, 84 points above the second-highest rated player.^[13] Berliner's 2726 rating places him third on the ICCF's world list, behind Joop van Oosterom (2741) and Ulf Andersson (2736).^[14]

In his 1999 book The System, Berliner claimed that the move 1.d4 gives White a large, and possibly decisive, advantage.

Programming[]

Berliner began designing computer chess programs in the early 1960s while employed by IBM. He entered Carnegie Mellon University at the age of 40 to earn a Ph.D. in computer science. While there, he came up with idea for HiTech, a more advanced chess computer program. It performed well, but only until it ran into transitions, that is, points in the game when the balance between the players changed. This led Berliner to conclude that HiTech was weak in board evaluation. He decided that to explore the problem, he should write an evaluation function for another game: backgammon. The result was BKG 9.8, written in the late 1970s on a DEC PDP-10. Early versions of BKG played badly even against poor players, but Berliner noticed that its critical mistakes were always at transitions. He applied principles of fuzzy logic to smooth out the transition between phases, and by July 1979, BKG 9.8 was strong enough to play against the ruling world champion Luigi Villa. It won the match 7–1, becoming the first computer program to defeat a world champion in any game. Berliner states that the victory was largely a matter of luck, as the computer received more favorable dice rolls.^[15]

He also developed the B* search algorithm for game tree searching.

Some of Berliner's PhD students, such as Carl Ebeling and Murray Campbell, went on to become noted researchers in computer chess themselves. Campbell was part of the Deep Blue team that defeated Garry Kasparov in 1997.

In his later years Berliner lived in Florida and worked to develop computer chess programs.

Books[]

• Berliner, Hans (1999), The System: A World Champion's Approach to Chess, Gambit Publications, ISBN 1-901983-10-2
• Berliner, Hans and Messere, Ken (1971), The Fifth Correspondence World Championship, British Chess Magazine Quarterly No. 14 (no ISBN)

Notable games[]

	a	b	c	d	e	f	g	h
8									8
7									7
6									6
5									5
4									4
3									3
2									2
1									1
	a	b	c	d	e	f	g	h

Position after 13...exf3

Yakov Estrin–Hans Berliner, 5th CC World Ch Final 1965; Two Knights Defense, Ulvestad Variation (ECO C57)

1. e4 e5 2. Nf3 Nc6 3. Bc4 Nf6 4. Ng5 d5 5. exd5 b5 6. Bf1 Nd4 7. c3 Nxd5 8. Ne4 Qh4 9. Ng3 Bg4 9...Ne6 10.Bxb5+ Bd7 11.Bxd7+ Kxd7 12.Qf3 Nef4 13.d4!+/−; 9...Bb7 10.cxd4 0-0-0 11.d3 Nf4 12.Bxf4 exf4 13.Qh5 Bb4+ 14.Kd1 Qe7 (Jovcic–Karaklajic, Jugoslavia 1960) 15.Ne2!+/− (Gligorić) 10. f3 e4 10...Nf5 11.Bxb5+ Kd8 12.0-0 Bc5+ 13.d4 exd4 14.Ne4!+/− (Kopylov) 11. cxd4 Bd6 12. Bxb5+ Kd8 13. 0-0 exf3 (see diagram) 14. Rxf3 14.Qb3! fxg2 (14...Nb4!! 15.Rxf3 c6!! 16.Be2! Bxf3 17.gxf3 Bxg3 18.hxg3 Qxg3+ =/+, Berliner) 15.Rf2 Be6 16.Qf3 Rb8 17.Bc4 Qxd4 18.d3!+/− (Estrin) 14... Rb8 15. Be2 15.a4!+/− Jovcic–Koshnitsky, corr. 1969 (Gligorić) 15... Bxf3 16. Bxf3 Qxd4+ 17. Kh1 Bxg3 18. hxg3 Rb6 19. d3 Ne3 20. Bxe3 Qxe3 21. Bg4 h5 22. Bh3 g5 23. Nd2 g4 24. Nc4 Qxg3 25. Nxb6 gxh3 26. Qf3 hxg2+ 27. Qxg2 Qxg2+ 28. Kxg2 cxb6 29. Rf1 Ke7 30. Re1+ Kd6 31. Rf1 Rc8 32. Rxf7 Rc7 33. Rf2 Ke5 34. a4 Kd4 35. a5 Kxd3 36. Rf3+ Kc2 37. b4 b5 38. a6 Rc4 39. Rf7 Rxb4 40. Rb7 Rg4+ 41. Kf3 b4 42. Rxa7 b3 0–1^[16]

See also[]

• Chess piece relative value – gives Berliner's system
• First-move advantage in chess#White wins with 1.d4 – discusses Berliner's book The System
• Murray Campbell

References[]

Bibliography

• Berliner, Hans (1979), "The B* Tree Search Algorithm. A Best-First Proof Procedure.", Artificial Intelligence, 12 (1): 23–40, doi:10.1016/0004-3702(79)90003-1
• Berliner, Hans (1999), The System: A World Champion's Approach to Chess, Gambit Publications, ISBN 1-901983-10-2
• Brady, Frank (1973), Profile of a Prodigy (2nd ed.), David McKay
• Burgess, Graham; Nunn, John; Emms, John (2004), The Mammoth Book of the World's Greatest Chess Games, Carroll & Graf, ISBN 0-7867-1411-5
• Evans, Larry (1970), Modern Chess Brilliancies, Fireside, ISBN 0-671-22420-4
• Főldeák, Árpád (1979), Chess Olympiads 1927–1968, Dover Publications, ISBN 0-486-23733-8

External links[]

• Hans Berliner player profile and games at Chessgames.com
• Oral History of Hans Berliner