When Kasparov requested that he be allowed to study other games that Deep Blue had played so as to better understand his opponent, IBM refused. The opening library was provided by grandmasters Miguel Illescas, John Fedorowicz and Nick de Firmian. Before the second match, the chess knowledge of the program was fine tuned by grandmaster Joel Benjamin. The endgame database contained many six piece endgames and five or fewer piece positions. In the opening book there were over 4,000 positions and 700,000 grandmaster games. The evaluation function had been split into 8,000 parts, many of them designed for special positions. The optimal values for these parameters were then determined by the system itself, by analyzing thousands of master games. how important is a safe king position compared to a space advantage in the center, etc.). Levy and Newborn estimate that one additional ply increases the playing strength 50 to 70 points (Levy & Newborn 1991:192).Дeep Blue's evaluation function was initially written in a generalized form, with many to-be-determined parameters (e.g. An increase in search depth of one ply corresponds on the average to an increase in playing strength of approximately 80 Elo points. The Deep Blue chess computer which defeated Kasparov in 1997 would typically search to a depth of between six and twelve plies to a maximum of forty plies in some situations. In June 1997, Deep Blue was the 259th most powerful supercomputer, capable of calculating 11.38 gigaflops, although this did not take into account Deep Blue's special-purpose hardware for chess. It was capable of evaluating 200 million positions per second, twice as fast as the 1996 version. Its chess playing program was written in C and ran under the AIX operating system. It was a massively parallel, 30-node, RS/6000, SP-based computer system enhanced with 480 special purpose VLSI chess chips. The system derived its playing strength mainly out of brute force computing power. The name is a play on Deep Thought and Big Blue, IBM's nickname. Hsu joined IBM (Research division) in 1989 and worked with Murray Campbell on parallel computing problems. The project was started as 'ChipTest' at Carnegie Mellon University by Feng-hsiung Hsu the computer system produced was named Deep Thought after the fictional computer of the same name from The Hitchhiker's Guide to the Galaxy. Deep Blue thus became the first computer system to defeat a reigning world champion in a match under standard chess tournament time controls. The match concluded on February 17, 1996.Дeep Blue was then heavily upgraded (unofficially nicknamed 'Deeper Blue') and played Kasparov again in May 1997, winning the six-game rematch 3ВЅвЂ“2ВЅ, ending on May 11, finally ending in game six. However, Kasparov won three games and drew two of the following games, beating Deep Blue by a score of 4вЂ“2. Deep Blue - Kasparov, 1996, Game 1 is a famous chess game. This first win occurred on February 10, 1996. The computer system dubbed 'Deep Blue' was the first machine to win a chess game against a reigning world champion (Garry Kasparov) under regular time controls. Kasparov had won an earlier match against a previous version of Deep Blue in 1996 Kasparov accused IBM of cheating and demanded a rematch, but IBM declined and retired Deep Blue.Дeep Blue succeeded in its goal of winning against a reigning world champion in 1997. On, the machine won a six-game match by two wins to one with three draws against world champion Garry Kasparov. Deep Blue was an IBM created Supercomputer designed to defeat world champion Garry Kasparov.

Who developed deep blue chess game