Computer-Generated Chess Problem 03158

Consider this 'KQBPP vs knpp' four-move chess problem generated by a computer using the DSNS computational creativity approach which doesn't use any kind of traditional AI. Chesthetica has the creative ability to compose positions that may otherwise take centuries to arise in an actual game, if ever. 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 (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 9 pieces could have been taken from such a database.

image.png

8/2K1kp2/8/2P2B2/5PQ1/5n2/2p5/8 w - - 0 1
White to Play and Mate in 4
Chesthetica v12.18 (Selangor, Malaysia)
Generated on 4 Jan 2021 at 12:01:19 PM
Solvability Estimate = Difficult

Chess puzzles are ancient. Some are over a thousand years old but only in the 21st century have computers been able to compose original ones on their own like humans can. White is over a rook's worth in material but the precise win in this position still needs to be found. Do share and try out some of the others too. Solving chess puzzles like this can also help improve your game.

Solution

<| Amazon | BitChute | Minds | Reddit | WordPress | YouTube |>

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