Author: Daniel Clausen
Date: 08:12:17 10/16/03
Go up one level in this thread
On October 16, 2003 at 11:03:45, Uri Blass wrote: [snip] >>in my last 50 tournament games i didn't have a single one of these endgames you >>mention. i can't imgaine that tablebases make a 50 elo difference. KBBK is >>practically trivial, even without tablebases! >> >>cheers >> martin > >I guess that KBBK can be solved only by piece square table program but I did not >test it. > >KQKR is also easy for computers without tablebases when you have the right >knowledge. > >Uri I guess the only significant advantage of TBs in an engine with weak endgame eval are pawn-endgames. At least that's the case with my old engine and a _trivial_ endgame eval. (and I mean trivial..) Of course it depends on how you fine-tune the probing. (do you probe even in qsearch or just when remaining depth is X - can make a huge difference NPS-wise) Sargon
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.