I try to prove that an artificial inteligence is not needed to solve many difficult (unsolved) for engines positions. It is only a question of missing code. The highest ELO is not able to replace it.
I selected the following questions (examples), solved in Sting's code:
1) Sacrifice breaking fortress
3N2r1/2K1p3/4Pk2/8/Bp5b/8/2P5/8 b - - bm Bg3+ (and next Kd7 Rxd8);
8/5pKN/5Pp1/5kP1/8/Bb6/8/7q b - - bm Qxh7;
7k/6rp/5BpN/1r4P1/8/8/8/K7 b - - bm Rf5 (and next Bd4 Rxg5);
1r6/4k3/r2p2p1/2pR1p1p/2P1pP1P/pPK1P1P1/P7/1B6 b - - bm Rxb3+;
2) Zugzwang delayed by pawn moves
1N4K1/1pp1p3/7k/2r3pP/p2pp1P1/P6N/8/2B5 w - - bm Nc6;
5K2/k4p1p/5p1p/1p3p2/bP6/1p6/1P5p/7B w - - bm Ke8(e7);
1n6/Pp1p1p1p/1P1P1P1P/4K3/2p5/p7/rpp1P3/qkb1R3 w - - bm axb8N;
4N3/B6p/n2p4/rk1P4/p6p/P3Pp1P/3N1P1b/5K2 w - - bm Ke1;
3) Trapped piece in endgames
q1b4n/1p1pKp2/1p1p1Pp1/1P1P2Pp/2P4P/8/7R/1N1k4 w - - bm Ra2;
4q1kr/p6p/1prQPppB/4n3/4P3/2P5/PP2B2P/R5K1 w - - bm Qxe5;
1k1n4/1p1b1p2/1Bp1pPp1/1PP1P3/8/6P1/8/1K6 w - - bm Bc7+;
1K3kB1/8/6p1/7R/8/4b3/8/6n1 w - - bm Rh8 (and next Kg7 Bh7);
There is needed a code to solve the main problem for engines: how to get zero in draw positions? It is a subtle question but I believe possible to do it by a code no tricks.
