Retrograde analysis of chess pawn endgames can be subdivided by locations of the pawns. This is especially simple if there is only a single pawn, e.g., KNNKP, KRPKR, KQPKQ. Pawns don't move backwards, so the various cases can be computed in backward order without dependency problems.
Possibly a solution in search of a problem: retrograde analysis with extremely limited memory?
Distance to conversion includes distance to a pawn advance.
No comments :
Post a Comment