1

Rook Roundtrip

In the picture, you see the longest roundtrip of a rook such that there are no "shortcuts" - imagine the target squares are given, then at each square you have exactly two other given squares accessible to the rook, and they connect to a round trip. (Trivially the longest rook trip length is 2*8.)

What are the values for the other officers? Q and N are most interesting. (I think I know the maximum for N.)

Note: a1-b1-c1 is forbidden, even if you can't go from a1 to c1 if something stands on b1.

Son of Note: You could formulate this problem far simpler: "Place m queens (knights,...) such that all queens are protected twice". But it's not the same problem anymore - the Qa6 will never "touch" Qh3.

Not a roundtrip

Improve this question
4
  • 3
    Can you explain the details further? Maybe with some small examples.. I couldn't understand what is a "roundtrip".
    – Minot
    Apr 26 at 6:42
  • 2
    @Minot you are looking for a cyclic list of squares such that (i) each pair of consecutive squares is a [queen's] move apart, and (ii) no non-consecutive pair is a [queen's] move apart.
    – Especially Lime
    Apr 26 at 8:09
  • 1
    Queen looks to be 10 but I can't prove it
    – Andrew Chin
    Apr 26 at 10:41
  • 1
    @AndrewChin: Ditto. (A computer search will take...long :-)
    – Hauke Reddmann
    Apr 26 at 18:07

1 Answer 1

Reset to default
1

Here are my attempts for Q and N.

Q record?

Observe that I didn't use g&h at all, maybe 11 are possible after all.

N record?

Improve this answer

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Not the answer you're looking for? Browse other questions tagged or ask your own question.