Author: Bernhard Bauer
Date: 05:45:48 09/22/05
Go up one level in this thread
On September 22, 2005 at 08:01:47, Richard Pijl wrote: >On September 22, 2005 at 07:48:46, Bernhard Bauer wrote: > >>On September 22, 2005 at 05:50:08, Renze Steenhuisen wrote: >> >>>On September 22, 2005 at 05:39:07, Mahesh Jeswin wrote: >>> >>>>Only Fruit 2.1 seems to find the draw in this position without egtb. >>>>Any other engine comes close to finding the draw ? >>>> >>>>[D] 7k/7P/8/6N1/7K/8/8/8 w - - 0 1 >>> >>>Personally I find this case irrelevant because EGTBs exist, and it is cheap to >>>load all 3 and 4men EGTBs in memory. Anyways, good work! >>> >>>Cheers, >>> >>>Renze >> >>Yace uses bitbases. They take 52.268.536 Bytes and are loaded to memory. >>So Yace is incredible fast at some endgames. >> >>BTW, what can be found at this position? >>There is no win and white cannot loose. >>Why must a program give a score of 0.000? >>Kind regards >>Bernhard > >The position is not important as a root position, so searching here is >irrelevant. >However, the static evaluation is more interesting as you can encounter this >case in search. I rather have two pawns (on separate files) than a knight and a >rookpawn. So evaluating this position with +5 or so won't help in finding a >winning continuation in a number of positions. >Richard. >Richard. I'd rather had a knight and a rook pawn not advanced to the 7-rank than two pawns on separate files. -:) Kind regards Bernhard
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.