Monty Newborn

Deep Blue's contribution to AI

Deep Blues defeat of World Chess Champion Garry Kasparov in 1997 marked one of the great accomplishments in artificial intelligence during the previous century. It was the result of work by thousands of researchers beginning in the late 1950s and of the great support given to the project by IBM during the final decade of the century. The achievement suggests great progress can be expected in other related AI problems in this current century.

Octopus: Combining Learning and Parallel Search

Abstract This paper presents Octopus, an automated theorem-proving system that combines learning and parallel search. The learning technique involves proving a simpler version of a given theorem and then using what it has learned to prove the given theorem. As of January 2004 Octopus had successfully proved 43 of the 1.0-rated theorems of the TPTP Problem Library.

The 22d annual ACM international computer chess championship

D E E P T H O U G H T II coasted th rough five rounds of play at the 22d Annua l A C M Internat ional C o m p u t e r Chess Championsh ip , capturing first place with a perfect 5-0 score. The five round Swiss-style tournament was held in Albuquerque, New Mexico at the Doubletree Hotel. Twelve teams participated with all but two teams playing clearly at the level of chess masters. Finishing in second place with a 4-1 score was M CHESS, which received the award for best small computer ; while CRAY B L I T Z and M E P H I S T O tied for third place with 3-2 scores.

Deep Blue Establishes Historic Landmark

8,000 in prizes were distr ibuted with

Competitive Semantic Tree Theorem Prover with Resolutions

4,000 going to the winner.

The 21st ACM North American computer chess championship

On May 11, 1997, IBM’s Deep Blue stunned the world when it defeated the best human chess player – possibly the best human chess player ever! – on planet Earth, Garry Kasparov, in the final game of their six-game Rematch, thereby winning the match by a 3.5–2.5 score. The victory gave Deep Blue the right to call itself the world’s best chess player. But was the claim legitimate? Was Deep Blue really better than Kasparov? Was the victory a one-time fluke? Would Kasparov – or one of his kind – set the record straight in the coming months or years? We’ll see in the following chapters. But first, let’s review Deep Blue’s two matches with Kasparov beginning with its victory in the Rematch.

Hybrid local search approximation algorithm for solving the capacitated Max-K-cut problem

Semantic trees have often been used as a theoretical tool for showing the unsatisfiability of clauses in first-order predicate logic. Their practicality has been overshadowed, however, by other strategies.

Results of the nineteenth ACM North American computer chess championship

After twenty years of traveling from city to city across the United States, the ACM North American Computer Chess Championship came back to the place of its birth, the New York Hilton Hotel, where the competitions began in 1970. This latest five-round event ended in a two-way tie for first place between MEPHISTO and DEEP THOUGHT/88. Finishing in a two-way tie for third place were HITECH and M CHESS. A total of 10 teams participated, and the level of play was at the low grandmaster level. A special three-round end-game championship was won by MEPHISTO, who also captured the prize for the best Small Computing System. A total of

Results of ACM's eighteenth computer chess championship

8000 in prizes was divided up among the winners.

Computer Chess Endgame Play With Pawns: Then and Now

In this article we propose a new hybrid local search approximation algorithm for solving the capacitated Max-k-cut problem and contrast its performance with two local search approximation algorithms. The first of which uses a swapping neighborhood search technique, whereas the second algorithm uses a vertex movement method. We analyze the behavior of the three algorithms with respect to running time complexity, number of iterations performed and the total weight sum of the cut edges. The experimental results show that our proposed hybrid algorithm outperforms its rivals at all levels.