Author: Duncan Roberts
Date: 16:13:03 01/25/05
Go up one level in this thread
snip >There are things that can reduce the piece on board placements, like king >placement, etc. Uri Blass wrote a program that calculated 3.70106e+046 distinct >board postions (so you would need 155 bits to encode a chess position.) > >But you can also reduce that value by 4 via reflection and color reversal giving >153 bits. > >If we did a proof search, maybe we only need 2 bits per position, and we use the >actual positions as a 153 bit number index (so we never store the positions >anywhere -- the only value of the position is to give us the address of the >answer in the crystal). > >At any rate, I calculate the crystal as 100,000 KM on an edge. >That's a lot of crystal. >What's that -- about the volume of Jupiter? based on a radius for jupiter 71,492 kilometers: 4/3* 22/7 *71,492 ^3 = 1.53121E+15. so sounds about right, so unless moore's law continues working on hard disk capacity for some time, there might be a problem. duncan
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.