Computer-Generated Chess Problem 01995

in #chess5 years ago

Consider this 'KQRBN vs knnppp' #5 chess construct composed autonomously by a computer 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. There is also no proven limit to the quantity or type of legal compositions that can be automatically generated. 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 11 pieces could have been taken from such a database.


3nN3/5Q2/8/p7/n5K1/1p6/1k5p/2R4B w - - 0 1
White to Play and Mate in 5
Chesthetica v10.63 : Selangor, Malaysia
2018.4.2 5:56:43 AM
Solvability Estimate = Difficult

Some of the earliest chess problems by humans are over 10 centuries old but original ones by computer are very recent. White has a decisive material advantage in this position but the winning sequence may not be immediately clear. Do share and try out some of the others too. Feel free to copy the position into a chess engine and discover even more variations of the solution.

Solution (Skip to 0:35)

Coin Marketplace

STEEM 0.26
TRX 0.12
JST 0.031
BTC 56792.82
ETH 2874.63
USDT 1.00
SBD 3.67