Heuristic Alpha

from Wikipedia, the free encyclopedia

Heuristic Alpha is a chess program that was developed in the 1990s by the American computer scientist Don Dailey (1956-2013) and his compatriot Larry Kaufman (* 1947) at the Californian company Heuristic Software , whose president was the Puerto Rican at the time Chess master Julio Kaplan (* 1950) was.

In 1991 it participated in the second  Harvard Chess Cup , a tournament "man vs. machine " part. These meetings allowed Heuristic Alpha in a dramatic chess -Partie 25 minutes' thinking for all trains a remarkable victory against the then newly minted grandmaster Patrick Wolff (* 1968, GM since 1990, Elo  2520). In his comment, IM Otto Borik described it as "one of the most beautiful and exciting games that has ever been played between a well-known player and a top program". In the same tournament, Heuristic Alpha also beat GM Michael Rohde .

literature

Frederic Friedel : What is Heuristic Alpha? - Debut of a new chess program at the Harvard Chess Cup 1991 in Computer Chess and Games (CSS), No. 4, 1991, pp. 13-18

Web links

Individual evidence

  1. ↑ Frederic Friedel: What is Heuristic Alpha? - Debut of a new chess program at the Harvard Chess Cup 1991 in CSS, No. 4, 1991, p. 17
  2. ↑ Interview with Julio Kaplan in CSS, No. 4, 1989, p. 23
  3. ↑ Frederic Friedel: What is Heuristic Alpha? - Debut of a new chess program at the Harvard Chess Cup 1991 in CSS, No. 4, 1991, p. 15