Author: Russell Reagan
Date: 17:24:44 03/25/03
Go up one level in this thread
On March 25, 2003 at 17:30:52, martin fierz wrote: >i once heard that it was possible to compute a win/loss/draw endgame database >using only 1 bit per position as opposed to 2 bits as i was using up to now (and >like in the chinook paper). I know nothing, but here goes :) I suppose you could use 1-bit per position using assumptions. For instance, you could assume that a 1-bit is a win, a 0-bit is a loss, and everything else is a draw. I'm not sure how you would implement this in practice though. Seems like indexing would be awkward, difficult, or impossible.
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.