1
$\begingroup$

I asked this on a computer chess forum (programmers hang out there, etc.) and got no substantive answers, which makes me think it's a research question. Whether it's sufficiently mathematical is iffier, so I hope it's ok for here (the site has a chess tag after all).

I'm looking for search strategies to find solutions to the Babson task using a computer. The Task is a chess-problem composition challenge proposed by Joseph Ney Babson in 1884, to create a mate-in-$n$ chess position such that:

  1. White moves;
  2. Black defends by promoting a pawn (possibly underpromotion);
  3. White wins by promoting her own pawn to the exact same piece that black promoted to. E.g. if Black promoted to a bishop, then White must also promote to a bishop in order to mate, since other promotions leave stalemate traps or other escapes.

The Task stayed unsolved for almost 100 years, before Leonid Yarosh published the first satisfactory solutions in the early 1980s. A dozen or so further solutions have been found since then, but it's still considered very difficult. I use the term "Babson Task" to refer to the challenge of composing such positions, as opposed to the individual positions (chess problems) that represent solutions to the Task.

The linked Wikipedia article discusses the Task's history and solutions and has some good further links. Before Yarosh's first solution, top composer Pierre Drumare worked on the problem for 20 years, publishing partial solutions along the way before finally giving up and saying the full task was probably impossible. Tim Krabbé (1986) published a book in Dutch called "De Man die de Babson Task wilde maken" (The man who wanted to make the Babson task), about Drumare's unsuccessful quest. Krabbé also has a good article about Yarosh's 1983 solution.

Anyway, I know how a conventional chessplaying engine works (search the move tree, with some obvious scoring heuristics plus a few branch-selection tricks like alpha-beta pruning) but have only the vaguest thoughts of how to search for a solution to this sort of constraint problem. I don't know even how a human goes about it (I play chess a little but don't know anything about problem composition other than this task).

Thanks for any advice.

$\endgroup$
  • $\begingroup$ I recommend asking on computer science fora, as they are interested in certain kinds of search problems. I would start by looking at (and enumerating) small groupings where 1 and 2 are achieved by computer search. When you have a few million groupings, you can try classifying them and select some of those and extend them to satisfy 3. Gerhard "Creative Chess Composition Challenges Computation" Paseman, 2018.03.26. $\endgroup$ – Gerhard Paseman Mar 27 '18 at 5:43
  • $\begingroup$ Thanks, Gerald. I might try that after waiting a while here, to not have the same question active in more than one forum at the same time. $\endgroup$ – anonymous Mar 27 '18 at 19:27
  • $\begingroup$ Just to check: the rules are that all moves are forced in the sense that any deviation from the strategy by the white results in the possibility for the black to resist longer and any deviation by the black results in mating in fewer moves, or you also want to allow some leeway? The forced search may be a bit easier going backwards (especially if $n$ is reasonably small) and cutting off anything that violates the forcing condition but this all is just a pure speculation on my side. $\endgroup$ – fedja Mar 27 '18 at 23:14

Your Answer

By clicking "Post Your Answer", you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.