Computer-Generated Chess Problem 02606

in #chess5 years ago

Now, here we have a 'KRBBP vs krpp' 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 been seen by human eyes. This problem with 9 pieces goes even beyond that and was therefore composed without any such help.


4K3/4p2B/5k2/2B2p2/5P2/3R4/2r5/8 w - - 0 1
White to Play and Mate in 3
Chesthetica v11.09 (Selangor, Malaysia)
Generated on 17 Apr 2019 at 2:31:53 AM
Solvability Estimate = Difficult

If you notice any version of Chesthetica 'skipped' from one problem to the next, that simply means additional (minor) changes were made to the program before it was set to run again. White is significantly ahead in material. Why not time yourself how long it took you to solve this? Collectively, these puzzles are intended to cater to players of all levels.

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

Coin Marketplace

STEEM 0.16
TRX 0.15
JST 0.029
BTC 54933.05
ETH 2284.16
USDT 1.00
SBD 2.31