Skip to main content
Chess

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

2
  • 5
    Hash tables are most efficient when they avoid collisions - i.e. multiple given inputs map to the same output. You then have an extra level of searching to resolve the collision. I am not a chess programmer but my guess is that as similar positions are likely to occur in the analysis of a given position for efficiency you really want to avoid collisions. But this is a guess, I'll leave it to somebody who has actually programmed this to answer. Commented Dec 12, 2024 at 7:49
  • 3
    It's a bit unclear what "entirely different" actually means. It's a property of many hashing algorithms that very similar inputs yield radically different outputs. But it's not clear if that's what's meant here, or "entirely different" just means "definitely not the same". Commented Dec 13, 2024 at 4:11