This Challenge is to Minimize the number of Knots for the Knots contest test suite.
All Cody ToolBoxes are available. (Neural, Parallel, Stats)
Input: A, xyIn, wts
Output: xyOut
Examples and specifics are at Knots contest .
Scoring: Score is Knots. Time, Code size and distance are ignored. All 50 Contest boards are scored.
The Champions are the first three scores. Raphael Candelier's Cheeeese is followed by the creations of Per and Alfonso.
.
Future:
Additional Challenges using the Contest Suite will become available as will Scoring for Fewest Knots, no time penalty. Also puzzle subsets for Fewest Knots and Low Score will be created.
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers3
Suggested Problems
-
Calculate the Levenshtein distance between two strings
1506 Solvers
-
Back to basics 9 - Indexed References
459 Solvers
-
Numbers with prime factors 2, 3 and 5.
681 Solvers
-
What is the distance from point P(x,y) to the line Ax + By + C = 0?
554 Solvers
-
174 Solvers
More from this Author308
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Error using urlreadwrite (line 98)
Error downloading URL. Your network connection may be down or your proxy settings improperly configured.