Computer-Generated Chess Problem 03018

in #chess4 years ago

Now, here we have a 'KRNNP vs krrbp' mate in 3 chess problem generated autonomously by a computer program, Chesthetica, using the approach known as the DSNS from the sub-field of AI, computational creativity. 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 endgame tablebase in existence today is for 7 pieces (Lomonosov) which contains over 500 trillion positions, most of which have not and never will be seen by human eyes. This problem with 10 pieces goes even beyond that and was therefore composed without any such help whatsoever.

image.png

Nr2b3/1N6/pPk1r3/3R2K1/8/8/8/8 w - - 0 1
White to Play and Mate in 3
Chesthetica v11.86 (Selangor, Malaysia)
Generated on 14 Aug 2020 at 9:14:47 PM
Solvability Estimate = Difficult

If you notice an earlier version of Chesthetica listed with a newer problem, that simply means an earlier version may have been running on a different computer or OS user account. White actually has less material than Black yet still wins. The white army is down by about 2 (Shannon) pawn units in value. Why not time yourself how long it took you to solve this? Collectively, these puzzles are intended to cater to players of all levels.

Solution

Coin Marketplace

STEEM 0.18
TRX 0.16
JST 0.030
BTC 62804.67
ETH 2444.00
USDT 1.00
SBD 2.71