Computer Chess Club Archives


Search

Terms

Messages

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

Author: Uri Blass

Date: 14:39:50 11/11/02

Go up one level in this thread


On November 11, 2002 at 16:17:09, Sune Fischer wrote:

>On November 11, 2002 at 15:59:40, Sune Fischer wrote:
>>>>
>>>>The math here is wrong - it should be:
>>>>0.6*0.9 + 0.4*0.1*0.3 = 0.54 + 0.012 = 0.0552
>>>
>>>The math is correct
>>>You cannot change my calculation and decide that my math is wrong.
>>>
>>>I think that you assume that I assume that the program always use 90% of the
>>>time for the move that it expects.
>>>
>>>I did not say it.
>>>
>>>There are 2 kind of moves:
>>>
>>>Moves type A:Moves that the program has the move that is going to be played in
>>>the pv.
>>>Moves type B:Moves that the program does not have the move in the pv.
>
>
>Oh, I get it now, it's the utilization of the CPU of course.
>In that case you need another percentage, like this:
>
>>Moves type A:Moves that the program has the move that is going to be played in
>>the pv and are correctly pridicted x percent of the time.
>>Moves type B:Moves that the program does not have the move in the pv. (I don't know)
>
>If we assume x is 50 like Bob's example, the first part of you equation would be
>A% times 50% times 90% CPU, looks like that will be hard pressed to compete
>against Bob's 50% times 100% CPU. Of course the assumption is that A=100, so you
>only have 10% CPU to burn on the remaining 50% of the moves. You need 50%
>efficiency out of those 10% to compete with Bob, and you have only moves that
>failed low to search, I'd almost say that is impossible.
>
>-S.

1)I assumed that x is 60% in my example.

2)I do not understand what you say here.

I will explain again what you can practically
do in your search:

You can start with 90% time for the expected move
and 10% for the rest of the moves with possibility to
change it based on the evaluation(if you find
during the search that the move that you expect
is a bad move you can give more time
for other moves and you can also give more time
for other moves if you find that the score
of other moves is the same as the score of the move that
you expect.

The total result may be 90% time for the
expected move when your pv includes the best move
and only average of 40% of your time for
the expected move in other cases
so you can practically get 30% of your time for
the played move that is different than the expected move.

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.