Developer | Carl Ebeling, Hans J. Berliner, Murray Campbell, Gordon Goetsch, Andy Palay, Larry Slomer |
---|---|
Type | Chess machine |
Release date | c. 1985 |
HiTech, also referred to as Hitech, is a chess machine [1] built at Carnegie Mellon University under the direction of World Correspondence Chess Champion Hans J. Berliner. Members of the team working on HiTech included Berliner, Murray Campbell, Carl Ebeling, Gordon Goetsch, Andy Palay, and Larry Slomer. [2] In 1988, it became the first computer system to beat a grandmaster. [3]
It was designed by Carl Ebeling, a student, from 1986 to 1988, under professor Hans Berliner at Carnegie Mellon University. [4] Members of the team working on HiTech included Berliner, Murray Campbell, Carl Ebeling, Gordon Goetsch, Andy Palay, and Larry Slomer. [2]
Berliner had also created a computer program to play backgammon called BKG 9.8, which beat Luigi Villa in 1979, and in the process became "the first computer program to beat a world champion in any game." According to the New York Times, "this research led, in 1984, to a chess program called HiTech." [5] The computer used an algorithm developed by Berliner to narrow the choices when selecting a move, called B*, or B-star. The algorithm would evaluate decision trees and assign nodes with an "optimistic" or "pessimistic" score, with the aim of finding a path that was sufficient to solve the problem, rather than perfect. [6]
HiTech's name refers to a chess-playing program called TECH that was developed at Carnegie Mellon. [2] The team combined a Sun computer equipped with a custom processor called "the searcher" by Berlin. It runs three programs: a user interface, a task controller, and an "oracle," with the latter consisting of a large catalogue of chess openings and variations. The searcher component contains a microprocessor and a number of hardware modules to perform tasks such as generating and evaluating moves. These activities are coordinated by the microprocessor. The move generator [2] consisted of 64 VLSI chips, with one for each square on the chessboard. [2] [6] In 1988, Hitech could scan 165,000 positions a second. [7]
The hardware, which was custom, could analyze over 200,000 moves per second. [4] The computer has a nearly six-foot-tall mainframe. [8] HiTech was one of two competing chess projects at Carnegie Mellon; the other was ChipTest. [9] ChipTest became the predecessor of IBM's Deep Thought and Deep Blue). [10]
HiTech won the 1985 and 1989 editions of the North American Computer Chess Championship. [7] From September 1985 to July 1988, it used the same hardware, while its standing in the US chess community rose from being in the top 2% to the top .5%. Berliner described this change as a result of "using better management of the resources that have been available." [8] In November 1985, the Associated Press reported that over five months of play, it had earned the rank of master and achieved the highest rating ever given a chess machine. At that time, its developers argued it was 50% faster than any other chess-playing computer systems. [11] The computer began competing on the chess circuit, only going against humans, in 1986. [12] By 1987, the computer ranked 190th in the United States, and was the only computer among the top 1,000 chess players. [6]
ChipTest was invited to play in the 1987 American Open, but the team did not enter due to an objection by the HiTech team, also from Carnegie Mellon University. HiTech and ChipTest shared some code, and Hitech was already playing in the tournament. The two teams became rivals. [9]
HiTech was the first computer to be rated over 2400 in chess, [4] which is the senior master USCF rating level. [13]
In 1987, it won the Pennsylvania State Chess Championship, scoring 4.5 points out of 5 after a four-way tie. HiTech had an overall performance score of 2559, considered a high Senior Master rating. However, an interpretation of the rules denied HiTech the money prize, the State Title, and trophy, as only a resident could earn the title. [14] Hitech won the Pennsylvania State Chess Championship twice, winning again in July 1988. It won with a score of 4.5 - 0.5, beating international master Edward Formanek in the process. Rules had changed since 1987, allowing a computer to win the title, but not the trophy or prize money. However, Professor Formanek gave Hitech the trophy he had been awarded as the highest human competitor. [1]
In May 1988, Hitech was described by TIME as being able to compete in hotel competitions remotely. The main computer remained at Pittsburgh, while a contraption TIME called "an ungainly-looking brute," would be operated by Berliner and Carl Ebeling at the tournament. The remote Hitech relied on its phone line connection to Pittsburg to communicate moves. This meant that whenever the hotel would use their phone line, the computer would need to be relinked via a phone call. [12]
In 1988 HiTech defeated GM Arnold Denker 3½-½ in a match [7] in New York City. [15] Hitech won the four-game match, the first a draw and the last three wins, marking the first time a grandmaster was beaten by a chess program. According to the New York Times at the time, most experts agreed Denker, however, was "badly off form," as a largely retired individual at 74 years old. Denker called Hitech's play an impressive achievement. [7]
In 1988, Berliner stated that he and his associates at Carnegie-Mellon were working on an improved model of Hitech, with three years of work projected before it debuted. At the time, Hitech could scan 165,000 positions a second. Berliner stated that "speed alone is not the most important thing. Hitech scans in a dumb sort of way. It has to go through every possible position. A smarter machine might operate only on 100,000 scans a second, but it will confine those scans to positions germane to the situation. That is what we call a smart scan." [7]
HiTech has been included in exhibits by the Computer History Museum. [4] The Carnegie Mellon University Libraries began holding the computer in 2022, as part of the university's Robotics Project. It was donated from the collection of Chris Atkeson. [3]
Deep Blue was a chess-playing expert system run on a unique purpose-built IBM supercomputer. It was the first computer to win a game, and the first to win a match, against a reigning world champion under regular time controls. Development began in 1985 at Carnegie Mellon University under the name ChipTest. It then moved to IBM, where it was first renamed Deep Thought, then again in 1989 to Deep Blue. It first played world champion Garry Kasparov in a six-game match in 1996, where it lost four games to two. It was upgraded in 1997 and in a six-game re-match, it defeated Kasparov by winning two games and drawing three. Deep Blue's victory is considered a milestone in the history of artificial intelligence and has been the subject of several books and films.
Computer chess includes both hardware and software capable of playing chess. Computer chess provides opportunities for players to practice even in the absence of human opponents, and also provides opportunities for analysis, entertainment and training. Computer chess applications that play at the level of a chess grandmaster or higher are available on hardware from supercomputers to smart phones. Standalone chess-playing machines are also available. Stockfish, Leela Chess Zero, GNU Chess, Fruit, and other free open source applications are available for various platforms.
Feng-hsiung Hsu is a Taiwanese-American computer scientist and the author of the book Behind Deep Blue: Building the Computer that Defeated the World Chess Champion. His work led to the creation of the Deep Thought chess computer, which led to the first chess playing computer to defeat grandmasters in tournament play and the first to achieve a certified grandmaster-level rating.
A graphics processing unit (GPU) is a specialized electronic circuit initially designed for digital image processing and to accelerate computer graphics, being present either as a discrete video card or embedded on motherboards, mobile phones, personal computers, workstations, and game consoles. After their initial design, GPUs were found to be useful for non-graphic calculations involving embarrassingly parallel problems due to their parallel structure. Other non-graphical uses include the training of neural networks and cryptocurrency mining.
ChipTest was a 1985 chess playing computer built by Feng-hsiung Hsu, Thomas Anantharaman and Murray Campbell at Carnegie Mellon University. It is the predecessor of Deep Thought which in turn evolved into Deep Blue.
Deep Thought was a computer designed to play chess. Deep Thought was initially developed at Carnegie Mellon University and later at IBM. It was second in the line of chess computers developed by Feng-hsiung Hsu, starting with ChipTest and culminating in Deep Blue. In addition to Hsu, the Deep Thought team included Thomas Anantharaman, Mike Browne, Murray Campbell and Andreas Nowatzyk. Deep Thought became the first computer to beat a grandmaster in a regular tournament game when it beat Bent Larsen in 1988, but was easily defeated in both games of a two-game match with Garry Kasparov in 1989 as well as in a correspondence match with Michael Valvo.
In computer graphics, a sprite is a two-dimensional bitmap that is integrated into a larger scene, most often in a 2D video game. Originally, the term sprite referred to fixed-sized objects composited together, by hardware, with a background. Use of the term has since become more general.
Hans Jack Berliner was an American chess player, and was the World Correspondence Chess Champion, from 1965–1968. He was a Grandmaster of Correspondence Chess. Berliner was a Professor of Computer Science at Carnegie Mellon University. He directed the construction of the chess computer HiTech, and was also a published chess writer.
Ossip Samoilovich Bernstein was a French chess player and businessman. He was one of the inaugural recipients of the title International Grandmaster from FIDE in 1950.
Chess was a pioneering chess program from the 1970s, written by Larry Atkin, David Slate and Keith Gorlen at Northwestern University. Chess ran on Control Data Corporation's line of supercomputers. Work on the program began in 1968 while the authors were graduate students at the university. The first competitive version was Chess 2.0 which gradually evolved to Chess 3.6 and was rewritten as the 4.x series. It dominated the first computer chess tournaments, such as the World Computer Chess Championship and ACM's North American Computer Chess Championship. At the ACM event, Chess won eight of the ten tournaments held from 1970 to 1979. NWU Chess adopted several innovative or neglected techniques including bitboard data structures, iterative deepening, transposition tables, and an early form of forward pruning later called futility pruning. The 4.x versions were the first programs to abandon selective search in favor of full-width fixed-depth searching.
Thomas S. Anantharaman is a computer statistician specializing in Bayesian inference approaches for NP-complete problems. He is best known for his work with Feng-hsiung Hsu from 1985 to 1990 on the Chess playing computers ChipTest and Deep Thought at Carnegie Mellon University which led to his 1990 PhD Dissertation: "A Statistical Study of Selective Min-Max Search in Computer Chess". This work was the foundation for the IBM chess-playing computer Deep Blue which beat world champion Garry Kasparov in 1997.
Murray Campbell is a Canadian computer scientist known for being part of the team that created Deep Blue; the first computer to defeat a world chess champion.
Weaver Warren Adams was an American chess master, author, and opening theoretician. His greatest competitive achievement was winning the U.S. Open Championship in 1948. He played in the U.S. Championship five times.
This article documents the progress of significant human–computer chess matches.
Carl Ebeling is an American computer scientist and professor. His recent interests include coarse-grained reconfigurable architectures of integrated circuits.
Harry Lewis Nelson is an American mathematician and computer programmer. He was a member of the team that won the World Computer Chess Championship in 1983 and 1986, and was a co-discoverer of the 27th Mersenne prime in 1979. He also served as editor of the Journal of Recreational Mathematics for five years. Most of his professional career was spent at Lawrence Livermore National Laboratory where he worked with some of the earliest supercomputers. He was particularly noted as one of the world's foremost experts in writing optimized assembly language routines for the Cray-1 and Cray X-MP computers. Nelson had a lifelong interest in puzzles of all types, and founded the MiniMax Game Company, a small venture that helps puzzle inventors to develop and market their products.
Kasparov's Gambit, or simply Gambit, is a chess playing computer program created by Heuristic Software and published by Electronic Arts in 1993 based on Socrates II, the only winner of the North American Computer Chess Championship running on a common microcomputer. It was designed for MS-DOS while Garry Kasparov reigned as world champion, whose involvement and support was its key allure. A Macintosh version was planned to be released in 1995.
Edward William Formanek is an American mathematician and chess player. He is a professor emeritus of mathematics at Pennsylvania State University, and a FIDE International Master in chess.
The history of chess began nearly 1500 years ago, and over the past century and a half the game has changed drastically. No technology or strategy, however, has changed chess as much as the introduction of chess engines. Despite only coming into existence within the previous 70 years, the introduction of chess engines has molded and defined how top chess is played today.