Just another puzzle for fun!

A discovered check is defined as “when a piece moves, while not giving check itself, as to let a piece behind deliver a check.”

What’s the highest possible number of checkmates in one in regards to discovered checkmates?

Promoted pieces are allowed. It must be all be legal. Here’s my research. Discovered Checks: 64

enter image description here
The Breakdown: Rb7-12, Rc4-12, Bd3-7, Be5-13, Re6-8, Rg2-12

  • 4
    $\begingroup$ Please read the consensus reached by the community on meta: puzzling.meta.stackexchange.com/q/6617/48337. $\endgroup$ – noedne Apr 26 at 12:59
  • 3
    $\begingroup$ By the definition I see there, this is not open-ended. No answers will invalidate one another and this can be solved years later. $\endgroup$ – Rewan Demontay Apr 26 at 13:03
  • 3
    $\begingroup$ According to the proposal, optimization questions "should have a provably best answer (ideally, not one that needs heavy programming or mathematics to prove...)." Do you know that you can prove an optimum solution without brute force programming? $\endgroup$ – noedne Apr 26 at 13:12
  • 3
    $\begingroup$ Let us continue this discussion in chat. $\endgroup$ – noedne Apr 26 at 13:18
  • 4
    $\begingroup$ @Randal'Thor It does however, fall dangerously close to the line that we are trying to draw in the "optimization" category - see Deusovi's answer. Optimizations questions like this are essentially open-ended unless there is a way to prove that an answer is or is not optimal. I don't know that there is a way for this question, so I'm undecided as to its on-topicness. $\endgroup$ – Brandon_J Apr 26 at 17:26

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.