insane.
The longest checkmate problem - 290 move
Sort:
Jan 19, 2013
0
#4
@Player8-CHAMPION: Then there will be indeed a mate in 2: 3. b4 Nd5+ 4. Ka6 Bb7#. Only the wrong colour. :-)
Unbelievably amazing. An alien from another planet probably give him this problem.
1....Rd1+ Bd4
2....c4+ Kd6
3....Rxg1 Bc3
4....Rd1+ Bd4
5....b4 b1=Q
6....Rxb1 cxb4+
Mandy711 : LOOOOL
Jan 19, 2013
0
#8
LoekBergman: Nd5+ is illegal, the knight is pinned by the bishop. though I figured that that pawn on b2 spoils it all :p
Ayoubi-W wrote:
Otto Blathy was born in Tata, Hungary on August 11, 1860 and he is credited for creating a mate in 290 moves. This problem is the longest checkmate problem and Blathy won a prize for this work in 1929. The position is not legal (easy retro analysis) and it is easy to convert it to a legal position, but the original Blathy position is shown. The analysis/solution given here was done by Cyril Banderier in 1992 and has been online since 1998. Mr. Blathy died on September 26, 1939 in Budapest.
I like it!
i doubt this.
thanks all for feedback, hope you enjoyed 
Apr 4, 2013
0
#13
This is one of few problems that computers don't understand. Triangulation with the king is out of there mind.
Apr 4, 2013
0
#14
Position with one additional bishop on the same color tends not to be detected as illegal position. Chessmaster might be the only program that display error message - atleast from what i'm aware off.
[COMMENT DELETED]
White has 2 fighter of the same color and 8 farmers, it's impossible??!!
LOOL !
Apr 9, 2013
0
#17
Houdini 3 Pro's evaluation on Blathys puzzle:
Houdini 3 Pro x64 -4.80 (depth 22)
Main line suggestion: 1.Rd1+ 1...Bd4 2.c4+ Kd6 3.Rxg1 h4 4.Rd1 h3 5.Ka5 h5 6.Ka4 h6 7.Ka3 h4 8.Rh1 Bb7 9.Ka2 h2 10.Kb1 Ba8 11.Ka2 h5 12.Rxh2 Bg7 13.Rh1 Bf6 14.Rd1+ Bd4 15.Rh1
- ( -14.84 (depth 21) 1.Bxe7 Bdxe7 2.Rd1+ Bd4 3.c4+ Kd6 4.Rxg1 h4 5.Rb1 h3 6.Rd1 h2 7.Rh1 Bef6 8.Rd1 Bd8 9.Ka5 Ke7 10.Ka4 Kf6 11.Ka3 Kxf5 12.Ka2 Nxe6 13.Rh1 Bc7 14.Rxh2 Bxb8 15.Rh5+)
- ( -25.56 (depth 21) 1.c4+ Kd4 2.Ka5 Nd5+ 3.Ka4 Nc3+ 4.Ka3 Nxb1+ 5.Kxb2 Nd2 6.Bd6 Nxe2 7.Kc2 Nxf3 8.Bxc5+ Kxc5 9.Kd3 Nfd4 10.Kxe3 h4 11.Kf2 h3 12.Kf1 Nxf4 13.Kg1 Nxf5 14.Kh2 Bd4 15.Kh1)
- ( #-9 (depth 21) 1.Ka5 Nb5+ 2.Ka4 Nc3+ 3.Ka3 Nxb1+ 4.Ka2 Bc3 5.Kxb1 Nxf3 6.exf3 e2 7.Ka2 e1=Q 8.b4 Qa1+ 9.Kb3 b1=Q#)
It's not that computers can't see triangulation. It's that they have trouble seeing 290 moves ahead outside of an endgame tablebase.
Agree - sorry for being late :)
Otto Blathy was born in Tata, Hungary on August 11, 1860 and he is credited for creating a mate in 290 moves. This problem is the longest checkmate problem and Blathy won a prize for this work in 1929. The position is not legal (easy retro analysis) and it is easy to convert it to a legal position, but the original Blathy position is shown. The analysis/solution given here was done by Cyril Banderier in 1992 and has been online since 1998. Mr. Blathy died on September 26, 1939 in Budapest.