Consider following initial board; (1) indicates there is a peg and (0) indicates empty holes.
For this initial board, we can move;
- the peg located on (2,4) to down (2) direction.
- the peg located on (4,2) to right (6) direction
- the peg located on (6,4) to up (8) direction,
- the peg located on (4,6) to left (4) direction.
Write a function to list all the possible move for the given board.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers6
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6855 Solvers
-
647 Solvers
-
452 Solvers
-
194 Solvers
-
Change the first and last diagonal element of the identity matrix to zero
161 Solvers
More from this Author92
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!