I wonder how one would code the composition of a Babson task? My first thought would be to use a genetic algorithm. Maybe there's a way to work backwards from the checkmate.
Tim Krabbe (link) has written a book about the Babson Task challenge. Didn't he used to be a contributor to R.G.C.C.? Maybe even this forum for a period? For all its faults, RGCC did have some quality contributors! Either that or my memory is playing tricks on me.
Human chess is partly about tactics and strategy, but mostly about memory
, quoted out of an older one thread, and it deals with Babson task too, regards
One nice aesthetic feature of the Costeff study as compared to the Yarosh problem is that the rook promotion stalemate in the Costeff study requires that one of the white pieces vacate the line between the black rook and the black king, which allows the stalemate. In the Yarosh problem, the stalemate line is right there and the rook just needs to move to it. There are technical terms for these distinctions which, unfortunately, I do not know, but one can just tell intuitively that the Costeff rook stalemate feels more surprising.