Author: Bas Hamstra
Date: 16:48:25 01/05/04
Go up one level in this thread
>>Here is what I tried (idea from Bruce I believe): >> >>Before you search all moves (after nullmove) you search all moves (unsorted) >>with D-R > > Good point I had missed :) > I was doing an expensive D search with (Alpha-Margin,Alpha-Margin+1) and if >only one move failed high, search it again with (Alpha,Beta) extended 1 ply. > >>and check if there is one and only one move with a score above alpha >>*and* above Alpha-Margin. > > So if I get it right, you search all moves with D-R and a null window around >Alpha-Margin. If only one move fails high, then search it again with D-R and a >null window around Alpha. If it fails high again, then that move is extended. It did not do this, but your idea might be better. I did one single pass with window(Alpha-M, Alpha) and simply counted the results. > Thanks for the tips. I'll report my results if I manage to make it work. Please do, I am interested. Bas.
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.