Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Nolot Positions result of Gambit-Tiger

Author: Robert Hyatt

Date: 07:49:39 11/29/00

Go up one level in this thread


On November 29, 2000 at 08:22:52, Uri Blass wrote:

>On November 29, 2000 at 07:17:57, Amir Ban wrote:
>
>>On November 29, 2000 at 05:48:05, Jeremiah Penery wrote:
>>
>>>On November 29, 2000 at 05:04:18, Amir Ban wrote:
>>>
>>>Nolot #1:
>>>
>>>>17 minutes is not a fast solving time for this position.
>>>
>>>What would you consider a fast solving time for this position?
>>
>>Anything under 2 minutes. This is analysis from a version I'm currently testing:
>>
>>
>>r3qb1k/1b4p1/p2pr2p/3n4/Pnp1N1N1/6RP/1B3PP1/1B1QR1K1 w - - 0 1
>>
>>Analysis by Junior x.1:
>>
>>1.a5 Rb8
>>  ³  (-0.29)   Depth: 3   00:00:00
>>1.Qd4 Nf4 2.Rge3 Nbd3
>>  =  (-0.02)   Depth: 6   00:00:00  18kN
>>1.Qd4 Nf4 2.Rge3 Nbd3
>>  =  (-0.02)   Depth: 6   00:00:00  18kN
>>1.Qd4 Nf4 2.Rge3 Nbd3
>>  =  (-0.02)   Depth: 6   00:00:00  18kN
>>1.Qd4 Nf4 2.Rge3 Nbd3
>>  =  (-0.02)   Depth: 6   00:00:00  18kN
>>1.Qd4 Nf4 2.Rge3 Nbd3 3.Bxd3 Nxd3 4.Rxd3 cxd3
>>  ³  (-0.35)   Depth: 9   00:00:00  237kN
>>1.Nxh6 c3 2.Bxc3 Nxc3 3.Rxc3 Bxe4 4.Bxe4 Rxe4 5.Nf7+ Kg8 6.Rce3
>>  ³  (-0.26)   Depth: 9   00:00:01  766kN
>>1.Nxh6 c3 2.Bxc3 Nxc3 3.Rxc3 Bxe4 4.Bxe4 Rxe4 5.Nf7+ Kg8 6.Rxe4 Qxe4 7.Rc7 Nd5
>>8.Rb7
>>  ³  (-0.26)   Depth: 12   00:00:23  9682kN
>>1.Nxh6 c3 2.Kh2 Rxh6 3.Ng5 Qd7 4.Qg4 Qc7 5.Ne6 Qc8 6.Ng5 Kg8 7.Bf5 cxb2 8.Bxc8
>>Rxc8 9.Ne6
>>  =  (-0.12)   Depth: 14   00:02:57  69608kN
>>1.Nxh6 c3 2.Kh2 Rxh6 3.Ng5 Qd7 4.Qg4 Qc7 5.Ne6 Qf7 6.Ng5
>>  =  (0.00)   Depth: 15   00:06:31  147930kN
>>1.Nxh6 c3 2.Kh2 Rxh6 3.Ng5 Qd7 4.Qg4 Qc7 5.Ne6 Qf7 6.Ng5
>>  =  (0.00)   Depth: 16   00:14:43  322408kN
>>1.Nxh6 c3 2.Ba1 Rxh6 3.Nxc3 Qh5 4.Qd4 Qf7 5.Rf3 Qc7 6.Rg3 Qc5 7.Qxc5 dxc5 8.Bg6
>>  =  (-0.03)   Depth: 17   00:49:45  1013974kN
>>
>>(Ban, M-Systems 29.11.2000)
>>
>>Amir
>
>The second move in the main line seems not to be the right move.
>
>2.Nf5 is winning.
>I did not analyze Kh2 or Ba1.
>
>Uri


Remember that it isn't yet finding the "right reason".  It has found a draw.
The question is, if you advance 2 plies into the position, could it find the
non-drawing line before it ran out of time and committed to the repetition
path?

If it can win from 2 plies into the position, then it is doing ok.  If it
falls into a draw, it is not.



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.