All neighbor sum is 0 on a chessboard
Neighbor cells of a cell is defined as all the cells where they have common edge of a cell in a matrix. A matrix is formed by putting numerical values in each cell with real numbers.
Form a matrix with the dimension of $8$x$8$ (like a chessboard) where sum of all neighbors of each cell will be $0$.
What is the least amount of 0 valued cells possible after forming the matrix?
mathematics logical-deduction
add a comment |
Neighbor cells of a cell is defined as all the cells where they have common edge of a cell in a matrix. A matrix is formed by putting numerical values in each cell with real numbers.
Form a matrix with the dimension of $8$x$8$ (like a chessboard) where sum of all neighbors of each cell will be $0$.
What is the least amount of 0 valued cells possible after forming the matrix?
mathematics logical-deduction
add a comment |
Neighbor cells of a cell is defined as all the cells where they have common edge of a cell in a matrix. A matrix is formed by putting numerical values in each cell with real numbers.
Form a matrix with the dimension of $8$x$8$ (like a chessboard) where sum of all neighbors of each cell will be $0$.
What is the least amount of 0 valued cells possible after forming the matrix?
mathematics logical-deduction
Neighbor cells of a cell is defined as all the cells where they have common edge of a cell in a matrix. A matrix is formed by putting numerical values in each cell with real numbers.
Form a matrix with the dimension of $8$x$8$ (like a chessboard) where sum of all neighbors of each cell will be $0$.
What is the least amount of 0 valued cells possible after forming the matrix?
mathematics logical-deduction
mathematics logical-deduction
edited yesterday
Oray
asked yesterday
OrayOray
15.6k435150
15.6k435150
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
This works for any given $a,b,c,d$:
$$begin{array} {|c|c|c|c|c|c|c|c|}hline a&b&c&d&d&c&b&a\hline -b&-a-c&-b-d&-c-d&-c-d&-b-d&-a-c&-b\hline c&b+d&a+c+d&b+c+d&b+c+d&a+c+d&b+d&c\hline -d&-c-d&-b-c-d&-a-b-c-d&-a-b-c-d&-b-c-d&-c-d&-d\hline d&c+d&b+c+d&a+b+c+d&a+b+c+d&b+c+d&c+d&d\hline -c&-b-d&-a-c-d&-b-c-d&-b-c-d&-a-c-d&-b-d&-c\hline b&a+c&b+d&c+d&c+d&b+d&a+c&b\hline -a&-b&-c&-d&-d&-c&-b&-a\hline end{array}$$
so:
zero zeroes are needed (for example, $a,b,c,dgt0$)
Following @Jaap's comment:
$$begin{array} {|c|c|c|c|c|c|c|c|}hline a&h&c&g&d&f&b&e\hline -h&-a-c&-h-g&-c-d&-f-g&-b-d&-e-f&-b\hline c&g+h&a+c+d&f+g+h&b+c+d&e+f+h&b+d&f\hline -g&-c-d&-f-g-h&-a-b-c-d&-e-f-g-h&-b-c-d&-f-h&-d\hline d&f+g&b+c+d&e+f+g+h&a+b+c+d&f+g+h&c+d&g\hline -f&-b-d&-e-f-g&-b-c-d&-f-g-h&-a-c-d&-g-h&-c\hline b&e+f&b+d&f+h&c+d&g+h&a+c&h\hline -e&-b&-f&-d&-g&-c&-h&-a\hline end{array}$$
6
You could consider the white squares of the chessboard separately from the black squares, treating them as independent, identical puzzles. You have given those two sets the same (mirrored) solution, but you can choose different $a,b,c,d$ for them. This gives you the most generic parametric solution, with 8 variables on the first row of the board.
– Jaap Scherphuis
yesterday
add a comment |
Least amount of zero valued cells is
zero
One such possible grid is:
Because the grid size is even in both directions, I used the following algorithms to fill it:
1. Fill 1 (or -1) in first two cells. Some other number will also work.
2. Copy the same number to the second end of row and zero sum inverse in opposite col (or vice versa).
3. Fill rest of the number in a way that constraints are met.
4. If any of the cells is zero, try with different numbers.
I got the above algorithm as an intuition. I am still figuring an easy way to explain/prove why does it work?
add a comment |
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%2f78188%2fall-neighbor-sum-is-0-on-a-chessboard%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
This works for any given $a,b,c,d$:
$$begin{array} {|c|c|c|c|c|c|c|c|}hline a&b&c&d&d&c&b&a\hline -b&-a-c&-b-d&-c-d&-c-d&-b-d&-a-c&-b\hline c&b+d&a+c+d&b+c+d&b+c+d&a+c+d&b+d&c\hline -d&-c-d&-b-c-d&-a-b-c-d&-a-b-c-d&-b-c-d&-c-d&-d\hline d&c+d&b+c+d&a+b+c+d&a+b+c+d&b+c+d&c+d&d\hline -c&-b-d&-a-c-d&-b-c-d&-b-c-d&-a-c-d&-b-d&-c\hline b&a+c&b+d&c+d&c+d&b+d&a+c&b\hline -a&-b&-c&-d&-d&-c&-b&-a\hline end{array}$$
so:
zero zeroes are needed (for example, $a,b,c,dgt0$)
Following @Jaap's comment:
$$begin{array} {|c|c|c|c|c|c|c|c|}hline a&h&c&g&d&f&b&e\hline -h&-a-c&-h-g&-c-d&-f-g&-b-d&-e-f&-b\hline c&g+h&a+c+d&f+g+h&b+c+d&e+f+h&b+d&f\hline -g&-c-d&-f-g-h&-a-b-c-d&-e-f-g-h&-b-c-d&-f-h&-d\hline d&f+g&b+c+d&e+f+g+h&a+b+c+d&f+g+h&c+d&g\hline -f&-b-d&-e-f-g&-b-c-d&-f-g-h&-a-c-d&-g-h&-c\hline b&e+f&b+d&f+h&c+d&g+h&a+c&h\hline -e&-b&-f&-d&-g&-c&-h&-a\hline end{array}$$
6
You could consider the white squares of the chessboard separately from the black squares, treating them as independent, identical puzzles. You have given those two sets the same (mirrored) solution, but you can choose different $a,b,c,d$ for them. This gives you the most generic parametric solution, with 8 variables on the first row of the board.
– Jaap Scherphuis
yesterday
add a comment |
This works for any given $a,b,c,d$:
$$begin{array} {|c|c|c|c|c|c|c|c|}hline a&b&c&d&d&c&b&a\hline -b&-a-c&-b-d&-c-d&-c-d&-b-d&-a-c&-b\hline c&b+d&a+c+d&b+c+d&b+c+d&a+c+d&b+d&c\hline -d&-c-d&-b-c-d&-a-b-c-d&-a-b-c-d&-b-c-d&-c-d&-d\hline d&c+d&b+c+d&a+b+c+d&a+b+c+d&b+c+d&c+d&d\hline -c&-b-d&-a-c-d&-b-c-d&-b-c-d&-a-c-d&-b-d&-c\hline b&a+c&b+d&c+d&c+d&b+d&a+c&b\hline -a&-b&-c&-d&-d&-c&-b&-a\hline end{array}$$
so:
zero zeroes are needed (for example, $a,b,c,dgt0$)
Following @Jaap's comment:
$$begin{array} {|c|c|c|c|c|c|c|c|}hline a&h&c&g&d&f&b&e\hline -h&-a-c&-h-g&-c-d&-f-g&-b-d&-e-f&-b\hline c&g+h&a+c+d&f+g+h&b+c+d&e+f+h&b+d&f\hline -g&-c-d&-f-g-h&-a-b-c-d&-e-f-g-h&-b-c-d&-f-h&-d\hline d&f+g&b+c+d&e+f+g+h&a+b+c+d&f+g+h&c+d&g\hline -f&-b-d&-e-f-g&-b-c-d&-f-g-h&-a-c-d&-g-h&-c\hline b&e+f&b+d&f+h&c+d&g+h&a+c&h\hline -e&-b&-f&-d&-g&-c&-h&-a\hline end{array}$$
6
You could consider the white squares of the chessboard separately from the black squares, treating them as independent, identical puzzles. You have given those two sets the same (mirrored) solution, but you can choose different $a,b,c,d$ for them. This gives you the most generic parametric solution, with 8 variables on the first row of the board.
– Jaap Scherphuis
yesterday
add a comment |
This works for any given $a,b,c,d$:
$$begin{array} {|c|c|c|c|c|c|c|c|}hline a&b&c&d&d&c&b&a\hline -b&-a-c&-b-d&-c-d&-c-d&-b-d&-a-c&-b\hline c&b+d&a+c+d&b+c+d&b+c+d&a+c+d&b+d&c\hline -d&-c-d&-b-c-d&-a-b-c-d&-a-b-c-d&-b-c-d&-c-d&-d\hline d&c+d&b+c+d&a+b+c+d&a+b+c+d&b+c+d&c+d&d\hline -c&-b-d&-a-c-d&-b-c-d&-b-c-d&-a-c-d&-b-d&-c\hline b&a+c&b+d&c+d&c+d&b+d&a+c&b\hline -a&-b&-c&-d&-d&-c&-b&-a\hline end{array}$$
so:
zero zeroes are needed (for example, $a,b,c,dgt0$)
Following @Jaap's comment:
$$begin{array} {|c|c|c|c|c|c|c|c|}hline a&h&c&g&d&f&b&e\hline -h&-a-c&-h-g&-c-d&-f-g&-b-d&-e-f&-b\hline c&g+h&a+c+d&f+g+h&b+c+d&e+f+h&b+d&f\hline -g&-c-d&-f-g-h&-a-b-c-d&-e-f-g-h&-b-c-d&-f-h&-d\hline d&f+g&b+c+d&e+f+g+h&a+b+c+d&f+g+h&c+d&g\hline -f&-b-d&-e-f-g&-b-c-d&-f-g-h&-a-c-d&-g-h&-c\hline b&e+f&b+d&f+h&c+d&g+h&a+c&h\hline -e&-b&-f&-d&-g&-c&-h&-a\hline end{array}$$
This works for any given $a,b,c,d$:
$$begin{array} {|c|c|c|c|c|c|c|c|}hline a&b&c&d&d&c&b&a\hline -b&-a-c&-b-d&-c-d&-c-d&-b-d&-a-c&-b\hline c&b+d&a+c+d&b+c+d&b+c+d&a+c+d&b+d&c\hline -d&-c-d&-b-c-d&-a-b-c-d&-a-b-c-d&-b-c-d&-c-d&-d\hline d&c+d&b+c+d&a+b+c+d&a+b+c+d&b+c+d&c+d&d\hline -c&-b-d&-a-c-d&-b-c-d&-b-c-d&-a-c-d&-b-d&-c\hline b&a+c&b+d&c+d&c+d&b+d&a+c&b\hline -a&-b&-c&-d&-d&-c&-b&-a\hline end{array}$$
so:
zero zeroes are needed (for example, $a,b,c,dgt0$)
Following @Jaap's comment:
$$begin{array} {|c|c|c|c|c|c|c|c|}hline a&h&c&g&d&f&b&e\hline -h&-a-c&-h-g&-c-d&-f-g&-b-d&-e-f&-b\hline c&g+h&a+c+d&f+g+h&b+c+d&e+f+h&b+d&f\hline -g&-c-d&-f-g-h&-a-b-c-d&-e-f-g-h&-b-c-d&-f-h&-d\hline d&f+g&b+c+d&e+f+g+h&a+b+c+d&f+g+h&c+d&g\hline -f&-b-d&-e-f-g&-b-c-d&-f-g-h&-a-c-d&-g-h&-c\hline b&e+f&b+d&f+h&c+d&g+h&a+c&h\hline -e&-b&-f&-d&-g&-c&-h&-a\hline end{array}$$
edited yesterday
answered yesterday
JonMark PerryJonMark Perry
17.8k63686
17.8k63686
6
You could consider the white squares of the chessboard separately from the black squares, treating them as independent, identical puzzles. You have given those two sets the same (mirrored) solution, but you can choose different $a,b,c,d$ for them. This gives you the most generic parametric solution, with 8 variables on the first row of the board.
– Jaap Scherphuis
yesterday
add a comment |
6
You could consider the white squares of the chessboard separately from the black squares, treating them as independent, identical puzzles. You have given those two sets the same (mirrored) solution, but you can choose different $a,b,c,d$ for them. This gives you the most generic parametric solution, with 8 variables on the first row of the board.
– Jaap Scherphuis
yesterday
6
6
You could consider the white squares of the chessboard separately from the black squares, treating them as independent, identical puzzles. You have given those two sets the same (mirrored) solution, but you can choose different $a,b,c,d$ for them. This gives you the most generic parametric solution, with 8 variables on the first row of the board.
– Jaap Scherphuis
yesterday
You could consider the white squares of the chessboard separately from the black squares, treating them as independent, identical puzzles. You have given those two sets the same (mirrored) solution, but you can choose different $a,b,c,d$ for them. This gives you the most generic parametric solution, with 8 variables on the first row of the board.
– Jaap Scherphuis
yesterday
add a comment |
Least amount of zero valued cells is
zero
One such possible grid is:
Because the grid size is even in both directions, I used the following algorithms to fill it:
1. Fill 1 (or -1) in first two cells. Some other number will also work.
2. Copy the same number to the second end of row and zero sum inverse in opposite col (or vice versa).
3. Fill rest of the number in a way that constraints are met.
4. If any of the cells is zero, try with different numbers.
I got the above algorithm as an intuition. I am still figuring an easy way to explain/prove why does it work?
add a comment |
Least amount of zero valued cells is
zero
One such possible grid is:
Because the grid size is even in both directions, I used the following algorithms to fill it:
1. Fill 1 (or -1) in first two cells. Some other number will also work.
2. Copy the same number to the second end of row and zero sum inverse in opposite col (or vice versa).
3. Fill rest of the number in a way that constraints are met.
4. If any of the cells is zero, try with different numbers.
I got the above algorithm as an intuition. I am still figuring an easy way to explain/prove why does it work?
add a comment |
Least amount of zero valued cells is
zero
One such possible grid is:
Because the grid size is even in both directions, I used the following algorithms to fill it:
1. Fill 1 (or -1) in first two cells. Some other number will also work.
2. Copy the same number to the second end of row and zero sum inverse in opposite col (or vice versa).
3. Fill rest of the number in a way that constraints are met.
4. If any of the cells is zero, try with different numbers.
I got the above algorithm as an intuition. I am still figuring an easy way to explain/prove why does it work?
Least amount of zero valued cells is
zero
One such possible grid is:
Because the grid size is even in both directions, I used the following algorithms to fill it:
1. Fill 1 (or -1) in first two cells. Some other number will also work.
2. Copy the same number to the second end of row and zero sum inverse in opposite col (or vice versa).
3. Fill rest of the number in a way that constraints are met.
4. If any of the cells is zero, try with different numbers.
I got the above algorithm as an intuition. I am still figuring an easy way to explain/prove why does it work?
edited yesterday
answered yesterday
Mohit JainMohit Jain
2,8551841
2,8551841
add a comment |
add a comment |
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.
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%2fpuzzling.stackexchange.com%2fquestions%2f78188%2fall-neighbor-sum-is-0-on-a-chessboard%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