New answers tagged

3 votes

Checkmate N Kings with M Knights Perfectly

If I'm not missing something these are
user avatar
  • 12.3k
1 vote

Checkmate N Kings with M Knights Perfectly

The answer I got is : The position(s): Position number 1: Position number 2:
user avatar
  • 1,032
4 votes

Checkmate N Kings with M Knights Perfectly

I'll stand by my initial comment: All kings should be attacked by at least two knights. If any king is attacked by only one knight, the attacking knight must not be threatened by another king. This ...
user avatar
1 vote

Checkmate N Kings with M Knights

The answer I found is: Explanation:
user avatar
  • 1,032
20 votes
Accepted

Checkmate N Kings with M Knights

50 Kings,14 Knights: This is optimal but not unique, see bottom of this answer. Reasoning: I think the problem is equivalent to covering every square on the board with as few knights as possible and ...
user avatar
  • 12.3k
10 votes

Checkmate N Kings with M Knights

This seems like it could be optimal [Edit: it is not - see loopy walt's answer]: 16 knights, and 48 kings.
user avatar
16 votes
Accepted

The Game of Golden Squares

I've achieved tiles, and can prove that this is the optimal solution. Reasoning: Golly 4.0+ pastable RLE of this solution: ...
user avatar
  • 4,454
2 votes

The Game of Golden Squares

While I cannot beat loopywalt's answer, my construction got just over halfway there. I'm posting it in case it sparks ideas for better constructions.
user avatar
1 vote

The Game of Golden Squares

I can get up to How do:
user avatar
  • 5,492
8 votes

The Game of Golden Squares

Update: Up to by introducing a small asymmetry Update ends. Original answer: I can do using this setup. This is essentially a big Over time (1275 turns) this will fill up to a First few groups ...
user avatar
  • 12.3k

Top 50 recent answers are included