Problem 2406. possible ways through matrix

Created by rifat

Solve Later

{"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":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>This problem is inspired from problem 2405</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"https://www.mathworks.com/matlabcentral/cody/problems/2405-the-number-of-ways\"><w:r><w:t>&lt;https://www.mathworks.com/matlabcentral/cody/problems/2405-the-number-of-ways</w:t></w:r></w:hyperlink><w:r><w:t>&gt;.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Check that problem description first for better understanding. Input p is the number of rows and n the number of columns of matrix A. Matrix A is filled with numbers from 1 to n*p in a row-wise fashion. Example:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[n=2; p=2\nA = [1 2\n 3 4];]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The objective is to move through the matrix starting from the top row (at any position) and end at bottom row (at any position). The difference with problem 2405 is that here the movement is limited. You can not jump from, say, 3rd column of 1st row to 1st column of 2nd row. If you are at j-th column of i-th row, the only valid next movements are (i+1,j-1), (i+1,j) and (i+1,j+1). That means, you can only move vertically or diagonally (in both direction). No wrap around the edges is assumed (will be in next problem). Just like the previous problem, return a matrix where each row is a possible move.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>For the example given above, the possible moves are (1,3), (1,4), (2,3) and (2,4). Thus the output matrix is</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[[1 3\n 1 4\n 2 3\n 2 4]]]></w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

This problem is inspired from problem 2405 <a href = "https://www.mathworks.com/matlabcentral/cody/problems/2405-the-number-of-ways">https://www.mathworks.com/matlabcentral/cody/problems/2405-the-number-of-ways</a>.Check that problem description first for better understanding. Input p is the number of rows and n the number of columns of matrix A. Matrix A is filled with numbers from 1 to n*p in a row-wise fashion.
Example:<pre class="language-matlab">n=2; p=2
A = [1 2
 3 4];
</pre>The objective is to move through the matrix starting from the top row (at any position) and end at bottom row (at any position). The difference with problem 2405 is that here the movement is limited. You can not jump from, say, 3rd column of 1st row to 1st column of 2nd row. If you are at j-th column of i-th row, the only valid next movements are (i+1,j-1), (i+1,j) and (i+1,j+1). That means, you can only move vertically or diagonally (in both direction). No wrap around the edges is assumed (will be in next problem). Just like the previous problem, return a matrix where each row is a possible move.For the example given above, the possible moves are (1,3), (1,4), (2,3) and (2,4). Thus the output matrix is<pre class="language-matlab">[1 3
 1 4
 2 3
 2 4]
</pre>

This problem is inspired from problem 2405 <https://www.mathworks.com/matlabcentral/cody/problems/2405-the-number-of-ways>.

Check that problem description first for better understanding. Input p is the number of rows and n the number of columns of matrix A. Matrix A is filled with numbers from 1 to n*p in a row-wise fashion.
Example:

n=2; p=2
  A = [1 2
       3 4];

The objective is to move through the matrix starting from the top row (at any position) and end at bottom row (at any position). The difference with problem 2405 is that here the movement is limited. You can not jump from, say, 3rd column of 1st row to 1st column of 2nd row. If you are at j-th column of i-th row, the only valid next movements are (i+1,j-1), (i+1,j) and (i+1,j+1). That means, you can only move vertically or diagonally (in both direction). No wrap around the edges is assumed (will be in next  problem). Just like the previous problem, return a matrix where each row is a possible move.

For the example given above, the possible moves are (1,3), (1,4), (2,3) and (2,4). Thus the output matrix is

[1 3
   1 4
   2 3
   2 4]

Solve

Solution Stats

51 Solutions
28 Solvers

Last Solution submitted on Jul 13, 2022

Last 200 Solutions

Problem Recent Solvers28

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 2406. possible ways through matrix

Solution Stats

Last 200 Solutions

Problem Recent Solvers28

Suggested Problems

More from this Author44

Problem Tags

Community Treasure Hunt

Problem 2406. possible ways through matrix

Solution Stats

Last 200 Solutions

Problem Recent Solvers28

Suggested Problems

More from this Author44

Problem Tags

Community Treasure Hunt

Players