Author: Brian Smith
Date: 13:22:04 04/28/99
Go up one level in this thread
On April 28, 1999 at 15:16:38, blass uri wrote: > >On April 28, 1999 at 12:38:26, Lawrence S. Tamarkin wrote: > >>Yes, It is beautiful! Fritz5.32 and Junior5 do not solve this. (or solve it >>quickly enough for our taste anyway). > >Junior5 solved it at tournament time control and it is quickly enough for my >taste. > > I put it on the King engine in >>TASCBASE2.0 (very simular engine to CM5500-CM6000). It finds the solution in >>about 2 seconds. Obviously, the De Konig engine has some unique search >>extensions for mate positons in its root search that allow it to find beautiful >>mates like this. > > >The problem of De Konig engine is that sometimes I can see that it is using a >lot of time for stupid sacrifices. >You can see it by looking at the thinking lines of chessmaster6000 > >It does not know to extend sacrifices only in the right cases. > >Uri That is because of the Selective Search setting... it will check... no matter how bad the move is.
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.