You measured that on Crafty? I am just relaying what Bob reported, not so very long ago. Even then, 10% speedup, basically for free, is a very good deal.

You should not compare the time-to-depth between using a hash table and using no hash table at all, but between hash table and a hash table of ...

No, I don't, because my hash tables in general work in a different way. The number of probes is limited, usually to 3. In micro-Max it is even limited to 1. As the access scheme for probing and storing is the same, the position you are seeking can only be in this limited set of slots that you probe ...

I recently got around to adding a Hash Table to a program I am writing from scratch. The program is still slow in terms of time to depth, but the nodes/second is decent. I only use the hash table right now for transposition spotting. It does not use the stored best move in any way yet (although it ...

I can't find the question I posted here yesterday, despite the fact the subject summary area shows my sign-on name as having posted the most recent query. Any ideas?

Hello fellow programmers,

I have hunted around for the quintessential description of how to best implement hash tables, and, as you can imagine, the number of different implementations is about as numerous as the stars in the sky. I think it would be great if those who already have flawless ...