Author: David Rasmussen
Date: 07:40:03 12/03/00
Most freely available sourcecode I've seen, implements hashtables in the manner
of Crafty. That is, the a hashed record is a struct with some integers, which
are treated at bit level to manage the necesary information. I do that too. But
why aren't people just using the bitfield ability of C to do this?
I mean
struct HashRecord {
int draft:6;
int threat:1;
etc.
};
Is this always slower? It should be pretty easy for a compiler to do exactly
what, say, Crafty, is doing when reading and writing to such a structure.
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.