And for the answer for all you intrested.
Why were the engines unable to find the answer? Is this a glitch in computer programming? Are thre some positions computers can never understand?
Do such opportunities exist in every game which we simply fail to see because our engines don't see them?
Your thoughts.
wow i'm impressed, in which game did this position occur?
some high level correspondence game.
The computational complexity of a 32 ply combination is staggering, and computers cannot possibly evalute 30 to the 32nd power positions. Thus, "pruning" is used. This is where a move that does not return an evaluation better than that of the main line in a certain number of moves is "pruned", or the computer ceases to look at it! Only after 9 moves does it give a good evaluation, thus, the move was pruned earlier
The point is after analysing for over 40 minutes and reaching a depth of around 35, stockfish still showed complete equality and after a few moves it was showing +16 for its opponent.
The engine didn't have to see 32 ply ahead to see that the position was loosing, 5 or 6 moves ahead was enough.
6 moves is enough for a human, we can see that White just pushes the pawns and Black has nothing to do. A computer can't see that and needs to go until mate
but it still gets a huge negative evaluation, no?
Because of the material deficit.
some high level correspondence game.
This game: http://www.chess.com/games/view?id=53873
Supposedly OTB, in Moscow championships, but there are some doubts about this.
some high level correspondence game.
This game: http://www.chess.com/games/view?id=53873
Supposedly OTB, in Moscow championships, but there are some doubts about this.
yes, that game
wow, i can't beleive top engines didn't see that. Is this called the Horizon effect?
wow...im impressed.
Current stockfish-git needs a couple of hours in my weak hardware to discover that Qxe5 actually wins. After a couple of minutes, it still thinks it's a draw.
apparently, ghost has closed his account 
Someone can find win after 1. Qxe5 fxe5 2. Rf1 Rc8 3. Bd1 Rc4 4. Bb3 b5 5. Bxc4 bxc4 6. b3 cxb3 7. axb3 a5!! 8. c4 Qe7 9. g4 Qe8 10. Kg2 * or 1.Qxe5!? fxe5 2.Rf1 Rc7 3.Bb5 Qe7 4.Ba4 Rc4 5.Bb3 b5
Can you please post the moves on a board?
The computational complexity of a 32 ply combination is staggering, and computers cannot possibly evalute 30 to the 32nd power positions. Thus, "pruning" is used. This is where a move that does not return an evaluation better than that of the main line in a certain number of moves is "pruned", or the computer ceases to look at it! Only after 9 moves does it give a good evaluation, thus, the move was pruned earlier
And that's why computers will never be better than humans in chess. Computers can't think. Computers are not creative.
The position below has one winning move for white which leads to mate in around 12 moves, try to use your best engines (Houdini, Stockfish etc) to find the answer, I bet they'll not know what's happening in the position.