Here is a 'KQRRN vs kqrp' mate in 3 chess problem generated by the 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 (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.
White to Play and Mate in 3
Chesthetica v11.47 (Selangor, Malaysia)
Generated on 5 Oct 2019 at 6:55:10 AM
Humans have been composing original chess problems for over a thousand years. Now a computer can do it too. Now, let's see what else there is to say. Give me a moment. Try to solve this as quickly as you can. If you like it, please share with your friends. Note that not all the chess problems are like this. They cover quite the spectrum of solving ability and there are thousands published already. If you're bored of standard chess, though, why not try this?
Solution
<| Book | DTube | Facebook | Instagram | Twitter | Website |>