-11
-11
FIRST THOUGHT:
King can hit at most 8 pieces = 8
Queen can hit at most 8 pieces = 8
Each rook can hit at most 4 pieces = 2x4 = 8
Each bishop can hit at most 4 pieces =2x4 = 8
Each knight can hit at most 8 pieces = 2x8 = 16
Each pawn can hit at most 2 pieces = 8x2 = 16
So obviously the true answer can't possibly be above 64 connections.
Edit to add SECOND THOUGHT:
We can reduce this further. From all columns in which there are pieces, one piece atleast occupies the leftmost column, atleast one piece the rightmost column. These pieces will have their potential attacks limited, atleast by one (if these pieces are pawns), so the true answer can't possibly be above 62 connections.
Edited to fix bad arithmetic.
Unless there's some clever structure to the optimal position, this is a problem best solved by computer search. Potentially it could make a good Project Euler problem, potentially not (depending on how much computation the best human-writable program requires to do it).
Also, this post gave the false impression that there was a known answer. That irritated me when I read the comments.
Prove it, since your answer is correct, as far as I know.
Can you answer for the case of the two sets of pieces? Black and white, 32 of them. Again the color does not matter.
Thanks! Clever trick with a rook and two bishops to reduce the length of the top boundary, I missed it.
Cebbs fxrgpu sbe n fvatyr frg: svefg, pbafvqre gjb xavtugf naq n xvat. Rnfl gb frr gurl unir ng yrnfg 4 serr pbaarpgvbaf, ab znggre ubj bgure cvrprf ner cynprq. Gura pbafvqre gur gbc obhaqnel (=cvrprf jvgu ng yrnfg bar serr hcjneq ovfubc-zbir naq ng yrnfg bar serr ebbx-zbir). Gur gbc obhaqnel pna'g or yrff guna 6 cvrprf, rnpu jvgu ng yrnfg bar serr pbaarpgvba, naq ng yrnfg bar bs gur obhaqnel cvrprf unf abguvat va gur ebjf nobir vg, fb vg unf ng yrnfg gjb serr pbaarpgvbaf. Nygbtrgure 64-(4+6+1)=53.
Then the clarification mentioned in a comment:
"the 16 white pieces" can be mixed colors, doesn't matter.
is false, because by turning the pawn of the second row, and the first pawn of the third row into black pieces, we go up to 55 connections from 53.
I mean that the following position:
achieves 55 connections, by using mixed colors. Unless my arithmetic is failing me again.
Edit to add: And unless arithmetic is failing me again, the following has 56 connections:
Yes, I know now what you mean. It is a bit different puzzle now. The color of a piece maters this way
Do you think your solution is optimal?
I meant that with mixed colors, we can have the following:
which unless my arithmetic fails me again, is 55 connections.
I'm curious as to why people downvoted this so strongly. I wouldn't be surprised to see it at -1 or -2, perhaps, but it seems undeserving of the -6 it had when I upvoted.
I'm sure most of the downvotes are sparked by the line
It's a test how clever a class or a community is.
It turns a potentially-interesting puzzle into a status game. If you don't answer it, it's because you're not clever enough. If you do, you accept that even though you're smart, Thomas is even smarter because he tells you if your answer is good enough.
So the set of pieces you can use is eight pawns, one queen, one kind, two bishops, two knights, and two rooks?
Can the bishops be placed in squares of the same colour?
Most I got by trying for 3 mins was 49, but that's probably not the max. Theoretical max would be 64, if every piece covered every other.
A technical question: Do the two bishops have to be of different colors?
EDIT: Now 50.
No. For the game to be easily generalized and 25 knights or whatever be possible to put, there is no color limitation.
Wait a minute. We are restricted to the 16 chess pieces available to white, or can we use as many pieces as we like?
Or do you want to hint that one can solve this puzzle by generalization?
I'm fairly sure we're limited to 16 chess pieces available to white, otherwise the problem can be trivially solved with 64 queens.
What do these things have in common? Nerves, emotions, morality, prices.