Author: Alexander Kure
Date: 00:52:43 11/13/99
Go up one level in this thread
On November 12, 1999 at 20:24:29, James Robertson wrote: >I was wondering if it is a good idea to probe the tablebases in the qsearch. Is >this a smart thing to do? > >James This is exactly what Nimzo 7.32 already does. All 3 and 4 piece endings have been converted from Nalimov into a special format (NCD - Nimzo compressed data), where only the information of win, draw or loosing for each position is stored (needs only 2 bits per position). At startup these endings are loaded into memory (requiring app. 11 MB for all 3 and 4 piece egtbs) and probed in the q-search, which is faster than calling the evaluation function! There are also some 5 piece endgames supported, namely: KPPKX (X is a piece or a pawn) KXPKX But some of them require between 40-100 MB, so you need much memory (at least 256 MB) to use them! In Paderborn we played with 1 GB memory using nearly all of them ;-) Greetings Alex
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.