Author: John Scalo

Date: 14:57:13 01/08/98

Reviewing the bottlenecks in my program, I realize that my hash key algorithm is fairly inefficient. It uses the Zobrist algorithm for creating keys from relatively large structures like an [8][8] array, but it's too slow. I would think that having bitboards of white's and black's pieces would be sufficient to come up with a 32-bit key quickly, but I haven't been able to come up with anything that gives a "random" enough distribution. Any ideas? I looked at Crafty but couldn't figure out exactly what it was doing. Thanks,

- Re: Fast hash algorithm
**Robert Hyatt***16:51:44 01/08/98*- Re: Fast hash algorithm
**John Scalo***17:04:22 01/08/98*- Re: Fast hash algorithm
**Don Dailey***18:43:46 01/08/98*- Re: Fast hash algorithm
**Robert Hyatt***06:38:55 01/09/98*

- Re: Fast hash algorithm

- Re: Fast hash algorithm

- Re: Fast hash algorithm

This page took 0.06 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.