Author: Stuart Cracraft
Date: 09:04:41 07/28/04
So in looking at ETC and implementing it (without much benefit I might add, in a PVS/NEGASCOUT search), I thought a little more and perhaps have a complete misunderstanding of it, hence the implementation. Am reconsidering it for a recent MTD(f) implementation that is at parity with the PVS/NEGASCOUT with very little work. From what I have read, ETC is a check prior to search() in the main search of all child positions hashkeys after each child makemove(). If any exist in the hash table and have length >= current depth and provide a cutoff, then skip searching all the children. Is that about it? Stuart P.S. The word I've heard in another thread is that ETC can help MTD(f) more than it can help PVS/NEGASCOUT... my MTD(f) uses a fairly well-debugged PVS/NEGASCOUT, so I don't know what will happen with ETC but want to try it out (again) as long as my understanding of it (see above) isn't flawed.
This page took 0.03 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.