Author: Uri Blass
Date: 01:53:10 12/17/02
Go up one level in this thread
On December 17, 2002 at 04:34:47, Gian-Carlo Pascutto wrote: >On December 17, 2002 at 04:27:48, JW de Kort wrote: > >>I found out that by bitboard it is far easier and quicker to check >>whether a pawn is passed or not but i think this is commom knowledge. > >If I read this statement, I'm lead to believe pawn evaluation >hashing is going to be more productive in speeding up your >program than bitboards are. > >-- >GCP 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. 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. 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.