Computer-Generated Chess Problem 02608
Published online for the first time, consider this KQNNP vs krp three-move chess problem generated autonomously by a computer using the DSNS computational creativity approach which doesn't use any kind of traditional AI. Chesthetica has the creative ability to compose positions that may otherwise take centuries to arise in an actual game, if ever. 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 8 pieces goes even beyond that and was therefore composed without any such help.
White to Play and Mate in 3
Chesthetica v11.09 (Selangor, Malaysia)
Generated on 17 Apr 2019 at 4:30:31 PM
These chess puzzles are published in order based on the composition date and time stamp above. Due to the sheer volume of compositions generated, the latest ones may therefore only be published later on. 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. Solving chess puzzles like this is probably good for your health as it keeps your brain active. Nobody wants something like early-onset Alzheimer's.
A Similar Chess Problem by Chesthetica: 02003
Main Line of the Solution (Skip to 0:35)