Author: blass uri
Date: 13:21:34 05/20/00
Go up one level in this thread
On May 20, 2000 at 15:48:42, Albert Silver wrote: >On May 20, 2000 at 13:18:21, Bruce Moreland wrote: > >>On May 20, 2000 at 11:21:03, blass uri wrote: >> >>>On May 20, 2000 at 09:27:39, Robert Hyatt wrote: >>> >>>>On May 20, 2000 at 07:11:31, Terje Vagle wrote: >>>> >>>>>1r6/5kp1/RqQb1p1p/1p1PpP2/1Pp1B3/2P4P/6P1/5K2 b - - >>>>> >>>>>After 45. Ra6, Fritz suggests Qe3 for black and evaluates the position as 0,94. >>>>>It does not seem to find the famous draw-line for Kasparov. >>>>>10 hours analysis on PIII-600, and 28006383 KN evaluated >>>>> >>>>>Does any other program find the draw-line? >>>>> >>>>> >>>>>Regards >>>>> >>>>> >>>>>Terje >>>> >>>>The draw is somewhere around 60 plies deep, total. I don't think anyone is >>>>going to find that. >>> >>>I think that it is easy to find the draw by writing the right program. >>> >>>It is easy for a human with chess program to generate a tree that prove for >>>chess programs that white has no material advantage after Qe3(I mean that white >>>cannot get out of the tree and get material advantage and in the final positions >>>white has no advantage). >>> >>>I do not think that it is something impossible to write a program that can >>>analyze in the same way that humans do at least for part of the time. >>> >>>I expect some chess programs in the near future(next 2 years) to find it by >>>search. >>> >>>Uri >> >>Go for it, dude. >> >>bruce > >:-)))) I may be wrong, but as I recall, a couple of the lines actually had a >sac and then a quiet move at the very end. What magical formula will solve this >without cheating or setting up so many ridiculous special directives that the >program has difficulty choosing between h4 and h3 as prime candidates in the >opening position (whew!)? > > Albert Silver Part of the program can find Qe3 by search without seeing the draw. Most programs can find all the right moves after Qe3 if they play against themselves. Part of the programs have a learning function and they can learn from playing against themselves. If they repeat the cycle play against yourself,go back when the evaluation is changed significantly and learn from the result they can find it. This is similiar to the way that I found it with the help of Genius3(p100) after some hours(when the play against yourself was of Genius3 and I used second best to learn because genius has no learning function). 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.