Computer-Generated Chess Problem 02184

Now, here we have a 'KBBBNNP vs kqp' chess puzzle created by the prototype computer program, Chesthetica, using the approach known as the DSNS from the sub-field of AI, computational creativity. The program can compose problems that may otherwise take decades, centuries or even longer for human composers to think of, or to arise in a real game. There is no known limit to the quantity or type of compositions that can be generated. The largest (Lomonosov) tablebase today is for 7 pieces which contains over 500 trillion positions. With each additional piece, the number of possible positions increases exponentially. It is therefore impossible that this problem with 10 pieces could have been taken from such a database.


5K2/3k4/BqNP4/8/1B4N1/8/1Bp5/8 w - - 0 1
White to Play and Mate in 4
Chesthetica v10.67 : Selangor, Malaysia
2018.6.30 2:01:34 PM
Solvability Estimate = Easy

White is over a rook's worth in material but the precise win in this position still needs to be found. Did you find this one interesting or have something else to say? Leave a comment below! Solving chess puzzles like this can also help improve your game.

Solution (Skip to 0:35)

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

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