Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Pondering ("think on opponent's time")

Author: Uri Blass

Date: 22:10:23 11/10/02

Go up one level in this thread


On November 10, 2002 at 23:53:19, Robert Hyatt wrote:

>On November 10, 2002 at 22:38:03, Jeremiah Penery wrote:
>
>>On November 10, 2002 at 21:29:43, Robert Hyatt wrote:
>>
>>>On November 10, 2002 at 21:15:07, Jim Bumgardner wrote:
>>>
>>>>Which of these strategies for "think on opponent's time" makes more sense?
>>>>
>>>>A) To only search the top-move from the principle variation.  If
>>>>the opponent makes that move, continue searching, otherwise reset and
>>>>search again.
>>>
>>>This is the _only_ way to do it.  I've explained this many times, but it
>>>is probably time to go it again...
>>
>>For the general case.  But it shouldn't be hard to find situations where it's
>>very easy to tell the ponder move is probably wrong.  In those cases, it's
>>obvious, IMO, that switching to a different ponder move would help.
>>
>>One possible scenario is when the ponder move keeps failing high - either the
>>ponder move is wrong, or you ponder some other move and you'll find the
>>fail-highs again anyway if they play the original ponder move.  Otherwise,
>>you'll have a better chance of pondering on a better move.  You could always
>>save the result of the first ponder search just in case.
>
>
>That is a good point of course.  If you get the fail high _before_ using the
>"target time" then you can safely switch to pondering something else, knowing
>you will have time to find the "fail high" again, if the opponent makes the
>expected move.
>
>The bad side might be that you don't fail high until you are beyond your target
>time, so that if you start pondering something else, you might not be able to
>find the fail high for real if the opponent actually makes that move...

You assume here that you are going to forget the fail high.

You can rememeber the move that you want to play against the expected move in
case of fail high and continue to search other moves and when the opponent plays
the expected move you can play the move that you remember in 0 seconds.

I also believe that the best strategy is not to ponder only on one move but to
have a lot of threads(for every legal move of the opponent a different thread)
and to give different priority for different moves.

I do not use that strategy but the fact that it is harder to program it does not
mean that this strategy is bad(you can still use most of the time for the
expected move in most of the cases unless you see many moves with almost the
same score).

I understood that Aristarch use that strategy.

Uri



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.