Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Incubator Q&A

Welcome to the staging ground for new communities! Each proposal has a description in the "Descriptions" category and a body of questions and answers in "Incubator Q&A". You can ask questions (and get answers, we hope!) right away, and start new proposals.

Are you here to participate in a specific proposal? Click on the proposal tag (with the dark outline) to see only posts about that proposal and not all of the others that are in progress. Tags are at the bottom of each post.

What is the maximum number of Amazons that can be placed on a 5x5 chessboard so that no piece attacks another? Question

+3
−0

An Amazon is a fairy chess piece that can move like a queen or a knight.

What is the maximum number of Amazons that can be placed on a 5x5 chessboard so that no piece attacks another?

Wikipedia depiction of an Amazon


Attribution:

Puzzle: me
Image of Amazon: Wikipedia

History

0 comment threads

1 answer

+2
−0
Answer4 amazons.
Achieving the claimed result
.A...
....A
.....
A....
...A.
The claimed result is optimal

If we have five amazons then every rank and file must have one. Consider the central file. Up to symmetry there are three squares where we can place an amazon, and each of them permits at most two more non-attacking amazons.

..A..
.....
.....
??.??
??.??

.....
..A..
.....
.....
??.??

.....
.....
..A..
.....
.....

Comments

The solution is unique up to symmetries of the square.

I'm not certain where I saw this problem first: I think it was MathOverflow, but I can't find the relevant Q&A. A mathematical resource on non-attacking chess and fairy chess pieces is Kotěšovec, Non-attacking chess pieces (see section 7.1 for amazons, although it is slightly misleading on this particular problem).

History

0 comment threads

Sign up to answer this question »