Author: Tom Kerrigan
Date: 15:58:00 02/13/00
Go up one level in this thread
On February 13, 2000 at 17:32:33, Dan Newman wrote: >I've wondered about this. In isolation (which is usually when I end up >bloating my move generator like this) it's certainly faster to unroll loops, >etc., but once you get a bunch of other things put in this could of course >be a problem. But whenever I fiddle around with this code, it just tends to >get slower... I just looked at the .obj for the move generator and it's >14k and make/unmake is 16k (for the 0x88). For the bitboard engine these >are even larger: 22k and 34 k resp. They are in fact the largest modules >in the program with search coming in a close third... Yeah, unrolling loops can be good and bad. But in the code you posted, you unrolled a loop at the expense of a switch statement. I don't think this is a very good tradeoff. If you keep the entries in your piece list in order, you can possibly avoid the switch statement. Although this involves more code bloat. -Tom
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.