Computer Chess Club Archives

Search

Terms

Messages

Subject: MTD(f) ?

Author: martin fierz

Date: 11:15:06 12/13/00

hi,

after reading the description of mtd(f) it seemed to me that this kind of
algorithm could only work if the whole tree still fits in the hashtable, and
that once it doesnt fit in any more it would get terribly inefficient. is this
right or wrong? are there any chess programs using mtd(f)? i once read that the
most popular search is PVS where the first move gets searched normally and all
others with a minimal window - is this correct?

cheers
  martin

Re: MTD(f) ? Pat King 12:54:32 12/13/00
Re: MTD(f) ? Steve Maughan 12:21:12 12/13/00
Re: MTD(f) ? Djordje Vidanovic 11:58:34 12/13/00
- Correction: Re: MTD(f) ? Djordje Vidanovic 12:02:06 12/13/00
  - Re: SOS too I think NT Côme 13:12:56 12/13/00
    - Yes... Shep 14:47:48 12/13/00
Re: MTD(f) ? Andrew Williams 11:45:13 12/13/00

This page took 0.01 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.