Author: Dann Corbit
Date: 09:26:46 01/24/05
Go up one level in this thread
On January 24, 2005 at 12:03:08, Duncan Roberts wrote: >On January 24, 2005 at 11:53:38, Dann Corbit wrote: > >>On January 22, 2005 at 14:59:49, Duncan Roberts wrote: >> >>>On January 21, 2005 at 22:50:08, Dann Corbit wrote: >>> >>>>http://www.chessbase.com/newsdetail.asp?newsid=1558 >>> >>> >>>I assume you know this. >>>http://www.chessbase.com/newsdetail.asp?newsid=1563 >>> >>>btw you once said it may be possible to solve chess with 50 ? acres of hard >>>drive. ? (possible one or 2 other caveats as well) >> >>It was 50,000 acres of a special crystal that will hold a terrabyte per square >>centimeter. And I assumed that you could solve chess with the square root of >>the number of possible positions in a perfectly ordered tree, but I think that >>conjecture is faulty. It might require the square of that (so 50,000*50,000 >>acres). > >this is new to me, why do you now consider you can no longer use the square root >of the number of possible positions in a perfectly ordered tree ? What is in the tree? That was my problem. While I certainly maintain that you will need less than every possible chess position (~10^47 positions or so) how much less is an open question. It is because the tree holds the results of a search of the root position. If you look at the actual chess tree, it is enormously redundant (e.g. in the full solution tree, it is not unlikely that in many instances the same position will occur quadrillions of times). That is something I had not considered carefully. Now, the actual storage of the tree will use a hash table, like we do now, which reduces the redundancy, but not completely. I think it goes without saying that you will never need to store more than all the positions that exist. But due to the stupendous redundancy of the tree, the square root of *that* tree [the search tree] is still very large. And which positions (out of the list of all that are possible) that will never need to be searched is really an open question. Probably everyone will think I am crazy, but even at that I expect to live to see chess solved.
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.