Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Can opponent's thinking time be a search/eval parameter?

Author: Uri Blass

Date: 16:57:41 10/17/02

Go up one level in this thread


On October 17, 2002 at 18:12:02, Robert Hyatt wrote:

>On October 17, 2002 at 16:34:08, Murray wrote:
>
>>On October 17, 2002 at 10:07:41, ujecrh wrote:
>>
>>>(snip)
>>>We can track opponent's thinking time and, without trying to match it, add some
>>>time or search extensions when an unusual delay has occured.
>>>
>>
>>But humans also ponder when the computer is thinking. It could be argued that if
>>the human is having to spend a long time thinking in a difficult position, the
>>computer should play just as quickly or quicker than normal, to reduce the
>>human's chance of seeing through the complications.
>>
>>Murray Cash
>
>
>If the computer had any _idea_ about what makes up a complex/hard-to-analyze
>position,
>this would be a good plan.  But it doesn't have a clue about whether the
>opponent has an
>easy or difficult position to play, and trying to play games with time usage
>will more often
>than not blow up in your face....

The computer may ponder about all the possible moves but use different time for
different moves(I remember that I read that this idea is used by aristarch).

If based on the scores it can see that there is a forced move it can give it
almost all of the time but if it see 5 moves with almost the same score it can
continue to analyze them and use almost 1/5 of the time for everyone of them.

If the opponent use 30 minutes for his move when the average time is 3 minute
per move and the computer used 5 minutes to ponder about the move that was
played then the computer may reply in 0 seconds.


Uri



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.