Thursday, August 20, 2015

[qlendfbp] Interesting helpmates

From a given chess position, perhaps the initial position, tree search (e.g., perft) can find all the checkmate positions within some number of plies.  These positions are helpmates, because it is simply exhaustive tree search and not minimax.  Which of these helpmate sequences are aesthetically interesting?

Minimality: None of the moves by either side can be omitted (replaced with a passing move).  Also avoid subsequences of useless moves, e.g., shuffling a rook.

No comments :