Author: Sune Fischer
Date: 16:02:24 10/17/04
Go up one level in this thread
On October 17, 2004 at 10:18:52, Stuart Cracraft wrote: >>Hi, >> >>I think bitboards generate move faster especially capture moves. But it's slower >>in makemove() and unmakemove() because it has to update a lot of data. >>However, you can do a lot of tricks with bitboards in eval(). So,if you want to >>compare the two methods, you 've to compare the performance not only speed of >>movegen(). >> >>Regards, >>Teerapong > >Movegen is not the issue with bitboards. >In fact, it is a drawback. I doubt it. I can't remember ever seeing a non-bitboard engine be faster than a bitboarder in incremental generation. Most of those with old-style generators dare not even try it because they know it's so expensive for them. OTOH, I agree with TEERAPONG TOVIRAT that the makemove might be slower due to extra work on the rotated boards. > Much harder to implement >movegen with bitboards than with 0x88 or mailbox. Initially yes but I think it pays off later. -S.
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.