Author: Peter Berger
Date: 13:22:47 03/26/03
Go up one level in this thread
On March 26, 2003 at 15:27:39, Kurt Utzinger wrote: >On March 26, 2003 at 06:28:52, Peter Berger wrote: > >>These can be tough or very easy depending on engine - some engines seem to know >>too much here. They are also interesting for humans I think. >> >>6k1/p4p2/6p1/1P2p2p/4q2P/4Q1P1/P4P2/6K1 b - - 0 1 >> >>1..Qxe3! wins for black. > > Hi Peter > Do you really think that in these positons it is a matter of knowledge > for chess programs? Yes, I do - see below. I doubt and assume it's simply a matter of search and > calculation. This depends on the time availlable. You not only want to solve it, but you want to solve it fast enough. >We can see this from analysis with Rebel 12 Beta1. In the first > position it's easy to see for the program that white will lose a pawn. In > the second position, Rebel needs 9m2s to come to a slightly negative > evaluation for ... Qxe3? See? > >00:09:02 15.00 -0.15 1..Qxe3 2.fxe3 Kf8 3.Ke2 Ke7 4.Kd3 Ke6 > 5.Kc4 f6 6.a3 g5 7.a4 Kd6 8.a5 g4 9.e4 (531) > Crafty might be overtuned for this motive. But if Rebel can't avoid Qxe3 in 9 minutes trading in a completely lost pawnending it certainly has too little knowledge about outside passed pawns here. If it could search deep enough to see the trouble tactically it wouldn't matter. In fact the Rebel evaluation came as a very big surprise for me- it would lose this position at tournament time control! Everything in my very humble opinion - I am a user, not a chessprogrammer. Peter
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.