Author: Dann Corbit
Date: 14:05:55 04/17/00
Go up one level in this thread
On April 17, 2000 at 17:00:05, Andrew Dados wrote: >On April 17, 2000 at 16:21:09, Dann Corbit wrote: > >[snipped] > >>Fascinating approach that does not use 64 bit bitboards, and yet hits 100-300K >>NPS when analyzing on a wimpy PII 300 MHz. > >Should I understand you think bitmaps are faster then other approaches from the >above? IMO representation does not matter much (especially on 32bit processor). > >Implementation matters though...:) I only understand the implementations that I have seen. Of all that I have had a chance to peruse the source code, the 64 bit bitboard approaches have totally dominated the other methods in NPS (usually by a factor of 2-4 even for the best programs, Phalanx being the fastest Non-bitboard engine I had examined up till G2). I had pretty well bought into the idea that to make a really fast engine, 64 bit bitboards would be a necessity.
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.