Author: Christophe Theron
Date: 22:21:15 05/12/00
Go up one level in this thread
On May 12, 2000 at 16:21:01, blass uri wrote:
>[D]1r3nk1/3rb1p1/p2p1pP1/1p2p3/Pnq1P1R1/2N1B3/1PPR3P/2NQ3K w - - 0 1
>
>This position is from the ssdf games(Junior5-Junior6).
>The evaluation was close to equality and suddenly Junior5 failed high and found
>more than 1 pawn advantage for white.
>
>I post this position to demonstrate the fact that tactics is not only
>sacrifices.
>
>Unfortunately tactical test positions are usually sacrifices.
>
>I am also not sure if there is only one good move for white.
>White played in the game Rg2.
>This is a good move with the idea to give mate by Rh4 and Qh5 but I am not sure
>if this is the only good move and it is possible that axb5 and after it Rg2 also
>give the same result(I did not check it)
>
>The point is not to find Rg2 but to find a significant change in the evaluation.
>
>How much do programs need to fail high?
>
>I think it is a good idea to generate a tactical test suite based on positions
>from practical games and not based on finding sacrifices.
>
>In order to do it we need to analyze many games and find cases when there is a
>significant change in the evaluation.
>
>
>Uri
Output from Chess Tiger 12.5:
N9 32.40s Kg1 Bd8 axb5 axb5 Nd3 Ba5 +0.14
N9 33.50s axb5 +0.15
N9 36.52s axb5 axb5 Nd3 Bd8 Rf2 +0.23
N9 52.06s Rdg2 +0.24
N10 122.20s Rdg2 Bd8 Rh4 Ne6 axb5 axb5 Nd3 f5 Rh7 f4 Nxb4 Qxb4 Qd5 +0.52
N11 576.05s Rdg2 d5 +1.41
So Tiger needs 576s (9m 36s) to find the "solution", on a K6-2 400MHz, 8Mb hash
tables.
Christophe
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.