What is the least number of knights needed to cover the entire board?
I’ve seen the solutions to the lowest amount of queens, bishops, and rooks are needed to cover an entire board, as in they can attack all squares and are the only type of piece on the board. What is the solution for this with knights?
theory knights
add a comment |
I’ve seen the solutions to the lowest amount of queens, bishops, and rooks are needed to cover an entire board, as in they can attack all squares and are the only type of piece on the board. What is the solution for this with knights?
theory knights
16
What do the green squares represent?
– Pikamander2
Dec 17 at 5:52
add a comment |
I’ve seen the solutions to the lowest amount of queens, bishops, and rooks are needed to cover an entire board, as in they can attack all squares and are the only type of piece on the board. What is the solution for this with knights?
theory knights
I’ve seen the solutions to the lowest amount of queens, bishops, and rooks are needed to cover an entire board, as in they can attack all squares and are the only type of piece on the board. What is the solution for this with knights?
theory knights
theory knights
edited Dec 19 at 10:52
fkraiem
1053
1053
asked Dec 16 at 23:20
Rewan Demontay
12519
12519
16
What do the green squares represent?
– Pikamander2
Dec 17 at 5:52
add a comment |
16
What do the green squares represent?
– Pikamander2
Dec 17 at 5:52
16
16
What do the green squares represent?
– Pikamander2
Dec 17 at 5:52
What do the green squares represent?
– Pikamander2
Dec 17 at 5:52
add a comment |
1 Answer
1
active
oldest
votes
Depending on whether occupied squares need to be covered as well, the number is:
- 12 knights (without covering occupied squares)
- 14 knights (with covering occupied squares)
Problems like this are called domination problems and solutions for knights and other pieces as well as a reference are given on the wikipedia page on mathematical chess problems
You could consider increasing value of this answer by showing a layout with the resolved 14 knights [I see it as: 4 N on the 2nd rank, from C-F, 6 N on the 6th rank, from B-G, and 4 N on the 4th rank, B4, C4, F4, G4].
– Grade 'Eh' Bacon
Dec 17 at 19:45
I tried to include a diagram, but did not succeed. Is it possible to show impossible (no Kings) positions?
– user1583209
Dec 17 at 20:47
add a comment |
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "435"
};
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%2fchess.stackexchange.com%2fquestions%2f23258%2fwhat-is-the-least-number-of-knights-needed-to-cover-the-entire-board%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Depending on whether occupied squares need to be covered as well, the number is:
- 12 knights (without covering occupied squares)
- 14 knights (with covering occupied squares)
Problems like this are called domination problems and solutions for knights and other pieces as well as a reference are given on the wikipedia page on mathematical chess problems
You could consider increasing value of this answer by showing a layout with the resolved 14 knights [I see it as: 4 N on the 2nd rank, from C-F, 6 N on the 6th rank, from B-G, and 4 N on the 4th rank, B4, C4, F4, G4].
– Grade 'Eh' Bacon
Dec 17 at 19:45
I tried to include a diagram, but did not succeed. Is it possible to show impossible (no Kings) positions?
– user1583209
Dec 17 at 20:47
add a comment |
Depending on whether occupied squares need to be covered as well, the number is:
- 12 knights (without covering occupied squares)
- 14 knights (with covering occupied squares)
Problems like this are called domination problems and solutions for knights and other pieces as well as a reference are given on the wikipedia page on mathematical chess problems
You could consider increasing value of this answer by showing a layout with the resolved 14 knights [I see it as: 4 N on the 2nd rank, from C-F, 6 N on the 6th rank, from B-G, and 4 N on the 4th rank, B4, C4, F4, G4].
– Grade 'Eh' Bacon
Dec 17 at 19:45
I tried to include a diagram, but did not succeed. Is it possible to show impossible (no Kings) positions?
– user1583209
Dec 17 at 20:47
add a comment |
Depending on whether occupied squares need to be covered as well, the number is:
- 12 knights (without covering occupied squares)
- 14 knights (with covering occupied squares)
Problems like this are called domination problems and solutions for knights and other pieces as well as a reference are given on the wikipedia page on mathematical chess problems
Depending on whether occupied squares need to be covered as well, the number is:
- 12 knights (without covering occupied squares)
- 14 knights (with covering occupied squares)
Problems like this are called domination problems and solutions for knights and other pieces as well as a reference are given on the wikipedia page on mathematical chess problems
edited Dec 17 at 0:11
answered Dec 17 at 0:02
user1583209
12k21553
12k21553
You could consider increasing value of this answer by showing a layout with the resolved 14 knights [I see it as: 4 N on the 2nd rank, from C-F, 6 N on the 6th rank, from B-G, and 4 N on the 4th rank, B4, C4, F4, G4].
– Grade 'Eh' Bacon
Dec 17 at 19:45
I tried to include a diagram, but did not succeed. Is it possible to show impossible (no Kings) positions?
– user1583209
Dec 17 at 20:47
add a comment |
You could consider increasing value of this answer by showing a layout with the resolved 14 knights [I see it as: 4 N on the 2nd rank, from C-F, 6 N on the 6th rank, from B-G, and 4 N on the 4th rank, B4, C4, F4, G4].
– Grade 'Eh' Bacon
Dec 17 at 19:45
I tried to include a diagram, but did not succeed. Is it possible to show impossible (no Kings) positions?
– user1583209
Dec 17 at 20:47
You could consider increasing value of this answer by showing a layout with the resolved 14 knights [I see it as: 4 N on the 2nd rank, from C-F, 6 N on the 6th rank, from B-G, and 4 N on the 4th rank, B4, C4, F4, G4].
– Grade 'Eh' Bacon
Dec 17 at 19:45
You could consider increasing value of this answer by showing a layout with the resolved 14 knights [I see it as: 4 N on the 2nd rank, from C-F, 6 N on the 6th rank, from B-G, and 4 N on the 4th rank, B4, C4, F4, G4].
– Grade 'Eh' Bacon
Dec 17 at 19:45
I tried to include a diagram, but did not succeed. Is it possible to show impossible (no Kings) positions?
– user1583209
Dec 17 at 20:47
I tried to include a diagram, but did not succeed. Is it possible to show impossible (no Kings) positions?
– user1583209
Dec 17 at 20:47
add a comment |
Thanks for contributing an answer to Chess 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.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2fchess.stackexchange.com%2fquestions%2f23258%2fwhat-is-the-least-number-of-knights-needed-to-cover-the-entire-board%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
16
What do the green squares represent?
– Pikamander2
Dec 17 at 5:52