Author: Dann Corbit
Date: 12:36:01 10/22/99
Go up one level in this thread
On October 22, 1999 at 13:43:47, KarinsDad wrote: >Of course. > >However, you already have real, provable limits which are no different than mine >with the exception of magnitude. > > 1 side to move > 64 bitboard >128 4 bits per piece/state > >= 193 bits Not terribly interesting. That implies: 1.25542e58 as a limit to the board positions. Though I have seen higher limits than this, I have often seen 10^50th as an estimate to the number of board positions. Since this number is 100 million times as large, it's not exactly exciting. >And, of course, there are other well known algorithms that can get you lower >(your 179 algorithm for example). > >I think without some form of "super super" computer to calculate them all, we >will never know the exact number and if you read that AI article that was posted >last week, you may not want to have "super super" computers around. The 161 bits is interesting because 10^42 has been conjectured, and 10^50th is now blown out of the water. This is a proof that it is no larger than ~10^42. I have never seen such a proof before. Every bit reduced cuts in half the number of possibilities. That's a lot of information!
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.