Author: John Merlino
Date: 22:38:00 12/21/04
Go up one level in this thread
On December 22, 2004 at 00:38:59, Robin Smith wrote: >On December 21, 2004 at 18:25:06, Uri Zlatnik wrote: > >>The recognition of winning pawn structure is one of the problems of chess >>softwares (including top ones like Junior 9 and Shredder 8). >> >>Many times there is a sound sacrifice (usually winning) which the program fails >>to "see" immediately. This will take Kasparov not more than 1 minute to figure >>out. >> >>For example take the game of Kuzmin-Grospeter, Kusadasi 1990: >> >>1. e4 c5 2. Nf3 d6 3. d4 cxd4 4. Nxd4 Nf6 5. Nc3 a6 6. Be2 e5 7. Nb3 Be7 8. 0-0 >>0-0 9. Kh1 b5 10. Nd5! Nxd5 11. Qxd5 Ra7 12. Be3 Be6 13. Qd1 Rd7 14. a4 b4 15. >>f4! Qc7? 16. f5! Bc4 17. Bxc4 Qxc4 > >I don't think that in this case most chess software has trouble because of >"recognition of winning pawn structure". In this position both Fritz and Junior >want to play for the identical exchange sacrifice, and identical pawn structure, >via 18.Nc2 Qc8 19.f6 Bxf6 20.Rxf6. So the reason programs don't find 18.f6! >cannot be because of pawn structure problems; it is search depth and search >extension problems. > >-Robin One correction to your line above. It should be 18.Nd2 instead of Nc2. And this one move makes all the difference. The King also wants to play the above line, but the crucial 22.Nd4! is no longer an option after this line, and that's why waiting one move to play f6 is incorrect. But I agree with you that not being able to find the move has nothing to do with recognizing pawn structure. jm
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.