Computer Chess Club Archives

Search

Terms

Messages

Subject: Hash collisions with deep searches

Author: Dann Corbit

Date: 13:50:32 12/19/02

Suppose that we are searching at long time control, and the hash table rapidly
fills up.  This can throw move ordering in the toilet, if we can't find
transpositions any more.

What sort of replacement scheme is best for very long searches (several
minutes)?

Re: Hash collisions with deep searches Vincent Diepeveen 08:01:25 12/20/02
Re: Hash collisions with deep searches Gerd Isenberg 02:40:35 12/20/02
- Re: Hash collisions with deep searches Walter Faxon 19:05:14 12/20/02
  - Re: Hash collisions with deep searches Vincent Diepeveen 10:57:09 12/21/02
    - Re: Hash collisions with deep searches Frank Phillips 03:44:04 12/22/02
      - Re: Hash collisions with deep searches Vincent Diepeveen 10:56:17 12/23/02
        
        Re: Hash collisions with deep searches Robert Hyatt 21:52:51 12/23/02
      - Re: Hash collisions with deep searches Robert Hyatt 18:29:07 12/22/02
        
        Re: Hash collisions with deep searches Frank Phillips 01:25:22 12/23/02
        
        Re: Hash collisions with deep searches Robert Hyatt 09:04:03 12/23/02
        
        Re: Hash collisions with deep searches Frank Phillips 09:29:38 12/23/02
        
        Re: Hash collisions with deep searches Robert Hyatt 17:12:14 12/23/02
Re: Hash collisions with deep searches Robert Hyatt 14:30:23 12/19/02
Re: Hash collisions with deep searches Joshua Haglund 14:22:15 12/19/02
- Re: Hash collisions with deep searches Robert Hyatt 14:31:36 12/19/02
  - Re: Hash collisions with deep searches Joshua Haglund 14:36:22 12/19/02
    - Re: Hash collisions with deep searches Robert Hyatt 15:13:08 12/19/02

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.