Author: José de Jesús García Ruvalcaba
Date: 11:33:14 02/14/00
Go up one level in this thread
On February 12, 2000 at 20:03:44, Dan Newman wrote: >On February 12, 2000 at 15:21:20, Tom Kerrigan wrote: > >>On February 12, 2000 at 13:17:48, KarinsDad wrote: >> >>>I think the issue may be one of degree. If a program got modified from >>>non-bitmap to bitmap (which would probably be a lot of work since so many >>>elements of a chess program are dependent on each other), it may increase in >>>speed by 10% to 20% (maybe). And, this may correspond to a 7 to 18 ELO >> >>I doubt that bitmap programs are inherently faster than everything else. >> > >Well, there may be something no one's thought of yet (or perhaps hasn't >revealed) that's faster than bitboard, piece list, etc. In fact I have one >oddball scheme (that I'd like to try again sometime) that really screams on >capture generation. The problem is it has the slowest make()/unmake() that >I've ever tried... > [big snip] >-Dan. You can get rid of the unmake part. If it is a lot faster on anything else, but very slow on make/unmake, it makes sense. José.
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.