Hans Berliner rolls. 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. Yakov Estrin–Hans Berliner, 5th CC World Ch Final 1965; Two Knights Defense, Ulvestad Variation ("ECO" C57) Bibliography Hans Berliner Hans Jack Berliner (January 27, 1929 – January 13, 2017) was a Professor of Computer Science at Carnegie
Deep Blue versus Garry Kasparov this is nowadays a common tactic, it was a relatively new idea at the time. Despite this anti-computer tactic, the game was drawn. "May 7". In this game Kasparov played the Caro–Kann Defence. Kasparov got into time trouble late in the game. The sub-optimal moves he played in a hurry may have cost him the victory. "May 10". In this game, the King's Indian Attack opening was played. As in the previous game, Deep Blue played a brilliant endgame that secured a draw, when it was looking as if Kasparov would win. If White plays 50.g8=Q then Black can force