New answers tagged checkerboard
3
votes
1
vote
Checkmate N Kings with M Knights Perfectly
The answer I got is :
The position(s):
Position number 1:
Position number 2:
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 ...
1
vote
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 ...
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.
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:
...
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.
1
vote
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 ...
Top 50 recent answers are included
Related Tags
checkerboard × 177mathematics × 72
chess × 66
combinatorics × 39
optimization × 38
strategy × 17
logical-deduction × 14
game × 13
geometry × 11
tiling × 11
knight-moves × 11
algorithm × 8
dissection × 8
board-games × 7
graph-theory × 6
cellular-automata × 6
no-computers × 5
cipher × 4
visual × 4
puzzle-creation × 4
construction × 4
reachability × 4
computer-puzzle × 3
probability × 3
pattern × 2