Author: Paul
Date: 14:51:31 11/12/01
Go up one level in this thread
On November 12, 2001 at 17:35:51, Dieter Buerssner wrote: >On November 12, 2001 at 17:04:40, Dan Andersson wrote: > >>In `Scalable Search in Computer Chess' by Ernst A. Heinz he manages to squeeze >3 and 4 pieces into 15 Mb. Recommended reading! Chapter 6. > >Unfortunately, I don't have it (yet). Could you give an hint, how he gets about >a factor of 2? Or was my estimation wrong? > >I can see, say for pawnless: > >462 * 62 * 61 compared to 10 * 64^3. But this is only a factor of 1.5. >What else can be done? > >Regards, >Dieter He uses what he calls 'knowledgeable encoding'. Compressed tables combined with knowlegde. So he doesn't encode all tables, but instead uses knowledge rules for some of them like KBK, KNK, KBKB, etc ... that are drawn, or KBBK, KQBK, etc ... that are won. Paul
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.