1994-04-04 - How Many Games of Chess: Exact answer given!

Header Data

From: collins@newton.apple.com (Scott Collins)
To: Jim choate <ravage@bga.com>
Message Hash: 8f89caa2ad1a54144f50113b976d79a4667604848724afe68c7fe046f2028767
Message ID: <9404041923.AA21272@newton.apple.com>
Reply To: N/A
UTC Datetime: 1994-04-04 20:49:57 UTC
Raw Date: Mon, 4 Apr 94 13:49:57 PDT

Raw message

From: collins@newton.apple.com (Scott Collins)
Date: Mon, 4 Apr 94 13:49:57 PDT
To: Jim choate <ravage@bga.com>
Subject: How Many Games of Chess: Exact answer given!
Message-ID: <9404041923.AA21272@newton.apple.com>
MIME-Version: 1.0
Content-Type: text/plain


Based on new information I have at last answered the question of `How many
games of Chess' with finality.  Here is the quote that woke me up to the
reality of this problem in combinatorics.

Jim choate writes:
  >The fact is that the end game is what defines a game of chess and
  >not the infinitude of possible paths between the first and last move.


The natural conclusion is that the complexity of the problem depends on how
much of the game you consider to be the `endgame'.  Thus, the actual number
of different chess games: 5

 2) White mates
 1) Black resigns
 0) Stalemate
-1) White resigns
-2) Black mates

Happily, this agrees with observed behavior.  In fact, this is the way
posterity remembers them, e.g., "Oh, yes, Spasky won." ;-)


Scott Collins   | "That's not fair!"                         -- Sarah
                | "You say that so often.  I wonder what your basis
   408.862.0540 |  for comparison is."                 -- Goblin King
................|....................................................
BUSINESS.    fax:974.6094    R254(IL5-2N)    collins@newton.apple.com
Apple Computer, Inc.  5 Infinite Loop, MS 305-2D  Cupertino, CA 95014
.....................................................................
PERSONAL.    408.257.1746       1024:669687       catalyst@netcom.com







Thread