Author: Álvaro Begué
Date: 20:44:31 01/02/06
Go up one level in this thread
On January 02, 2006 at 15:16:08, Greg Simpson wrote: >So is it possible to store the results for 2^157 positions? For win/lose/draw >we need 1.58 bits per position. Actually, you can do much better than that. If you do a quiescence search with some reasonable evaluation function (say, material difference) and the result is that white is up 9 pawns, the fact that this position is won for white carries far less than 1.58 bits, and a good representation could know about this.
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.