[sqqpjuqh] Checkmate search among games

Take a collection of games and identify positions which are theoretically won or lost, i.e., mate in N.  Use powerful computers and algorithms to find deep mates, perhaps deeper than has been previously found.  It is a contest.

There is a little difficulty where, if someone announces a proof that a certain position is mate in N, the proof is very long: checking a purported proof is almost as difficult as coming up with it in the first place.