{"group":{"id":1,"name":"Community","lockable":false,"created_at":"2012-01-18T18:02:15.000Z","updated_at":"2026-06-05T00:10:21.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-06-05T00: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":2478,"title":"BLOCK x3 (Version 2)","description":"An extension to problem 2451 ( \u003chttps://www.mathworks.com/matlabcentral/cody/problems/2451-block-x3-version-1\u003e ).\r\n\r\nIt is based on an android game - BLOCK x3. The objective is to align the 1's in the matrix using minimum movements. The valid movements are  horizontal and vertical (by one step). A zero (0) indicates an empty space. Your task is to count minimum number of movements required to align the three 1's vertically or horizontally.\r\n\r\nNew challenge in this problem : There are some static elements which can not be moved and can not be included in the alignment. These elements are indicated by 2. This makes the problem a bit challenging.\r\n\r\nExample:\r\n\r\n\r\n  Input =[0 0 0 0 0 0 0 0;\r\n          0 0 1 0 1 0 0 0;\r\n          0 0 0 2 1 0 0 0;\r\n          0 0 0 0 0 0 0 0]\r\n  \r\n  Output = 2;\r\n","description_html":"\u003cp\u003eAn extension to problem 2451 ( \u003ca href = \"https://www.mathworks.com/matlabcentral/cody/problems/2451-block-x3-version-1\"\u003ehttps://www.mathworks.com/matlabcentral/cody/problems/2451-block-x3-version-1\u003c/a\u003e ).\u003c/p\u003e\u003cp\u003eIt is based on an android game - BLOCK x3. The objective is to align the 1's in the matrix using minimum movements. The valid movements are  horizontal and vertical (by one step). A zero (0) indicates an empty space. Your task is to count minimum number of movements required to align the three 1's vertically or horizontally.\u003c/p\u003e\u003cp\u003eNew challenge in this problem : There are some static elements which can not be moved and can not be included in the alignment. These elements are indicated by 2. This makes the problem a bit challenging.\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eInput =[0 0 0 0 0 0 0 0;\r\n        0 0 1 0 1 0 0 0;\r\n        0 0 0 2 1 0 0 0;\r\n        0 0 0 0 0 0 0 0]\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003eOutput = 2;\r\n\u003c/pre\u003e","function_template":"function y = blockx3_2(x)\r\n\r\nend","test_suite":"%%\r\n\r\nx =  [0 0 0 0 0 0 0 0;\r\n      0 0 1 0 1 0 0 0;\r\n      0 0 0 2 1 0 0 0;\r\n      0 0 0 0 0 0 0 0];\r\ny_correct = 2;\r\nassert(isequal(blockx3_2(x),y_correct));\r\n\r\n\r\n%%\r\nx =  [0 0 0 0 0 0 0 0;\r\n      0 0 1 0 1 0 0 0;\r\n      0 0 0 2 0 0 0 0;\r\n      0 0 1 0 0 0 0 0];\r\ny_correct = 3;\r\nassert(isequal(blockx3_2(x),y_correct))\r\n\r\n%%\r\nx =  [1 1 0 0 0 0 0 0;\r\n      1 2 0 0 0 0 0 0;\r\n      0 0 0 0 0 0 0 0;\r\n      0 0 0 0 0 0 0 0];\r\ny_correct = 3;\r\nassert(isequal(blockx3_2(x),y_correct))\r\n\r\n%%\r\nx =  [0 0 0 1 0 0 0 0;\r\n      0 0 1 2 1 0 0 0;\r\n      0 0 0 0 0 0 0 0;\r\n      0 0 0 0 0 0 0 0];\r\ny_correct = 2;\r\nassert(isequal(blockx3_2(x),y_correct))\r\n\r\n\r\n%%\r\nx =  [0 0 0 1 0 0 0 0;\r\n      0 0 1 2 0 0 0 0;\r\n      0 0 1 0 0 0 0 0;\r\n      0 0 0 0 0 0 0 0]\r\ny_correct = 1;\r\nassert(isequal(blockx3_2(x),y_correct))\r\n\r\n\r\n%%\r\nx =  [0 0 0 1 0 0 0 0;\r\n      0 0 1 2 0 0 0 0;\r\n      0 0 0 0 0 0 0 1;\r\n      0 0 0 0 0 0 0 0]\r\ny_correct = 6;\r\nassert(isequal(blockx3_2(x),y_correct))\r\n\r\n\r\n%%\r\nx =  [0 0 0 1 0 0 0 0;\r\n      0 0 0 2 0 0 0 0;\r\n      0 0 0 1 0 0 0 0;\r\n      0 0 0 1 0 0 0 0]\r\ny_correct = 4;\r\nassert(isequal(blockx3_2(x),y_correct))\r\n\r\n\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":17203,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":8,"test_suite_updated_at":"2014-08-03T08:43:51.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2014-08-03T08:31:00.000Z","updated_at":"2026-05-25T00:44:08.000Z","published_at":"2014-08-03T08:31:00.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\u003eAn extension to problem 2451 (\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://www.mathworks.com/matlabcentral/cody/problems/2451-block-x3-version-1\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026lt;https://www.mathworks.com/matlabcentral/cody/problems/2451-block-x3-version-1\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026gt; ).\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\u003eIt is based on an android game - BLOCK x3. The objective is to align the 1's in the matrix using minimum movements. The valid movements are horizontal and vertical (by one step). A zero (0) indicates an empty space. Your task is to count minimum number of movements required to align the three 1's vertically or horizontally.\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\u003eNew challenge in this problem : There are some static elements which can not be moved and can not be included in the alignment. These elements are indicated by 2. This makes the problem a bit challenging.\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:\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[Input =[0 0 0 0 0 0 0 0;\\n        0 0 1 0 1 0 0 0;\\n        0 0 0 2 1 0 0 0;\\n        0 0 0 0 0 0 0 0]\\n\\nOutput = 2;]]\u003e\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":{"problems":[{"id":2478,"title":"BLOCK x3 (Version 2)","description":"An extension to problem 2451 ( \u003chttps://www.mathworks.com/matlabcentral/cody/problems/2451-block-x3-version-1\u003e ).\r\n\r\nIt is based on an android game - BLOCK x3. The objective is to align the 1's in the matrix using minimum movements. The valid movements are  horizontal and vertical (by one step). A zero (0) indicates an empty space. Your task is to count minimum number of movements required to align the three 1's vertically or horizontally.\r\n\r\nNew challenge in this problem : There are some static elements which can not be moved and can not be included in the alignment. These elements are indicated by 2. This makes the problem a bit challenging.\r\n\r\nExample:\r\n\r\n\r\n  Input =[0 0 0 0 0 0 0 0;\r\n          0 0 1 0 1 0 0 0;\r\n          0 0 0 2 1 0 0 0;\r\n          0 0 0 0 0 0 0 0]\r\n  \r\n  Output = 2;\r\n","description_html":"\u003cp\u003eAn extension to problem 2451 ( \u003ca href = \"https://www.mathworks.com/matlabcentral/cody/problems/2451-block-x3-version-1\"\u003ehttps://www.mathworks.com/matlabcentral/cody/problems/2451-block-x3-version-1\u003c/a\u003e ).\u003c/p\u003e\u003cp\u003eIt is based on an android game - BLOCK x3. The objective is to align the 1's in the matrix using minimum movements. The valid movements are  horizontal and vertical (by one step). A zero (0) indicates an empty space. Your task is to count minimum number of movements required to align the three 1's vertically or horizontally.\u003c/p\u003e\u003cp\u003eNew challenge in this problem : There are some static elements which can not be moved and can not be included in the alignment. These elements are indicated by 2. This makes the problem a bit challenging.\u003c/p\u003e\u003cp\u003eExample:\u003c/p\u003e\u003cpre class=\"language-matlab\"\u003eInput =[0 0 0 0 0 0 0 0;\r\n        0 0 1 0 1 0 0 0;\r\n        0 0 0 2 1 0 0 0;\r\n        0 0 0 0 0 0 0 0]\r\n\u003c/pre\u003e\u003cpre class=\"language-matlab\"\u003eOutput = 2;\r\n\u003c/pre\u003e","function_template":"function y = blockx3_2(x)\r\n\r\nend","test_suite":"%%\r\n\r\nx =  [0 0 0 0 0 0 0 0;\r\n      0 0 1 0 1 0 0 0;\r\n      0 0 0 2 1 0 0 0;\r\n      0 0 0 0 0 0 0 0];\r\ny_correct = 2;\r\nassert(isequal(blockx3_2(x),y_correct));\r\n\r\n\r\n%%\r\nx =  [0 0 0 0 0 0 0 0;\r\n      0 0 1 0 1 0 0 0;\r\n      0 0 0 2 0 0 0 0;\r\n      0 0 1 0 0 0 0 0];\r\ny_correct = 3;\r\nassert(isequal(blockx3_2(x),y_correct))\r\n\r\n%%\r\nx =  [1 1 0 0 0 0 0 0;\r\n      1 2 0 0 0 0 0 0;\r\n      0 0 0 0 0 0 0 0;\r\n      0 0 0 0 0 0 0 0];\r\ny_correct = 3;\r\nassert(isequal(blockx3_2(x),y_correct))\r\n\r\n%%\r\nx =  [0 0 0 1 0 0 0 0;\r\n      0 0 1 2 1 0 0 0;\r\n      0 0 0 0 0 0 0 0;\r\n      0 0 0 0 0 0 0 0];\r\ny_correct = 2;\r\nassert(isequal(blockx3_2(x),y_correct))\r\n\r\n\r\n%%\r\nx =  [0 0 0 1 0 0 0 0;\r\n      0 0 1 2 0 0 0 0;\r\n      0 0 1 0 0 0 0 0;\r\n      0 0 0 0 0 0 0 0]\r\ny_correct = 1;\r\nassert(isequal(blockx3_2(x),y_correct))\r\n\r\n\r\n%%\r\nx =  [0 0 0 1 0 0 0 0;\r\n      0 0 1 2 0 0 0 0;\r\n      0 0 0 0 0 0 0 1;\r\n      0 0 0 0 0 0 0 0]\r\ny_correct = 6;\r\nassert(isequal(blockx3_2(x),y_correct))\r\n\r\n\r\n%%\r\nx =  [0 0 0 1 0 0 0 0;\r\n      0 0 0 2 0 0 0 0;\r\n      0 0 0 1 0 0 0 0;\r\n      0 0 0 1 0 0 0 0]\r\ny_correct = 4;\r\nassert(isequal(blockx3_2(x),y_correct))\r\n\r\n\r\n","published":true,"deleted":false,"likes_count":0,"comments_count":0,"created_by":17203,"edited_by":null,"edited_at":null,"deleted_by":null,"deleted_at":null,"solvers_count":8,"test_suite_updated_at":"2014-08-03T08:43:51.000Z","rescore_all_solutions":false,"group_id":1,"created_at":"2014-08-03T08:31:00.000Z","updated_at":"2026-05-25T00:44:08.000Z","published_at":"2014-08-03T08:31:00.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\u003eAn extension to problem 2451 (\u003c/w:t\u003e\u003c/w:r\u003e\u003cw:r\u003e\u003cw:t\u003e \u003c/w:t\u003e\u003c/w:r\u003e\u003cw:hyperlink w:docLocation=\\\"https://www.mathworks.com/matlabcentral/cody/problems/2451-block-x3-version-1\\\"\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026lt;https://www.mathworks.com/matlabcentral/cody/problems/2451-block-x3-version-1\u003c/w:t\u003e\u003c/w:r\u003e\u003c/w:hyperlink\u003e\u003cw:r\u003e\u003cw:t\u003e\u0026gt; ).\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\u003eIt is based on an android game - BLOCK x3. The objective is to align the 1's in the matrix using minimum movements. The valid movements are horizontal and vertical (by one step). A zero (0) indicates an empty space. Your task is to count minimum number of movements required to align the three 1's vertically or horizontally.\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\u003eNew challenge in this problem : There are some static elements which can not be moved and can not be included in the alignment. These elements are indicated by 2. This makes the problem a bit challenging.\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:\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[Input =[0 0 0 0 0 0 0 0;\\n        0 0 1 0 1 0 0 0;\\n        0 0 0 2 1 0 0 0;\\n        0 0 0 0 0 0 0 0]\\n\\nOutput = 2;]]\u003e\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\"}]}"}],"errors":[],"facets":[[{"value":"Computer Games II","count":1,"selected":false},{"value":"Computer Games III","count":1,"selected":false}],[{"value":"hard","count":1,"selected":false}]],"term":"tag:\"alignment\"","page":1,"per_page":50,"sort":"map(difficulty_value,0,0,999) asc"}}