Author: Russell Reagan
Date: 12:20:15 11/19/02
Go up one level in this thread
On November 19, 2002 at 15:14:26, Gian-Carlo Pascutto wrote: >On November 19, 2002 at 15:12:15, Russell Reagan wrote: > >>On November 19, 2002 at 13:57:02, Vincent Diepeveen wrote: >> >>>Yet a crucial aspect of evaluating is scanning and that's something >>>where bitboards are handicapped with 1 or 2 exceptions (you can >>>quickly scan a rank or file for presence of a piece X). >> >>In an 0x88 engine, you have to do potentially 8 tests to scan for the presence >>of a piece on a rank or file. > >No... Nice "proof". >And moreover, it always helps to give an example what you would >want to evaluate, because there are always multiples ways to work >around slower parts. Then maybe Vincent will give us one to backup his claim.
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.