= 27d567bc2d48d9f40e9ccc20ea370b15)
TrE comments on A puzzle - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (44)
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.
The puzzle is for those 16 initial pieces put anywhere on the chessboard. The color is not an issue.
Do the bishops have to be in legal positions? EDIT: already answered
They can be anywhere. The same color, too.
For now just solve the puzzle as it is. The color does not matter, it is there just for the stating explanation. "the 16 white pieces" can be mixed colors, doesn't matter.
It would matter for pieces like pawns who can only attack and move in one direction, probably.