I like the conceptis puzzles. I even implemented a solver in matlab for the Pic-A-Pix a long time ago. Not sure what happened to the code. At the moment, my favorite are the Slitherlink puzzles.
Conceptis does a good job with their site; I especially like the free weekly puzzles. They added a skyscrapers puzzle in the recent past, and someone has posted that problem to Cody, in case you weren't aware: http://www.mathworks.com/matlabcentral/cody/problems/2026-skyscrapers-puzzle. Also, you might want to find that code again, if you haven't already solved the two logic-art problems that have been posted: http://www.mathworks.com/matlabcentral/cody/problems/1700-solve-the-picross-easy and http://www.mathworks.com/matlabcentral/cody/problems/1701-solve-the-picross-hard.
Also, I'd like to see you post a slitherlink puzzle for solving or checking solutions. I'm not quite sure how to implement it, given the interposing matrices that the clues and slithering line would require.
Good explanations + Good tests = Good Problem.
The only thing I'd add to the problem description is that while all rows must be unique, and all columns must be unique, a row can equal a column and the matrix can still be "solved." Other than that, good problem.
Thanks, James and Jean-Marie. Your likes mean a lot. Also, I updated the description to specify rows are unique amongst rows and columns are unique among columns.
Return the 3n+1 sequence for n
The Tower of Hanoi
frame of the matrix
Create an index-powered vector
Approximation of Pi (vector inputs)
Divisible by 15
Combined Ages 1 - Symmetric, n = 3
Stress-Strain Properties - 1
The 5th Root
Find the treasures in MATLAB Central and discover how the community can help you!
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office