All neighbor sum is 0 on a chessboard












8














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







share|improve this question





























    8














    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







    share|improve this question



























      8












      8








      8


      1





      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







      share|improve this question















      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






      share|improve this question















      share|improve this question













      share|improve this question




      share|improve this question








      edited yesterday







      Oray

















      asked yesterday









      OrayOray

      15.6k435150




      15.6k435150






















          2 Answers
          2






          active

          oldest

          votes


















          12














          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}$$







          share|improve this answer



















          • 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



















          5














          Least amount of zero valued cells is




          zero




          One such possible grid is:




          enter image description here




          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?






          share|improve this answer























            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
            });


            }
            });














            draft saved

            draft discarded


















            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









            12














            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}$$







            share|improve this answer



















            • 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
















            12














            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}$$







            share|improve this answer



















            • 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














            12












            12








            12






            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}$$







            share|improve this answer














            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}$$








            share|improve this answer














            share|improve this answer



            share|improve this answer








            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














            • 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











            5














            Least amount of zero valued cells is




            zero




            One such possible grid is:




            enter image description here




            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?






            share|improve this answer




























              5














              Least amount of zero valued cells is




              zero




              One such possible grid is:




              enter image description here




              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?






              share|improve this answer


























                5












                5








                5






                Least amount of zero valued cells is




                zero




                One such possible grid is:




                enter image description here




                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?






                share|improve this answer














                Least amount of zero valued cells is




                zero




                One such possible grid is:




                enter image description here




                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?







                share|improve this answer














                share|improve this answer



                share|improve this answer








                edited yesterday

























                answered yesterday









                Mohit JainMohit Jain

                2,8551841




                2,8551841






























                    draft saved

                    draft discarded




















































                    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.




                    draft saved


                    draft discarded














                    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





















































                    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







                    -

                    Popular posts from this blog

                    An IMO inspired problem

                    Image
                    14 4 This problem from IMO 1988 is said to be one of the most elegant ones in functional equations. Problem : The function $f$ is defined on the set of all positive integers as follows: begin{align} f(1) = 1, f(3) &= 3, f(2n) = f(n), \ f(4n+1) &= 2f(2n+1) - f(n), \ f(4n+3) &= 3 f(2n+1) - 2f(n) end{align} Find the number of $n$ with $f(n) = n, 1 leq n leq 1988$. The main idea towards the solution is realizing that these conditions stand for the fact that $f(n)$ just reverses the digits in the binary representation of the number $n$. So, essentially the solution is finding the number of binary pallindromes $leq 1988_{10}$. My question is the following : How to reformulate the problem so that $f(n)$ reverses the digits of $n$ in its ternary representation. Or even better, can we reformulate it for a
                    Read more

                    Management

                    Image
                    Management From Wikipedia, the free encyclopedia Jump to navigation Jump to search "Manager" redirects here. For other uses, see Management (disambiguation) and Manager (disambiguation). An organization chart for the United States Coast Guard shows the hierarchy of managerial roles in that organization. Business administration Management of a business Accounting Management accounting Financial accounting Financial audit Business entities Cooperative Corporation Limited liability company Partnership Sole proprietorship State-owned enterprise Corporate governance Annual general meeting Board of directors Supervisory board Advisory board Audit committee Corporate law Commercial law Constitutional documents Contract Corporate crime Corporate liability Insolvency law International trade law Mergers and acquisitions Economics Commodity Pu
                    Read more

                    Has there ever been an instance of an active nuclear power plant within or near a war zone?

                    Image
                    36 3 The question Has there ever been a military combat going on around an active (running or in outage but not decommissioned) commercial nuclear power plant? Or dangerously near it? If yes, how did the plant and its personnel fare in such situation? Why I ask Let's assume for the scope of this question modern commercial nuclear power plants (CANDU, PWR, BWR of generation II plus all of gen III and newer) are usually reasonably safe to operate given that the engineering has been done right and there is a whole cohort of very well trained personnel on-site at all times, well rested and with considerable resources on their hands. Things hard to get with an armed conflict like the recent Syrian war raging around. I can't seem to find any reference or a comprehensive article about this, hence this question.
                    Read more