Author: Sune Fischer
Date: 02:09:14 12/17/02
Go up one level in this thread
On December 17, 2002 at 04:53:10, Uri Blass wrote: > >I see no contradiction. >You need to evaluate if a pawn is a passed pawn also when there is no >information in the hash tables so the question if there is a fast way to do it >by bitboard is still relevant. I always keep my pawn hash updated. If I don't get a hit when I need it, I do the pawn evaluation and return the pointer to the element. >At long time control it may be unimportant but at least for blitz it may be >important. > >I also need first to evaluate pawn structure(today I only evaluate double pawns) >and the question if to try to use bitboards is relevant. I ask a lot of atomic questions like: is the pawn isolated? is the pawn doubled? is the pawn protected? is the pawn backwards? is the pawn on semiopen file? (= passed or semipassed pawn) Then I add scores for different combinations of these answers. The problem is the non linearity between the terms. Ie. a protected passed pawn is probably stronger than a protected non-passed and a non-protected passed pawn, so one cannot just add scores directly (IMO). -S. >Uri > >Uri >Uri
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.