0

What is the formula or piecewise function that gives how many moves [or half moves (plies)] are the DTMs if there are multiple checkmate variations (Depth to Mate ignoring 50-move rule) for a random $N$-piece chess position if any checkmate exists?

Also consider the positions that there is only one checkmate variation. And $N$ is at most 32. DTM is the number of moves for one side to checkmate the other [or half moves (plies)] while ensuring optimal play from White and Black.

Without neglecting ONLY THE MANDATORY FIDE draw rules and the DEAD POSITION rule.

Assume that the losing side tries to maximize DTM and the winning side tries to minimize DTM (Losing side fighting to delay checkmate, winning side trying to deliver the checkmate as quickly as possible) such that both sides play optimally starting from the position.

David Krell
  • 470
nirates biadenroc
  • 29
  • 4
  • 3
    Welcome to math.SE! This is a question-and-answer site. Please ask a question rather than telling us what to do in the imperative mood. (Also, you’ll probably need to explain some of the chess lingo for everyone to be able to understand your question.) – joriki Mar 18 '24 at 18:57
  • It seems very implausible that there's a general formula here. – Misha Lavrov Mar 19 '24 at 15:00
  • But we have finitely many data points, so we can do functional fitting. – nirates biadenroc Mar 19 '24 at 15:17

0 Answers0