Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: gs2930 position 13

Author: Bruce Moreland

Date: 19:13:55 05/27/01

Go up one level in this thread


On May 27, 2001 at 01:59:58, Uri Blass wrote:

>On May 26, 2001 at 20:59:24, Bruce Moreland wrote:
>
>>On May 26, 2001 at 14:02:26, Uri Blass wrote:
>>
>>>On May 26, 2001 at 12:34:19, Bruce Moreland wrote:
>>>
>>>>I got a fail-high on Bxg7 after 80 hours, on a quad Xeon 450, but I didn't have
>>>>time to resolve it.
>>>>
>>>>bruce
>>>
>>>It is interesting to know the reason that it failed high.
>>>
>>>Unfortunately programs only give main line.
>>>
>>>If you can make your program remember all the lines that it considered for more
>>>than 1 minute than it will be interesting to know them.
>>>
>>>The number of these lines cannot be more than 80*60 in 80 hours and I am
>>>interested only in the lines that begin with Bxg7.
>>>
>>>Uri
>>
>>The only information I could have returned is that Bg7 failed high, and for each
>>possible response I could have remembered the move that refuted the response,
>>and for ever possible response to the move that refuted each response, I could
>>have remembered the move that refuted that move.
>>
>>You don't end up with a line when you have a fail high.  You end up with
>>something with a little less direction to it.
>
>I understand it.
>I meant to say that even a main line is not the interesting information that I
>want to see but it is the information that all programs give after solving the
>fail high.
>
>The problem is that even after you solve the fail high and have the main line I
>believe that the interesting information is the lines that your program
>considered for a long time.
>
>If programs can give a tree with the idea that I suggest that it may help people
>to understand the reason for the move.
>
>I suggested the lines that were considered for more than a minute but a better
>idea is to post first lines that your program considered for more time.
>
>I mean something like
>1.Bxg7 20 hours
>1.Bxg7 Kxg7 2.Ne5 15 hours
>1.Bxg7 Kxg7 2.Ne5 Rfd8 3.Qg4+ 6 hours
>1.Bxg7 Rfd8 Rxd8+ 3 hours

That is not how these work in single-variation mode.  The searching process is,
for lack of a better word, more patchy than that.

bruce

>
>If you can change your program to give this information that it will be
>interesting to see it.
>
>>
>>I had to stop the test because round 1 of the CCT was starting.  I'll run it
>>again after the games tomorrow, I think.
>
>Thanks
>
>Uri
>>
>>bruce



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.