1994-04-01 - Re: How Many Games of Chess?

Header Data

From: Jim Gillogly <jim@rand.org>
To: cypherpunks@toad.com
Message Hash: e870edc565920b26a5607070b6afc600fd05d018aaf459e3ac1b4dedac81a482
Message ID: <9404011931.AA21860@mycroft.rand.org>
Reply To: <199404011906.LAA28894@math.berkeley.edu>
UTC Datetime: 1994-04-01 19:31:28 UTC
Raw Date: Fri, 1 Apr 94 11:31:28 PST

Raw message

From: Jim Gillogly <jim@rand.org>
Date: Fri, 1 Apr 94 11:31:28 PST
To: cypherpunks@toad.com
Subject: Re: How Many Games of Chess?
In-Reply-To: <199404011906.LAA28894@math.berkeley.edu>
Message-ID: <9404011931.AA21860@mycroft.rand.org>
MIME-Version: 1.0
Content-Type: text/plain

I was hoping this thread would die quickly, since it's wildly off-topic.
However... the tightest bound on the number of different positions (more
interesting to us (former) chess programmers than different games) that
I've seen is about 2.3 * 10^49, due to Tim W. Smith in 1991.  Previously
we were seeing numbers like 10^120.  Smith used Huffman-like position
codes to demonstrate the bound.

I strongly suggest the discussion move off to rec.games.chess, where the
question comes up frequently.

	Jim Gillogly
	10 Astron S.R. 1994, 19:30