{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-04-06T14:01:22.000Z","description":"Problems submitted by members of the MATLAB Central community.","is_default":true,"created_by":161519,"badge_id":null,"featured":false,"trending":false,"solution_count_in_trending_period":0,"trending_last_calculated":"2026-04-06T00:00:00.000Z","image_id":null,"published":true,"community_created":false,"status_id":2,"is_default_group_for_player":false,"deleted_by":null,"deleted_at":null,"restored_by":null,"restored_at":null,"description_opc":null,"description_html":null,"published_at":null},"problems":[{"id":1488,"title":"Generate binary combinations for a given number of bit(s)","description":"Generate the binary combination as in the example below.\r\n \r\nExample: If you are given: \r\n\r\n bin_comb(2)\r\n\r\nThe answer will be:  \r\n\r\n 0 0\r\n 0 1\r\n 1 0\r\n 1 1\r\n\r\nThe answer will appear in double class.\r\n","description_html":"\u003cp\u003eGenerate the binary combination as in the example below.\u003c/p\u003e\u003cp\u003eExample: If you are given:\u003c/p\u003e\u003cpre\u003e bin_comb(2)\u003c/pre\u003e\u003cp\u003eThe answer will be:\u003c/p\u003e\u003cpre\u003e 0 0\r\n 0 1\r\n 1 0\r\n 1 1\u003c/pre\u003e\u003cp\u003eThe answer will appear in double class.\u003c/p\u003e","function_template":"function b = bin_comb(bits)\r\n  b= expression(bits);   \r\n  % write an expression to generate binary combination for a    \r\n  % given no. of bits\r\nend","test_suite":"%%\r\nbits = 1;\r\ny_correct = [0; 1];\r\nassert(isequal(bin_comb(bits),y_correct))\r\n%%\r\nbits = 2;\r\ny_correct = [0 0;0 1; 1 0; 1 1]\r\nassert(isequal(bin_comb(bits),y_correct))\r\n%%\r\nbits = 3;\r\ny_correct = [0 0 0;0 0 1;0 1 0;0 1 1;1 0 0; 1 0 1; 1 1 0; 1 1 1]\r\nassert(isequal(bin_comb(bits),y_correct))","published":true,"deleted":false,"likes_count":2,"comments_count":5,"created_by":13514,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":95,"test_suite_updated_at":"2013-05-06T20:51:27.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2013-05-04T07:13:19.000Z","updated_at":"2025-11-23T23:24:36.000Z","published_at":"2013-05-04T07:13:19.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGenerate the binary combination as in the example below.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample: If you are given:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[ bin_comb(2)]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe answer will be:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[ 0 0\\n 0 1\\n 1 0\\n 1 1]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe answer will appear in double class.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"},{"id":42619,"title":"Flip the right coin to survive!","description":"Write a function to solve the problem mentioned below. The chessboard 8x8 matrix will be filled with coins randomly and given to you. Also the index key chosen by the warden will be given. All you need to find is the flipping index. (In testing boards 1 refers to heads whereas 0's are tails)\r\n\r\nStandard setup:\r\nA prison warden is bored, so gives two prisoners the chance to escape, but only if they can solve a puzzle. They have 30 minutes to discuss a solution, but thereafter they will be placed in solitary confinement.\r\n \r\nThe problem:\r\nOne prisoner is going to be put in front of a chessboard, with a coins on each square (such that there are 64 coins).  The coins will be tossed and placed randomly, such that heads or tails can be showing on any given square.\r\nThe warden is then going to point to a single coin and state 'This is the magic key'. The prisoner can then flip one, and only one, coin (doesn't have to be the one the warden pointed at).\r\nThe first prisoner will be escorted away, and the second prisoner brought to the chessboard. The second prisoner must then point to a single square, and state 'This is the magic key'. The prisoner has only one chance - if correct, they go free. Can the prisoners find a strategy to guess the magic key correctly? If so how?\r\n","description_html":"\u003cp\u003eWrite a function to solve the problem mentioned below. The chessboard 8x8 matrix will be filled with coins randomly and given to you. Also the index key chosen by the warden will be given. All you need to find is the flipping index. (In testing boards 1 refers to heads whereas 0's are tails)\u003c/p\u003e\u003cp\u003eStandard setup:\r\nA prison warden is bored, so gives two prisoners the chance to escape, but only if they can solve a puzzle. They have 30 minutes to discuss a solution, but thereafter they will be placed in solitary confinement.\u003c/p\u003e\u003cp\u003eThe problem:\r\nOne prisoner is going to be put in front of a chessboard, with a coins on each square (such that there are 64 coins).  The coins will be tossed and placed randomly, such that heads or tails can be showing on any given square.\r\nThe warden is then going to point to a single coin and state 'This is the magic key'. The prisoner can then flip one, and only one, coin (doesn't have to be the one the warden pointed at).\r\nThe first prisoner will be escorted away, and the second prisoner brought to the chessboard. The second prisoner must then point to a single square, and state 'This is the magic key'. The prisoner has only one chance - if correct, they go free. Can the prisoners find a strategy to guess the magic key correctly? If so how?\u003c/p\u003e","function_template":"function flip_inx = flip_survive(board,warden_key)\r\n  flip_inx  = [0 0];\r\nend","test_suite":"%%\r\nboard = [\r\n     1     1     0     1     0     0     1     1\r\n     1     1     1     1     0     0     1     0\r\n     0     0     1     1     0     1     0     1\r\n     1     1     1     0     1     1     1     0\r\n     1     1     1     1     1     0     1     1\r\n     0     0     0     0     0     0     0     0\r\n     0     1     1     1     1     0     0     1\r\n     1     0     1     0     0     1     0     1];\r\nwarden_key = [8 8];\r\nflip_correct = [5 5];\r\nassert(isequal(flip_survive(board,warden_key),flip_correct))\r\n\r\n\r\n%%\r\nboard = [\r\n     1     1     1     0     0     0     0     0\r\n     0     0     1     0     0     1     1     1\r\n     0     0     1     1     0     1     1     1\r\n     0     0     0     1     1     1     1     1\r\n     1     1     1     1     0     0     0     0\r\n     0     0     1     0     1     0     0     0\r\n     1     0     0     1     0     0     0     0\r\n     0     1     1     0     1     1     1     1];\r\nwarden_key = [4 8];\r\nflip_correct = [6 7];\r\nassert(isequal(flip_survive(board,warden_key),flip_correct))\r\n\r\n%%\r\nboard = [\r\n     1     1     1     0     1     0     0     0\r\n     1     1     0     0     0     1     1     1\r\n     1     1     0     1     1     0     0     1\r\n     0     1     0     1     1     0     0     0\r\n     1     0     0     0     0     1     1     0\r\n     1     0     0     0     0     0     1     1\r\n     0     0     0     0     0     1     1     0\r\n     1     0     1     0     0     1     0     1];\r\nwarden_key = [8 7];\r\nflip_correct = [2 7];\r\nassert(isequal(flip_survive(board,warden_key),flip_correct))\r\n\r\n%%\r\nboard = [\r\n     0     0     0     1     1     1     1     0\r\n     0     1     1     1     1     0     1     0\r\n     0     1     1     0     1     1     1     1\r\n     1     1     0     0     0     1     0     1\r\n     0     1     1     1     0     1     0     0\r\n     1     0     1     0     1     0     1     0\r\n     0     1     1     0     0     1     0     1\r\n     1     0     1     0     0     1     0     0];\r\nwarden_key = [6 6];\r\nflip_correct = [4 2];\r\nassert(isequal(flip_survive(board,warden_key),flip_correct))\r\n\r\n%%\r\nboard = [\r\n     0     0     1     1     1     1     0     1\r\n     0     0     1     1     1     0     1     0\r\n     0     1     0     0     0     0     0     1\r\n     1     1     1     0     0     0     0     0\r\n     0     0     0     1     0     0     1     1\r\n     0     1     1     0     1     0     0     1\r\n     0     0     1     0     0     1     1     1\r\n     0     0     1     1     1     0     1     0];\r\nwarden_key = [5 1];\r\nflip_correct = [5 3];\r\nassert(isequal(flip_survive(board,warden_key),flip_correct))","published":true,"deleted":false,"likes_count":2,"comments_count":6,"created_by":27005,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":4,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2015-09-19T14:39:14.000Z","updated_at":"2015-09-19T14:40:01.000Z","published_at":"2015-09-19T14:39:14.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eWrite a function to solve the problem mentioned below. The chessboard 8x8 matrix will be filled with coins randomly and given to you. Also the index key chosen by the warden will be given. All you need to find is the flipping index. (In testing boards 1 refers to heads whereas 0's are tails)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eStandard setup: A prison warden is bored, so gives two prisoners the chance to escape, but only if they can solve a puzzle. They have 30 minutes to discuss a solution, but thereafter they will be placed in solitary confinement.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe problem: One prisoner is going to be put in front of a chessboard, with a coins on each square (such that there are 64 coins). The coins will be tossed and placed randomly, such that heads or tails can be showing on any given square. The warden is then going to point to a single coin and state 'This is the magic key'. The prisoner can then flip one, and only one, coin (doesn't have to be the one the warden pointed at). The first prisoner will be escorted away, and the second prisoner brought to the chessboard. The second prisoner must then point to a single square, and state 'This is the magic key'. The prisoner has only one chance - if correct, they go free. Can the prisoners find a strategy to guess the magic key correctly? If so how?\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"problem_search":{"errors":[],"problems":[{"id":1488,"title":"Generate binary combinations for a given number of bit(s)","description":"Generate the binary combination as in the example below.\r\n \r\nExample: If you are given: \r\n\r\n bin_comb(2)\r\n\r\nThe answer will be:  \r\n\r\n 0 0\r\n 0 1\r\n 1 0\r\n 1 1\r\n\r\nThe answer will appear in double class.\r\n","description_html":"\u003cp\u003eGenerate the binary combination as in the example below.\u003c/p\u003e\u003cp\u003eExample: If you are given:\u003c/p\u003e\u003cpre\u003e bin_comb(2)\u003c/pre\u003e\u003cp\u003eThe answer will be:\u003c/p\u003e\u003cpre\u003e 0 0\r\n 0 1\r\n 1 0\r\n 1 1\u003c/pre\u003e\u003cp\u003eThe answer will appear in double class.\u003c/p\u003e","function_template":"function b = bin_comb(bits)\r\n  b= expression(bits);   \r\n  % write an expression to generate binary combination for a    \r\n  % given no. of bits\r\nend","test_suite":"%%\r\nbits = 1;\r\ny_correct = [0; 1];\r\nassert(isequal(bin_comb(bits),y_correct))\r\n%%\r\nbits = 2;\r\ny_correct = [0 0;0 1; 1 0; 1 1]\r\nassert(isequal(bin_comb(bits),y_correct))\r\n%%\r\nbits = 3;\r\ny_correct = [0 0 0;0 0 1;0 1 0;0 1 1;1 0 0; 1 0 1; 1 1 0; 1 1 1]\r\nassert(isequal(bin_comb(bits),y_correct))","published":true,"deleted":false,"likes_count":2,"comments_count":5,"created_by":13514,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":95,"test_suite_updated_at":"2013-05-06T20:51:27.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2013-05-04T07:13:19.000Z","updated_at":"2025-11-23T23:24:36.000Z","published_at":"2013-05-04T07:13:19.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"targetMode\":\"\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"targetMode\":\"\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\\n\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eGenerate the binary combination as in the example below.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eExample: If you are given:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[ bin_comb(2)]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe answer will be:\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"code\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003e\u003c![CDATA[ 0 0\\n 0 1\\n 1 0\\n 1 1]]\u003e\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe answer will appear in double class.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"},{"id":42619,"title":"Flip the right coin to survive!","description":"Write a function to solve the problem mentioned below. The chessboard 8x8 matrix will be filled with coins randomly and given to you. Also the index key chosen by the warden will be given. All you need to find is the flipping index. (In testing boards 1 refers to heads whereas 0's are tails)\r\n\r\nStandard setup:\r\nA prison warden is bored, so gives two prisoners the chance to escape, but only if they can solve a puzzle. They have 30 minutes to discuss a solution, but thereafter they will be placed in solitary confinement.\r\n \r\nThe problem:\r\nOne prisoner is going to be put in front of a chessboard, with a coins on each square (such that there are 64 coins).  The coins will be tossed and placed randomly, such that heads or tails can be showing on any given square.\r\nThe warden is then going to point to a single coin and state 'This is the magic key'. The prisoner can then flip one, and only one, coin (doesn't have to be the one the warden pointed at).\r\nThe first prisoner will be escorted away, and the second prisoner brought to the chessboard. The second prisoner must then point to a single square, and state 'This is the magic key'. The prisoner has only one chance - if correct, they go free. Can the prisoners find a strategy to guess the magic key correctly? If so how?\r\n","description_html":"\u003cp\u003eWrite a function to solve the problem mentioned below. The chessboard 8x8 matrix will be filled with coins randomly and given to you. Also the index key chosen by the warden will be given. All you need to find is the flipping index. (In testing boards 1 refers to heads whereas 0's are tails)\u003c/p\u003e\u003cp\u003eStandard setup:\r\nA prison warden is bored, so gives two prisoners the chance to escape, but only if they can solve a puzzle. They have 30 minutes to discuss a solution, but thereafter they will be placed in solitary confinement.\u003c/p\u003e\u003cp\u003eThe problem:\r\nOne prisoner is going to be put in front of a chessboard, with a coins on each square (such that there are 64 coins).  The coins will be tossed and placed randomly, such that heads or tails can be showing on any given square.\r\nThe warden is then going to point to a single coin and state 'This is the magic key'. The prisoner can then flip one, and only one, coin (doesn't have to be the one the warden pointed at).\r\nThe first prisoner will be escorted away, and the second prisoner brought to the chessboard. The second prisoner must then point to a single square, and state 'This is the magic key'. The prisoner has only one chance - if correct, they go free. Can the prisoners find a strategy to guess the magic key correctly? If so how?\u003c/p\u003e","function_template":"function flip_inx = flip_survive(board,warden_key)\r\n  flip_inx  = [0 0];\r\nend","test_suite":"%%\r\nboard = [\r\n     1     1     0     1     0     0     1     1\r\n     1     1     1     1     0     0     1     0\r\n     0     0     1     1     0     1     0     1\r\n     1     1     1     0     1     1     1     0\r\n     1     1     1     1     1     0     1     1\r\n     0     0     0     0     0     0     0     0\r\n     0     1     1     1     1     0     0     1\r\n     1     0     1     0     0     1     0     1];\r\nwarden_key = [8 8];\r\nflip_correct = [5 5];\r\nassert(isequal(flip_survive(board,warden_key),flip_correct))\r\n\r\n\r\n%%\r\nboard = [\r\n     1     1     1     0     0     0     0     0\r\n     0     0     1     0     0     1     1     1\r\n     0     0     1     1     0     1     1     1\r\n     0     0     0     1     1     1     1     1\r\n     1     1     1     1     0     0     0     0\r\n     0     0     1     0     1     0     0     0\r\n     1     0     0     1     0     0     0     0\r\n     0     1     1     0     1     1     1     1];\r\nwarden_key = [4 8];\r\nflip_correct = [6 7];\r\nassert(isequal(flip_survive(board,warden_key),flip_correct))\r\n\r\n%%\r\nboard = [\r\n     1     1     1     0     1     0     0     0\r\n     1     1     0     0     0     1     1     1\r\n     1     1     0     1     1     0     0     1\r\n     0     1     0     1     1     0     0     0\r\n     1     0     0     0     0     1     1     0\r\n     1     0     0     0     0     0     1     1\r\n     0     0     0     0     0     1     1     0\r\n     1     0     1     0     0     1     0     1];\r\nwarden_key = [8 7];\r\nflip_correct = [2 7];\r\nassert(isequal(flip_survive(board,warden_key),flip_correct))\r\n\r\n%%\r\nboard = [\r\n     0     0     0     1     1     1     1     0\r\n     0     1     1     1     1     0     1     0\r\n     0     1     1     0     1     1     1     1\r\n     1     1     0     0     0     1     0     1\r\n     0     1     1     1     0     1     0     0\r\n     1     0     1     0     1     0     1     0\r\n     0     1     1     0     0     1     0     1\r\n     1     0     1     0     0     1     0     0];\r\nwarden_key = [6 6];\r\nflip_correct = [4 2];\r\nassert(isequal(flip_survive(board,warden_key),flip_correct))\r\n\r\n%%\r\nboard = [\r\n     0     0     1     1     1     1     0     1\r\n     0     0     1     1     1     0     1     0\r\n     0     1     0     0     0     0     0     1\r\n     1     1     1     0     0     0     0     0\r\n     0     0     0     1     0     0     1     1\r\n     0     1     1     0     1     0     0     1\r\n     0     0     1     0     0     1     1     1\r\n     0     0     1     1     1     0     1     0];\r\nwarden_key = [5 1];\r\nflip_correct = [5 3];\r\nassert(isequal(flip_survive(board,warden_key),flip_correct))","published":true,"deleted":false,"likes_count":2,"comments_count":6,"created_by":27005,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":4,"test_suite_updated_at":null,"rescore_all_solutions":false,"group_id":1,"created_at":"2015-09-19T14:39:14.000Z","updated_at":"2015-09-19T14:40:01.000Z","published_at":"2015-09-19T14:39:14.000Z","restored_at":null,"restored_by":null,"spam":false,"simulink":false,"admin_reviewed":false,"description_opc":"{\"relationships\":[{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/document\",\"relationshipId\":\"rId1\",\"target\":\"/matlab/document.xml\"},{\"relationshipType\":\"http://schemas.mathworks.com/matlab/code/2013/relationships/output\",\"relationshipId\":\"rId2\",\"target\":\"/matlab/output.xml\"}],\"parts\":[{\"partUri\":\"/matlab/document.xml\",\"relationship\":[],\"contentType\":\"application/vnd.mathworks.matlab.code.document+xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\"?\u003e\u003cw:document xmlns:w=\\\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\\\"\u003e\u003cw:body\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eWrite a function to solve the problem mentioned below. The chessboard 8x8 matrix will be filled with coins randomly and given to you. Also the index key chosen by the warden will be given. All you need to find is the flipping index. (In testing boards 1 refers to heads whereas 0's are tails)\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eStandard setup: A prison warden is bored, so gives two prisoners the chance to escape, but only if they can solve a puzzle. They have 30 minutes to discuss a solution, but thereafter they will be placed in solitary confinement.\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003cw:p\u003e\u003cw:pPr\u003e\u003cw:pStyle w:val=\\\"text\\\"/\u003e\u003cw:jc w:val=\\\"left\\\"/\u003e\u003c/w:pPr\u003e\u003cw:r\u003e\u003cw:t\u003eThe problem: One prisoner is going to be put in front of a chessboard, with a coins on each square (such that there are 64 coins). The coins will be tossed and placed randomly, such that heads or tails can be showing on any given square. The warden is then going to point to a single coin and state 'This is the magic key'. The prisoner can then flip one, and only one, coin (doesn't have to be the one the warden pointed at). The first prisoner will be escorted away, and the second prisoner brought to the chessboard. The second prisoner must then point to a single square, and state 'This is the magic key'. The prisoner has only one chance - if correct, they go free. Can the prisoners find a strategy to guess the magic key correctly? If so how?\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:p\u003e\u003c/w:body\u003e\u003c/w:document\u003e\"},{\"partUri\":\"/matlab/output.xml\",\"contentType\":\"text/xml\",\"content\":\"\u003c?xml version=\\\"1.0\\\" encoding=\\\"UTF-8\\\" standalone=\\\"no\\\" ?\u003e\u003cembeddedOutputs\u003e\u003cmetaData\u003e\u003cevaluationState\u003emanual\u003c/evaluationState\u003e\u003clayoutState\u003ecode\u003c/layoutState\u003e\u003coutputStatus\u003eready\u003c/outputStatus\u003e\u003c/metaData\u003e\u003coutputArray type=\\\"array\\\"/\u003e\u003cregionArray type=\\\"array\\\"/\u003e\u003c/embeddedOutputs\u003e\"}]}"}],"term":"tag:\"communication\"","current_player_id":null,"fields":[{"name":"page","type":"integer","callback":null,"default":1,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"per_page","type":"integer","callback":null,"default":50,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"sort","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":null,"prepend":true},{"name":"body","type":"text","callback":null,"default":"*:*","directive":null,"facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":false},{"name":"group","type":"string","callback":null,"default":null,"directive":"group","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"difficulty_rating_bin","type":"string","callback":null,"default":null,"directive":"difficulty_rating_bin","facet":true,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"id","type":"integer","callback":null,"default":null,"directive":"id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"tag","type":"string","callback":null,"default":null,"directive":"tag","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"product","type":"string","callback":null,"default":null,"directive":"product","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_at","type":"timeframe","callback":{},"default":null,"directive":"created_at","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"profile_id","type":"integer","callback":null,"default":null,"directive":"author_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"created_by","type":"string","callback":null,"default":null,"directive":"author","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player_id","type":"integer","callback":null,"default":null,"directive":"solver_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"player","type":"string","callback":null,"default":null,"directive":"solver","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"solvers_count","type":"integer","callback":null,"default":null,"directive":"solvers_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"comments_count","type":"integer","callback":null,"default":null,"directive":"comments_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"likes_count","type":"integer","callback":null,"default":null,"directive":"likes_count","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leader_id","type":"integer","callback":null,"default":null,"directive":"leader_id","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true},{"name":"leading_solution","type":"integer","callback":null,"default":null,"directive":"leading_solution","facet":null,"facet_method":"and","operator":null,"param":"term","static":null,"prepend":true}],"filters":[{"name":"asset_type","type":"string","callback":null,"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":null,"static":"\"cody:problem\"","prepend":true},{"name":"profile_id","type":"integer","callback":{},"default":null,"directive":null,"facet":null,"facet_method":"and","operator":null,"param":"author_id","static":null,"prepend":true}],"query":{"params":{"per_page":50,"term":"tag:\"communication\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"communication\"","","\"","communication","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007eff85a86188\u003e":null,"#\u003cMathWorks::Search::Field:0x00007eff85a860e8\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007eff85a85828\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007eff85a86408\u003e":1,"#\u003cMathWorks::Search::Field:0x00007eff85a86368\u003e":50,"#\u003cMathWorks::Search::Field:0x00007eff85a862c8\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007eff85a86228\u003e":"tag:\"communication\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007eff85a86228\u003e":"tag:\"communication\""},"queried_facets":{}},"query_backend":{"connection":{"configuration":{"index_url":"http://index-op-v2/solr/","query_url":"http://search-op-v2/solr/","direct_access_index_urls":["http://index-op-v2/solr/"],"direct_access_query_urls":["http://search-op-v2/solr/"],"timeout":10,"vhost":"search","exchange":"search.topic","heartbeat":30,"pre_index_mode":false,"host":"rabbitmq-eks","port":5672,"username":"cody-search","password":"78X075ddcV44","virtual_host":"search","indexer":"amqp","http_logging":"true","core":"cody"},"query_connection":{"uri":"http://search-op-v2/solr/cody/","proxy":null,"connection":{"parallel_manager":null,"headers":{"User-Agent":"Faraday v1.0.1"},"params":{},"options":{"params_encoder":"Faraday::FlatParamsEncoder","proxy":null,"bind":null,"timeout":null,"open_timeout":null,"read_timeout":null,"write_timeout":null,"boundary":null,"oauth":null,"context":null,"on_data":null},"ssl":{"verify":true,"ca_file":null,"ca_path":null,"verify_mode":null,"cert_store":null,"client_cert":null,"client_key":null,"certificate":null,"private_key":null,"verify_depth":null,"version":null,"min_version":null,"max_version":null},"default_parallel_manager":null,"builder":{"adapter":{"name":"Faraday::Adapter::NetHttp","args":[],"block":null},"handlers":[{"name":"Faraday::Response::RaiseError","args":[],"block":null}],"app":{"app":{"ssl_cert_store":{"verify_callback":null,"error":null,"error_string":null,"chain":null,"time":null},"app":{},"connection_options":{},"config_block":null}}},"url_prefix":"http://search-op-v2/solr/cody/","manual_proxy":false,"proxy":null},"update_format":"RSolr::JSON::Generator","update_path":"update","options":{"url":"http://search-op-v2/solr/cody"}}},"query":{"params":{"per_page":50,"term":"tag:\"communication\"","current_player":null,"sort":"map(difficulty_value,0,0,999) asc"},"parser":"MathWorks::Search::Solr::QueryParser","directives":{"term":{"directives":{"tag":[["tag:\"communication\"","","\"","communication","\""]]}}},"facets":{"#\u003cMathWorks::Search::Field:0x00007eff85a86188\u003e":null,"#\u003cMathWorks::Search::Field:0x00007eff85a860e8\u003e":null},"filters":{"#\u003cMathWorks::Search::Field:0x00007eff85a85828\u003e":"\"cody:problem\""},"fields":{"#\u003cMathWorks::Search::Field:0x00007eff85a86408\u003e":1,"#\u003cMathWorks::Search::Field:0x00007eff85a86368\u003e":50,"#\u003cMathWorks::Search::Field:0x00007eff85a862c8\u003e":"map(difficulty_value,0,0,999) asc","#\u003cMathWorks::Search::Field:0x00007eff85a86228\u003e":"tag:\"communication\""},"user_query":{"#\u003cMathWorks::Search::Field:0x00007eff85a86228\u003e":"tag:\"communication\""},"queried_facets":{}},"options":{"fields":["id","difficulty_rating"]},"join":" "},"results":[{"id":1488,"difficulty_rating":"easy-medium"},{"id":42619,"difficulty_rating":"easy-medium"}]}}