Computer-Generated Chess Problem 02526

in #chess5 years ago

Published online for the first time, consider this KRBBNP vs kbpp chess problem generated autonomously by a computer using the computational creativity approach which doesn't use any kind of traditional AI or even deep learning. There is no known limit to the quantity or type of compositions that can be 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 10 pieces could have been taken from such a database.


B7/K4p2/3k3B/5PR1/3N4/3b1p2/8/8 w - - 0 1
White to Play and Mate in 5
Chesthetica v11.02 (Selangor, Malaysia)
Generated on 20 Feb 2019 at 9:24:13 AM
Solvability Estimate = Difficult

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. White has a decisive material advantage in this position but the winning sequence may not be immediately clear. Did you find this one interesting or have something else to say? Leave a comment below! Note that not all the chess problems are like this. They cover quite the spectrum of solving ability and there are thousands published already. Anyway, if standard chess isn't your thing, you might instead like SSCC.

A Similar Chess Problem by Chesthetica: 01660

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

Coin Marketplace

STEEM 0.17
TRX 0.13
JST 0.027
BTC 60754.23
ETH 2913.09
USDT 1.00
SBD 2.31