Computer-Generated Chess Problem 02637

in #chess5 years ago

This is an original 'KQNN vs kqrrp' three-move chess puzzle created by Chesthetica using the approach known as the DSNS from the sub-field of AI, computational creativity. 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

3k3q/1r1rN3/5p1Q/2K1N3/8/8/8/8 w - - 0 1
White to Play and Mate in 3
Chesthetica v11.16 (Selangor, Malaysia)
Generated on 29 Apr 2019 at 3:29:19 PM
Solvability Estimate = Difficult

Chesthetica, especially if running on multiple computers or operating system user accounts, is capable of generating far too many compositions than can be published in a timely fashion here. The newer ones will therefore only be published some time later. This is why the composition date above does not match today's date. White actually has less material than Black yet still wins. The white army is down by about 5 (Shannon) pawn units in value. 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.

Main Line of the Solution (Skip to 0:35)

Coin Marketplace

STEEM 0.17
TRX 0.15
JST 0.029
BTC 57102.05
ETH 2348.73
USDT 1.00
SBD 2.33