Computer-Generated Chess Problem 01955

Take a look at this 'KQNNP vs kbpp' #4 chess problem generated autonomously by the 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. 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.

6Q1/2pN4/3k4/2p4K/5P2/3N4/2b5/8 w - - 0 1
White to Play and Mate in 4
Chesthetica v10.63 : Selangor, Malaysia
2018.3.15 12:47:57 AM
Solvability Estimate = Difficult

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 decisive material advantage in this position but the winning sequence may not be immediately clear. Do you think you could have composed something better with these pieces? Share in the comments and let us know how long it took you. Some of these problems may be trivial for you, especially if you're a club or master player but bear in mind that chess lovers can be found at all levels of play. So do check out some of the other problems. You can probably find something more to your taste.

Related Books: http://amazon.com/author/azlan_iqbal