Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Can your program find this strong move?

Author: Uri Blass

Date: 05:42:28 10/26/01

Go up one level in this thread


On October 26, 2001 at 08:03:46, Rex wrote:

>GT-2(Modified) finds it in just .4 on a 1.533Ghz machine.
>
>
>
>00:00:00.5	1.50	8	154240	Qa1 Qe8 Rxa7 Rc8
>00:00:00.4	1.58	8	240957	b6 cxb6 Rbxb6 Qf8
>00:00:01.3	1.68	9	463033	b6 cxb6 Rbxb6 Qf8
>00:00:02.9	1.76	10	870326	b6 cxb6 Rbxb6 Qf8

I see based on the output that after 0.5 seconds tiger wanted to play Qa1 and if
this output is truth then it is clear that tiger did not solve it in 0.4
seconds.

It is clear that at least one of the numbers 0.4 and 0.5 is wrong.

Based on the number of nodes it seems clear that the 0.4 is wrong and
1.3*(240957/463033) is a better estimate.

Another possible estimate is 0.5+(1.3-0.5)*(240957-154240)/(463033-154240)

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.