Author: David Rasmussen
Date: 04:08:33 01/08/01
Go up one level in this thread
On January 08, 2001 at 04:07:56, Jouni Uski wrote: >2. When we have 6 250 000 entries in hash, isn't it taking very long time to >find if position is there?! > The very idea of a hashtable (which is not a computer chess invention), is to map in constant time, regardless of the size of the map. A transposition table could be implemented as a linked-list, a stack, a binary tree, a red-black tree, a fibonacci heap, a hashtable etc. You choose the datastructure yourself, all you want is a map from positions to traditional computer chess hashentries. The reason that the hashtable is used, is precisely because it has great features for its purpose here: it has (amortisized) constant time complexity in both read and write operations.
This page took 0.01 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.