Author: odell hall
Date: 07:34:05 08/21/99
Go up one level in this thread
On August 21, 1999 at 09:20:34, blass uri wrote: > >On August 21, 1999 at 08:10:55, odell hall wrote: > >>On August 21, 1999 at 08:04:43, odell hall wrote: >> >>>On August 21, 1999 at 06:43:55, blass uri wrote: >>> >>>> >>>>On August 21, 1999 at 05:08:58, odell hall wrote: >>>> >>>>>Hi >>>>> >>>>> >>>>> So far only Fritz5.32 can solve this position, I am not letting my programs >>>>>think more than five minutes. Fritz 5.32 AMD-k2II 350 45mb for fritz solves in >>>>>47sec!!! >>>>> >>>>>2n1r1k1/2p1q2p/3pN1p1/3Pp1N1/3bP3/5Q2/2r3PP/R4R1K w - - id Bart - Towerking; bm >>>>>g5h7; >>>> >>>>I think that there are many solutions to the problem and g5h7 is not the only >>>>winning move so it is not a good problem. >>> >>> >>> >>>Ok uri come on icc and i will beat any program you have with Nxh7 just to prove >>>that it is the winning move. The next best move is Ra3 which is slightly >>>inferior. But nxh7!! is definetely the best move! without question. >>>> >>>>Can Fritz5.32 defend this position with black against the program that do not >>>>find g5h7? >>>> >>>>Uri >> >> >>I am defining the Best move as the move which leads to the greatest loss of >>material for the opposing side. Just because fritz can not defend the position >>against a program that does not play nxh7 does mean that Nxh7 is not the best >>move. Maybe you can explain your logic to me. No one said that there was not >>many good moves in the position, only that Nxh7 is that best. > >My logic is that if there is more than 1 winning move then it is not a good >problem. > >My version of Junior after some hours want to play Rab1 with 2.49 pawns >advantage for white(1.Rab1 h5 2.Qf7+ Qxf7 3.Rxf7 Rf2 4.Rxc7 Bb6 5.Rg7+ Kh8 >6.Nf7+ Rxf7 7.Rxf7... is the main line) > >Uri I bet if you feed Nxh7 into junior and then let it think, it will see that this move is stronger
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.