Author: Omid David Tabibi
Date: 14:09:42 09/12/03
Go up one level in this thread
On September 12, 2003 at 17:00:25, Gian-Carlo Pascutto wrote: >On September 12, 2003 at 16:53:44, Omid David Tabibi wrote: > >>assuming 'table_size' is a power of 2, the following two expressions are >>equivalent: >> >>address = key % table_size; >>address = key & (table_size - 1); > >That's exactly the problem. He generates his hashkeys by >taking the differnce of the white and black pawn bitboard. > >If you 'AND' off a piece of that, you're just cutting out a part >of your board - with massive hash collisions as a result. Why use bitboards to generate hash keys then, when you have such a simple and fast implementation with zobrist keys? > >You want something more nonlinear. You want something more simple. In most cases simplicity also means speed :) > >-- >GCP
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.