Author: blass uri
Date: 05:36:19 11/10/99
Go up one level in this thread
On November 09, 1999 at 17:17:06, James Robertson wrote: >Today Kiriakov swept Tiviakov away with a cool sacrifice. I haven't tried my >program on the position yet, but a little analysis with Crafty convinced me >Insomniac would never find the move in my lifetime. > >rn1r2k1/1bqpbppp/pp2pn2/6N1/2P5/1PN1P3/PBQ1BPPP/3R1RK1 w - - bm Nd5;id Kiriakov >- Tiviakov, 1999; > >How do other programs do? If it doesn't seem to hard, maybe I'll try my program >on it. :) > >James I think that it is a positional test. I did not check if the sacrifice is right but I found that the difference between the evaluation before the move and the evaluation after the move is small. I think that increasing the value of the pawn can help programs to find Nd5 but can also help to find some wrong sacrifices. I guess that your program is going to find Nd5 because I found from games that it likes to sacrifice a piece for pawns. Uri
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.