Author: Vincent Diepeveen
Date: 05:36:58 01/18/00
Go up one level in this thread
On January 18, 2000 at 07:16:01, blass uri wrote: >On January 18, 2000 at 06:27:06, Vincent Diepeveen wrote: > >>On January 17, 2000 at 16:08:04, Jeremiah Penery wrote: >> >>>On January 17, 2000 at 14:39:35, Vincent Diepeveen wrote: >>> >>>>On January 17, 2000 at 14:32:28, Dann Corbit wrote: >>>> >>>>>I see that there are programs that can solve NOLOT #8. >>>> >>>>Ferret. >>>> >>>>>I also understand that that position was shown to be in error. >>>> >>>>No that's a big lie. >>> >>>What are you talking about?? >>>The given analysis _was_ in error. 3. ...gxf6 is not the best move, as you even >>>pointed out. >> >>gxf6 is THE PROBLEM to see for programs. >>if a program doesn't need to consider gxf6 then it finds at say 7 ply >>or something the Bxh7 move. > >It depends on the evaluation function of the program. >I think that I read that deep thought saw that the line with gxf6 is losing but >prefered not to play Bxh7 but play another move with the idea to play Bxh7 in >the next move that is highly unlikely. what we need is: - search output of deep thought in root - search output of deep thought after bxh7 kxh7 qh5 kg8 rd4 bf3 If the last output is better for white at 6 ply for deep thought than the root score then we can talk further. >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.