Computer-Generated Chess Problem 02171
A new if not unique KRNNP vs kqb three-move chess problem generated by the program, Chesthetica, using the 'DSNS' computational creativity approach which does not use any kind of machine or deep learning. You can learn more about the DSNS here. 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 8 pieces could have been taken from such a database.
![](https://steemitimages.com/640x0/https://cdn.steemitimages.com/DQmWEYKXNwNJbVx1rGkDSkVCew5ENY14wm2ebsxceSy8mQz/image.png)
White to Play and Mate in 3
Chesthetica v10.67 : Selangor, Malaysia
2018.6.24 4:26:35 PM
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. Okay, let me think for a minute if there's anything else to say here. If this one is too easy or too difficult for you, try out some of the others. Note that not all the chess problems are like this. They cover quite the spectrum of solving ability and there are thousands published already.
Solution (Skip to 0:35)
Congratulations @chesthetica! You have completed the following achievement on the Steem blockchain and have been rewarded with new badge(s) :
You can view your badges on your Steem Board and compare to others on the Steem Ranking
If you no longer want to receive notifications, reply to this comment with the word
STOP
To support your work, I also upvoted your post!
Vote for @Steemitboard as a witness to get one more award and increased upvotes!