Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Another example of very deep tactics that Computers cannot solve

Author: Marc van Hal

Date: 11:25:56 12/07/01

Go up one level in this thread


On December 07, 2001 at 12:48:22, ALI MIRAFZALI wrote:

>The following position occured in one of the oldest Correspondence games
>played in America:
>[D] 2kr3r/ppp2ppp/1b3nq1/4p2b/1PB1P3/2P1B3/P1QN1PPP/R4RK1  b   - 0 1
>This game was played in 1840.
>Here black played 15...Rxd2!! Game finished with 16.Qxd2 Nxe4 17.Qc1 Bf3
>18.g3 h5! 19.Bd5 h4 20.Bxe4 Qxe4 21.Bxb6 Qg4 22.Qe3 axb6 23.R(f)-b1  e4
>24.Qe1 f5! 25.Rb2 f4 26.R(a)-b1  Black announced Mate in Some number of moves.
>Fritz 6 and chessmaster 8000 donot see 15...Rxd2!! No matter how long one runs
>the position.
>Does your program see 15...Rxd2!!!.Althuogh Tactics is the area that Computers
>are naturally strong ;it is interesting that one still runs into tactical
>positions which programs cannot solve.Please indicate your result.

Again I mention the game Nimzowitsch-Alapin  No program finds the  move Nd4!! By
it self
It gives after capture or not capture inmidelatly the way how to win.
Is still has to do something with the computers horizon
Or maybe finding out what is more important in certain positions
Though in last 5 years computers became better in Tactics these positions  are
still a problem.
But Chess programs are not good in sacreficing material maybe it would help if
the mate search is improved
imagine they find a mate in 20 in a normal position
This realy could change the way program play
But I think in the game of Alapin and some other position you might say that
programs also have more trouble to finding the best tactics when the otherside
has not castled yet.



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.