Nothing Special   »   [go: up one dir, main page]

skip to main content
article
Free access

The 20th annual ACM North American computer chess championship

Published: 01 July 1990 Publication History

Abstract

Despite entering ranked almost a class above the field, a last-round loss forced DEEP THOUGHT to settle for a first-place tie with HITECH at the 20th Annual ACM North American Computer Chess Championship. The five-round Swiss-style tournament was held November 12-15 at Bally's-Reno in conjunction with Supercomputing '89. It marked the twentieth consecutive year that ACM has organized this major chess event. Until 1988, the tournament took place at the Annual ACM Conferences. In 1988 and again this year, however, the event was hosted by the joint ACM SIGARCH/IEEE Computer Society Supercomputing Conference. Ten teams participated in the strongest computer chess tournament in history. Every program was playing at least at the Expert level.
This year's tournament offered $5000 in prizes. HITECH and DEEP THOUGHT's programmers each won $2000 for their first-place tie while MEPHISTO X and BEBE's programmers split the $1000 third-place prize. In addition to the cash prizes, trophies were awarded to the first three finishers. A special trophy was given to MEPHISTO X as the “Best Small Computing System.”
A Technical Session chaired by Tony Marsland was held during the championship. The topic of the session was endgame play by computers. Once upon a time computers played the endgame particularly badly, but this is no longer the case. The session considered some of the improvements and some of the problems that remain.
David Levy served as Tournament Director, returning after a layoff of almost a decade. He served as TD for the first time in 1971, continuing into the early 1980s when his own programs began to compete. Levy will take on DEEP THOUGHT in London in a four-game match in December.* In 1978, he won a bet made in 1968 that no computer would defeat him during the following ten years. This time he appears to be the underdog.
Attending the championship as an Honored Guest was Ben Mittman. Mittman was head of Northwestern University's Vogelback Computing Center during the years that Slate, Atkin, and Gorlen's programs dominated the ACM events. Some give him credit for being Northwestern University's greatest and most successful “coach.” From 1971 through 1983, Ben also was involved in the organization of the tournaments, From 1977 through 1983, Ben served as the first president of the International Computer Chess Association. He was also the first editor of what is now called the ICCA Journal, the main journal for technical papers on computer chess.
This year the championship is scheduled to be a part of Supercomputing '90 in New York City on November 11-14. The 1990 event will see the first major change in the tournament rules. For the last 20 years, the rules have specified that each player is given two hours to make the first 40 moves and an additional hour for each 20 moves thereafter. Games frequently lasted more than six hours. This year, each computer will be required to make all its moves in two hours, thus guaranteeing that no game will last more than four hours. In addition to the main championship, a special endgame tournament will be held testing the programs' abilities in this special part of the game. For the first time at Supercomputing '90, all games will be played during the day beginning at 1:OO p.m.—except for one 7:00 p.m. Sunday evening game on the 11th. The event will be a five-round Swiss-style tournament. For information contact Professor Monty Newborn, School of Computer Science, McGill University, 3480 University Street, Montreal, Quebec, Canada, H3A. 2A7.

Cited By

View all
  • (2024)Hans Berliner: A life in chess, computer chess and much moreICGA Journal10.3233/ICG-23023345:2-3(45-54)Online publication date: 8-Jan-2024
  • (2008)Discovery of High-Level Behavior From Observation of Human Performance in a Strategic GameIEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics10.1109/TSMCB.2008.92206238:3(855-874)Online publication date: 1-Jun-2008
  • (2003)Knowledge-Based Search in Competitive DomainsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2003.119840215:3(734-743)Online publication date: 1-Mar-2003
  • Show More Cited By

Recommendations

Reviews

John A. Campbell

The emphasis in this report of the 1989 ACM computer chess championship is on the details of the best or most interesting chess games rather than on details of computing. These games display an impressive standard: the joint winners, and the only other program to beat either of them in the competition, all have ratings comfortably above the minimum for the USCF Chess Master label. The evidence of the games is that programs with similar ratings can have very dissimilar strengths and weaknesses, so plenty of room remains for development. The winners seem to score over the field by using special-purpose hardware added to the single or grouped scientific workstations that run them, by inspecting more positions per second than their rivals, and often by having larger books of standard sequences of moves. Hence the lessons of computer chess for computing in general are apparently concentrated in the design of hardware to solve special problems. The paper does not give any specifics; neither does it suggest that work on the best current chess programs holds any further interesting lessons for people other than those who have been directly involved in designing and building the programs and the hardware.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Communications of the ACM
Communications of the ACM  Volume 33, Issue 7
July 1990
114 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/79204
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1990
Published in CACM Volume 33, Issue 7

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)60
  • Downloads (Last 6 weeks)8
Reflects downloads up to 16 Nov 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media