What is the least number of knights needed to cover the entire board?
up vote
1
down vote
favorite
I’ve seen the solutions to the lowest amount of queens, bishps, 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
asked 3 hours ago
Rewan Demontay
425
add a comment |
up vote
1
down vote
favorite
I’ve seen the solutions to the lowest amount of queens, bishps, 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
asked 3 hours ago
Rewan Demontay
425
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
I’ve seen the solutions to the lowest amount of queens, bishps, 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
asked 3 hours ago
Rewan Demontay
425
I’ve seen the solutions to the lowest amount of queens, bishps, 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
asked 3 hours ago
Rewan Demontay
425
asked 3 hours ago
Rewan Demontay
425
asked 3 hours ago
Rewan Demontay
425
asked 3 hours ago
Rewan Demontay
425
asked 3 hours ago
Rewan Demontay
425
425
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
2
down vote
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
answered 2 hours ago
user1583209
11.7k11452
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',
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
up vote
2
down vote
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
answered 2 hours ago
user1583209
11.7k11452
add a comment |
up vote
2
down vote
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
answered 2 hours ago
user1583209
11.7k11452
add a comment |
up vote
2
down vote
up vote
2
down vote
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
answered 2 hours ago
user1583209
11.7k11452
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
answered 2 hours ago
user1583209
11.7k11452
edited 2 hours ago
answered 2 hours ago
user1583209
11.7k11452
answered 2 hours ago
user1583209
11.7k11452
answered 2 hours ago
user1583209
11.7k11452
11.7k11452
add a comment |
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
