Computer Chess Club Archives

Search

Messages

Subject: Easy moves

Author: Scott Gasch

Date: 12:34:01 04/20/01

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

• Re: Easy moves Frank Schneider 02:07:08 04/21/01
  • Re: Easy moves Ulrich Tuerke 03:42:16 04/21/01
• Re: Easy moves Robert Hyatt 19:41:22 04/20/01
• Re: Easy moves Ulrich Tuerke 15:12:34 04/20/01
• Re: Easy moves William H Rogers 14:10:41 04/20/01
• Re: Easy moves Dieter Buerssner 12:58:46 04/20/01
  • Re: Easy moves Steffen Jakob 01:02:38 04/21/01
    • Re: Easy moves José Carlos 03:15:35 04/21/01

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.