Thanks for the tip - that problem is certainly worth checking out. I tried to solve it for about a half an hour, but looking at the solution, I think I could have spent hundred times that time and still not get it. 😕 I guess we can't all be Mikhail Tal...
The solution is absolutely beautiful though! 😵
-Jarno
i've been looking to identify positions where even the best computer would fail. the above cited position is an example which any rule-based program would fail, as surely queening a pawn, and not allowing the opponent to queen a pawn should dominate a chess program's evaluation formula/score. the added factor, of course, is that the win is a long continuation, which likely exceeds the computer's search horizon/scope.
ps
www.chessbase.com is an excellent website which provides well written articles on chess. i recommend this site for people who enjoy reading stories about chess, rather than hard chess analysis.
🙂