Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

8
  • $\begingroup$ What a beautiful investigation. If you add a bounty, I suspect you'll get more clarity on the remaining 3 cases. $\endgroup$ Commented Feb 14 at 13:41
  • $\begingroup$ Thank you! I have fully solved the problem. $\endgroup$ Commented Feb 14 at 16:24
  • 1
    $\begingroup$ I hate to ask this but won't your 15 and 19 approaches be cut short by 5fold repetition? $\endgroup$
    – loopy walt
    Commented Feb 15 at 0:43
  • 1
    $\begingroup$ @loopywalt I forgot to take that into consideration! I have revised those positions. $\endgroup$ Commented Feb 15 at 6:02
  • $\begingroup$ This is great work! Couple of nits however. (1) If the position has check or parity applies, then it can only be achieved with one player on the move. For example, the initial game array can only be achieved 11 times. (2) Your question says that you are counting repetitions of diagram+whose move, but this answer is just counting repetitions of diagram. See also puzzling.stackexchange.com/questions/125524/… $\endgroup$
    – Laska
    Commented Feb 28 at 7:53