Author: Robert Hyatt
Date: 15:05:04 01/20/03
Go up one level in this thread
On January 20, 2003 at 15:28:04, Eiko Bleicher wrote: >On January 20, 2003 at 15:23:02, Robert Hyatt wrote: > >>On January 20, 2003 at 13:11:48, Eiko Bleicher wrote: >> >>>Hi, >>> >>>AFAIK the endgame tablebases like the Nalimov Tablebases use one byte per >>>position. Thus, the max. length results in somewhere about 126 moves to win / >>>loose. >>> >>>Now the question is this: How do these databases handle the positions that are >>>mate in 130 or 140 or .... >>> >>>Any help would be greatly appreciated. >>> >>>Eiko >> >> >>you go to more bits per entry. :) > >But does anybody really do that today? Yes.. you have no choice...
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.