Problem 42708. Placing Beads Neatly in a Box
Solution Stats
Problem Comments
-
5 Comments
note: the "is it sneaky?" part of the testsuite is not really a complete test (e.g. the matrix [1 2 3; 4 5 6; 7 8 9] would pass that). Using "complex(I,J)" instead of "I+J" would fix this.
Thanks Alfonso! Advice taken.
You also gave me a new test for "Is it Snaky (42705)" that knocked out the current leader.
Can you clarify: does the partial sequence 1-1-0-1 force a failure? Your diagram doesn't seem to allow diagonal paths, so it seems that a single 0 or 1 causes failure.
Hi Carl: All sequences are generated from successful packings. So you wouldn't get 1-1-0-1 because, as you note, it couldn't be packed successfully. In other words, this situation shouldn't come up.
Solution Comments
Show commentsProblem Recent Solvers13
Suggested Problems
-
Sort a list of complex numbers based on far they are from the origin.
5548 Solvers
-
Find the two most distant points
2733 Solvers
-
Calculate the area of a triangle between three points
2708 Solvers
-
264 Solvers
-
Create an n-by-n null matrix and fill with ones certain positions
554 Solvers
More from this Author50
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!