Author: Sune Fischer
Date: 12:45:52 08/02/03
Go up one level in this thread
On August 02, 2003 at 14:40:45, Dieter Buerssner wrote: >On August 02, 2003 at 12:15:18, Sune Fischer wrote: > >>On August 02, 2003 at 11:12:29, Tony Werten wrote: >> >>>When not doing any extensions ( not realistic but anyway) the values returned >>>from the last 2 plies from normal search are exact. (As was published 15 years >>>ago) >> >>I don't believe that, and I think my example above shows it. > >A. Reinefeld. An Improvement of the Scout Tree Search Algorithm. ICCA Journal >6,4 (1983), pp. 4-14. http://www.zib.de/reinefeld/bib/83icca.pdf A bit long and technical to quickly go through tonight, but looks like he is talking about minimax searching of some kind, and not alpha-beta. -S. >I think, it won't work in general with a qsearch (which is more or less variable >depth by definition). It can work in specific cases (the easiest example: there >are no captures, and no lazy eval is used). > >A modern alpha-bet search will use extensions, and this already makes Reinefelds >algorithm unsuitable (at least without modifications). > >Regards, >Dieter
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.