Discrete Peaceful Encampments: Player 4 has entered the game!
$begingroup$
Here's a variation of Discrete Peaceful Encampments: Player 3 has entered the game! (which itself is a variation of Peaceful Encampments).
You have 3 white queens, 3 black queens, 3 red queens, and 3 green queens. Place all these pieces onto a normal 8x8 chessboard in such a way that no queen threatens a queen of a different color.
Okay, that was easier than the previous variations, right? You can probably use the pattern you found to solve these problems as well:
Place 5 queens of each of four different colors onto a 10x10 checkerboard so that no queen threatens a queen of a different color.
Place 7 queens of each of four different colors onto a 12x12 checkerboard so that no queen threatens a queen of a different color.
Which leads to the real puzzle:
At what point does it become possible to place more than $N-5$ queens of each of four different colors peacefully onto an $Ntimes N$ checkerboard?
mathematics geometry chess checkerboard
$endgroup$
add a comment |
$begingroup$
Here's a variation of Discrete Peaceful Encampments: Player 3 has entered the game! (which itself is a variation of Peaceful Encampments).
You have 3 white queens, 3 black queens, 3 red queens, and 3 green queens. Place all these pieces onto a normal 8x8 chessboard in such a way that no queen threatens a queen of a different color.
Okay, that was easier than the previous variations, right? You can probably use the pattern you found to solve these problems as well:
Place 5 queens of each of four different colors onto a 10x10 checkerboard so that no queen threatens a queen of a different color.
Place 7 queens of each of four different colors onto a 12x12 checkerboard so that no queen threatens a queen of a different color.
Which leads to the real puzzle:
At what point does it become possible to place more than $N-5$ queens of each of four different colors peacefully onto an $Ntimes N$ checkerboard?
mathematics geometry chess checkerboard
$endgroup$
add a comment |
$begingroup$
Here's a variation of Discrete Peaceful Encampments: Player 3 has entered the game! (which itself is a variation of Peaceful Encampments).
You have 3 white queens, 3 black queens, 3 red queens, and 3 green queens. Place all these pieces onto a normal 8x8 chessboard in such a way that no queen threatens a queen of a different color.
Okay, that was easier than the previous variations, right? You can probably use the pattern you found to solve these problems as well:
Place 5 queens of each of four different colors onto a 10x10 checkerboard so that no queen threatens a queen of a different color.
Place 7 queens of each of four different colors onto a 12x12 checkerboard so that no queen threatens a queen of a different color.
Which leads to the real puzzle:
At what point does it become possible to place more than $N-5$ queens of each of four different colors peacefully onto an $Ntimes N$ checkerboard?
mathematics geometry chess checkerboard
$endgroup$
Here's a variation of Discrete Peaceful Encampments: Player 3 has entered the game! (which itself is a variation of Peaceful Encampments).
You have 3 white queens, 3 black queens, 3 red queens, and 3 green queens. Place all these pieces onto a normal 8x8 chessboard in such a way that no queen threatens a queen of a different color.
Okay, that was easier than the previous variations, right? You can probably use the pattern you found to solve these problems as well:
Place 5 queens of each of four different colors onto a 10x10 checkerboard so that no queen threatens a queen of a different color.
Place 7 queens of each of four different colors onto a 12x12 checkerboard so that no queen threatens a queen of a different color.
Which leads to the real puzzle:
At what point does it become possible to place more than $N-5$ queens of each of four different colors peacefully onto an $Ntimes N$ checkerboard?
mathematics geometry chess checkerboard
mathematics geometry chess checkerboard
asked 6 mins ago
QuuxplusoneQuuxplusone
27218
27218
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "559"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f78866%2fdiscrete-peaceful-encampments-player-4-has-entered-the-game%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Puzzling Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f78866%2fdiscrete-peaceful-encampments-player-4-has-entered-the-game%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown