Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Dann more info Positions 3 and 5

Author: Uri Blass

Date: 16:19:04 12/16/05

Go up one level in this thread


On December 16, 2005 at 18:06:01, Dann Corbit wrote:

>On December 16, 2005 at 17:02:33, K. Burcham wrote:
>
>>
>>
>>Rybka 1.0 Beta 32-bit
>>2200 mhz AMD
>>432 hash
>>
>>r2qk2r/ppp1b1pp/2n1p3/3pP1n1/3P2b1/2PB1NN1/PP4PP/R1BQK2R w KQkq - bm Nxg5; id
>>"Position 3";
>>1.h3 Bxf3 2.gxf3
>>  ²  (0.49)   Depth: 22   09:20:55  2534458kN
>
>Bruce's page has some comments about this as a possible alternative move.
>Still, the score is not very convincing.
>
>>r2qrb1k/1p1b2p1/p2ppn1p/8/3NP3/1BN5/PPP3QP/1K3RR1 w - - bm e5; id "Position 5";
>>1.e5 Nh5
>>  +-  (4.01)   Depth: 20   06:20:55  1902293kN
>
>At what ply and time was the correct answer discovered?

Note that I could show that 1.e5 is winning by the following tree
When I let yace to go backward it can see score of even more than +4 in the root


[Event "38'/40+38'/40+38'/40"]
[Site "?"]
[Date "2005.10.06"]
[Round "?"]
[White "New game"]
[Black "?"]
[Result "*"]
[Annotator ",agur"]
[SetUp "1"]
[FEN "r2qrb1k/1p1b2p1/p2ppn1p/8/3NP3/1BN5/PPP3QP/1K3RR1 w - - 0 1"]
[PlyCount "13"]
[EventDate "2005.??.??"]
[TimeControl "40/2280:40/2280:40/2280"]

1. e5 dxe5 (1... Nh5 2. Qg6 Qh4 (2... d5 3. Qxh5 Re7 4. Qg4) 3. Bc4 Nf4 4. Rxf4
Qxf4 5. Bd3 Kg8 6. exd6) 2. Ne4 Nh5 (2... Ng8 3. Rxf8 Qe7 4. Rxe8 Bxe8 (4...
Rxe8) 5. Nxe6 Bc6 6. Qg6 Bxe4 7. Qxe4 Nf6 8. Qxe5) (2... g5 3. Nxg5 Qe7 4.
Ngxe6) 3. Qg6 Nf4 (3... exd4 4. Ng5 Qxg5 5. Rxg5) (3... Qe7 4. Qxh5) (3... Qh4
4. Nf3) (3... Bb5 4. Nxe6 Rxe6 5. Qxe6) (3... Bc6 4. Nxc6 bxc6 5. Qxh5) (3...
a5 4. Qxh5 Re7 5. Rg6) (3... b6 4. Qxh5 Re7 5. Nf6) (3... b5 4. Qxh5 Re7 5. Nf6
) (3... Rc8 4. Qxh5 Re7 5. Qxe5) (3... Rb8 4. Qxh5 Re7 5. Qxe5) 4. Rxf4 exf4 5.
Nf3 Qb6 6. Rg5 Qd8 (6... e5 7. Qxb6 Bc6 8. Nxe5 Bxe4 9. Qd4) 7. Ne5 *




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.