Author: Alessandro Damiani
Date: 12:26:48 12/31/99
Go up one level in this thread
On December 31, 1999 at 11:27:28, Dan Andersson wrote: >Yes, I used it together w. MTD(f), to lessen the number of re-searches. Now I >use a similar method w. MTD(f) based on dynamic criteria that I glean from my >IID search, instead of the 'objective' measure of number of moves. There is an >overhead in generating the number of legal moves in a position. If you do that >in nodes leading to Leaf nodes you will find it slowing your search >considerably, and you can not be certain if they are or not in ABC-Search. > >Regards Dan Andersson If I understand ABC right, there is no fixed horizon. And therefore every node can be a terminal node (no leaf nodes). Did you use a fixed depth in MTD(f) as used by "conventional" search algorithms? Alessandro
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.