Problem 2511. BLOCK x3 (Version 4)
Always in this series ( 2451, 2484, and 2478 ).
Now we are in color (1 for red and 2 for white). Your task is always to count the minimum number of movements required to align the 3 blocks in each colors (vertically or horizontally).
- [0 0 0 0 0 0 0;
- 0 0 1 2 0 0 0;
- 0 0 0 0 0 0 0;
- 0 0 1 2 0 0 0;
- 0 0 1 2 0 0 0;
- 0 0 0 0 0 0 0;
- 0 0 0 0 0 0 0]
In this example you can move down the first two blocks ( in two moves ).
Note that blocks can be swapped .
In this second example :
- [0 0 0 0 0 0 0;
- 0 0 0 0 0 0 0;
- 0 0 1 2 0 0 0;
- 0 0 2 1 0 0 0;
- 0 0 1 2 0 0 0;
- 0 0 0 0 0 0 0;
- 0 0 0 0 0 0 0]
Here you win in only one move by swapping the two central blocks.
Good luck !
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers5
Suggested Problems
-
Getting the indices from a vector
9692 Solvers
-
Arrange vector in ascending order
772 Solvers
-
682 Solvers
-
568 Solvers
-
449 Solvers
More from this Author43
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!