Author: Uri Blass
Date: 23:19:31 05/27/01
Go up one level in this thread
On May 27, 2001 at 22:13:55, Bruce Moreland wrote: >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 Maybe I did not explain myself well The computer always has a line that it analyzes and I am interested in the relevant lines that it analyzes more often. Chessmaster6000 has an option to show every 1/2 second the line that it considers. I assume that other programs including ferret works similiraly. You can remember all these lines and post the begining of the lines that were considered more often. If you give it 200 hours you need to remember only 3600*200*2 lines that is 1,440,000 lines. There is no problem to remember this information in the hard disk and anlayze it(if it is too much you can use 1 or 2 second instead of 1/2 second and get less lines). if 1.Bxg7 was the begining of 2*20*3600 lines then the estimated time for Bxg7 is 20 hours if 1.Bxg7 Kxg7 2.Ne5 then the estimated time for Bxg7 Kxg7 Ne5 was 15 hours. lines like Bxg7 Kxg7 with a move of white that are not 2.Ne5 are not relevant if I assume that 2.Ne5 is the killer move for Kxg7 and I assume that ferret remember the list of killer moves because it is important to use them in the next iteration. 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.