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 sample 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 Solvers7
Suggested Problems
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1333 Solvers
-
238 Solvers
-
How long is the longest prime diagonal?
414 Solvers
-
303 Solvers
-
2033 Solvers
More from this Author306
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
URL Fails.