Computer Chess Club Archives

Search

Messages

Subject: Re: Efficient hash algorithm?

Author: William H Rogers

Date: 07:11:05 09/22/98

Go up one level in this thread

Hash tables are used mostly in two instances: 1. for opening books moves as is
saves time calculation your initial responses to game openings; and 2. for end
game calculations. That is, when you reach a certain material value i.e. "small"
then you start hashing the chess board so you can store winning moves leading to
checkmate, or stalemate if no other option is available.
It must be stated though, that many programs keep opening books to a depth of 15
to 20 moves deep. In theory a complete game could be stored this way, thus
eliminating a chess engine completely, and that is not what I call CHESS!
All of this pre-supposes that every player makes the best move possible in every
game.

• Re: Efficient hash algorithm? Serge Desmarais 20:45:58 09/27/98
  • Re: Efficient hash algorithm? Dave Gomboc 22:33:01 09/27/98
    • Re: Efficient hash algorithm? Dave Gomboc 22:35:45 09/27/98
      • Re: Efficient hash algorithm? Danniel Corbit 09:47:01 09/28/98
        • Re: Efficient hash algorithm? Danniel Corbit 11:36:17 09/28/98

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.