Computer Chess Club Archives

Search

Messages

Subject: Re: Storing mates in the hash table

Author: Michael Henderson

Date: 20:16:30 09/05/04

Go up one level in this thread

On September 05, 2004 at 17:32:57, Alessandro Scotti wrote:

>On September 05, 2004 at 03:24:56, Michael Henderson wrote:
>
>>How was 6...Bxg1 possibly stored as the best move at that node? Once you search
>>all the moves, to whatever depth, the best move Qh4# is stored along with score
>>returned.  Is this something characteristic of MTD(f)?
>
>It was stored there because it was explored deeper. The search returned Qh4# as
>the best move, but then it wasn't stored in the hash table because the
>replacement policy (deeper is better) preferred the entry that was already
>there.

In MTD(f) all searches use null window? If that is true how is it possible to
get an exact score/move stored in hash table?

• Re: Storing mates in the hash table Robert Hyatt 07:17:08 09/07/04
  • Re: Storing mates in the hash table Michael Henderson 11:38:10 09/07/04
    • Re: Storing mates in the hash table Robert Hyatt 12:35:47 09/07/04

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.