Author: Andrzej Nagorko
Date: 00:46:50 01/06/01
Go up one level in this thread
On January 05, 2001 at 17:42:49, Gian-Carlo Pascutto wrote: >On January 05, 2001 at 14:41:51, David Rasmussen wrote: > >>I was wondering why some of the clever ideas I've been reading about, aren't >>used in the programs I know of. >> >>ETC, Enhanced Transposition Cutoff, seems like a very good idea and have been >>tested to perform well in practice. Why isn't it used? > >The overhead to generate all moves at each node, and make/unmake/probe >them all is too great in most highly optimized chessprograms as compared >to the benefits. There is no need to do make/unmake, all you need is to calculate hash signature of position after every move. So you don't have to unmake() and only run small part of make(). Of course, it is still overhead, so you may use ETC only few plies near the root. If memory serves me well, Ed Schroeder once hinted that he uses ETC in two first plies of search. Andrzej >Of course each program is different, so you need to experiment. > >-- >GCP
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.