Computer-Generated Chess Problem 01841
Here is a new 'KQBN vs krrnp' #3 chess puzzle created by the prototype 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 (i.e. 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 v10.59 : Selangor, Malaysia
2018.1.5 5:22:58 PM
A seemingly earlier version of Chesthetica on a problem composed later (based on the date and time stamp) simply means that version may have been running on a different computer or operating system user account. White has a slight material advantage over Black. Try to solve this as quickly as you can. If you like it, please share with others. Note that not all the chess problems are like this. They cover quite the spectrum of solving ability and there are over a thousand published already.
Solution (Skip to 0:35)