Computer-Generated Chess Problem 02404

Now, here we have a 'KRBBNN vs krbnp' mate in 3 chess problem generated autonomously by a computer program, Chesthetica, using the approach known as the DSNS from the sub-field of AI, computational creativity. Depending on the type and complexity of the problem desired, a single instance of Chesthetica running on a desktop computer can probably generate anywhere between one and ten problems per hour. The largest endgame tablebase in existence today is for 7 pieces (Lomonosov) which contains over 500 trillion positions, most of which have not and never will be seen by human eyes. This problem with 11 pieces goes even beyond that and was therefore composed without any such help whatsoever.


2N3n1/1r1b4/1p6/2kN4/8/2B5/4B3/3R2K1 w - - 0 1
White to Play and Mate in 3
Chesthetica v10.82 : Selangor, Malaysia
2018.11.28 9:06:43 PM
Solvability Estimate = Difficult

If you notice an earlier version of Chesthetica listed with a newer problem, that simply means an earlier version may have been running on a different computer or OS user account. White is significantly ahead in material. Why not time yourself how long it took you to solve this? Collectively, these puzzles are intended to cater to players of all levels. Anyway, if standard chess isn't your thing, you might instead like SSCC.

Main Line of the Solution (Skip to 0:35)

<| Book | DTube | Facebook | Reddit | Twitter | Website |>

H2
H3
H4
3 columns
2 columns
1 column
Join the conversation now