Author: Heiner Marxen
Date: 07:45:07 02/08/01
Go up one level in this thread
On February 08, 2001 at 10:09:29, leonid wrote: >On February 08, 2001 at 09:49:16, Pete Galati wrote: > >>On February 08, 2001 at 08:21:44, leonid wrote: >> >>>Hi! >>> >>>If you like to solve easy (not deep) forced mate position, here is the one. >>> >>>[D]Nb1rkrNb/1n1pqp1b/n2qqq1n/1NNNNNNn/2BNNB2/1R2Q1R1/8/2K5 w - - >>> >>>Please, indicate your result. >>> >>>Thanks, >>>Leonid. >> >>Crafty found the mate in 8 a little bit earlier but it had it's hashtables all >>filled up, and I can't operate it at up to 96mb hashtables on my computer, so >>I'm stuck with 48 at the moment. I never get around to mentioning, it's a >>700mhz Celeron. >> >>Pete >> >>5 piece tablebase files found >>1836kb of RAM used for TB indices and decompression tables >>EGTB cache memory = 3M bytes. >>hash table memory = 48M bytes. >>pawn hash table memory = 5M bytes. > >Simply can't detain my curiosity, what is the "pawn hash table"? Special hash >table just for pawns? Yes, for that part of the eval which is based only on the location of all the pawns (pawn structure). >Thanks for detailed decription! Sometime, some very interesting moments come to >light. > >My program found at the same depth mate but I not looked by brute force. It >could be that somebody will come with shorter mate. > >Leonid. I doubt it. Chest says "no mate in 7" after 68.4 minutes. You all found the shortest mate: Congratulations! Heiner
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.