Author: Ulrich Tuerke
Date: 03:42:16 04/21/01
Go up one level in this thread
On April 21, 2001 at 05:07:08, Frank Schneider wrote: >On April 20, 2001 at 15:34:01, Scott Gasch wrote: > >>Hi all, >> >>I'm trying to come up with a good algorithm for detecting "easy" moves. The >>goal is of course to make obvious recaptures faster. >> >>The obvious definition of an easy move is one where the score of the PV move at >>a certain depth is delta better than all the other moves at the root position. >>I use PVS, though, and because of the minimal window search on moves 2..N I >>don't come up with exact scores for some moves. >> >>So I am looking for other definitions... right now I am experimenting with: if >>the first move searched never changed from plys 1-7 and it recaptures on the >>opponent's last move it is "easy". This scares me a little, though... obviously >>this is not the sort of thing you want to get wrong. Has anyone come up with a >>clever definition that doesn't involve extra searching? >> >>Thanks, >>Scott > >I like the idea Donninger mentioned in an ICCA-article: >check if searching the first move took more nodes than searching all other >moves. This may just be an indication that the search for this move had been extended far more than the search for the other root moves (e.g. because of check, pawn advance or whatever). The 2nd move could be "quiet" but still comparably good. IMO, this is not a safe criterion. Uli > >Frank
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.