Problem 2478. BLOCK x3 (Version 2)
An extension to problem 2451 ( https://www.mathworks.com/matlabcentral/cody/problems/2451-block-x3-version-1 ).
It 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.
New 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.
Example:
Input =[0 0 0 0 0 0 0 0; 0 0 1 0 1 0 0 0; 0 0 0 2 1 0 0 0; 0 0 0 0 0 0 0 0]
Output = 2;
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers5
Suggested Problems
-
1828 Solvers
-
1122 Solvers
-
Are all the three given point in the same line?
583 Solvers
-
Give me Hamming on five, hold the mayo
50 Solvers
-
Simple Caesar Cypher - shift encrypt a message given an index number
97 Solvers
More from this Author44
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!