Author: Alessandro Scotti
Date: 16:43:35 09/05/04
Go up one level in this thread
On September 05, 2004 at 17:39:03, Uri Blass wrote: >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. > >So maybe you should change the policy and decide that shorter mate is better >and only if you have not already mate then deeper is better. Yeah... that's what I did! :-) But I did that by giving mate scores a "virtual depth" so that the "deeper is better" concept doesn't have to be changed...
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.