# How are ninja solutions even possible in Cody?

조회 수: 1(최근 30일)
댓글: Rik 2020년 8월 30일
In a previous Q & A, Jan Simon pointed to Cody: Sum 1:2^n. The current leading solution to that problem has node-count (or more simply, "length") 10. Apparently, 10 is the minimal length (per the official length-function on File Exchange) of any function taking input & generating output:
function y = test_cody_solution(x)
y = x;
end
Per Cody instruction examples, additional computation within a function definition increases the solution length. For example, both of the following functions have length 12:
function y = test_cody_solution(x)
y = [x];
end
function y = test_cody_solution(x)
y = x+1;
end
My question is: what kinds of ninja-style coding idioms even exist in MATLAB which actually perform definite computation but at the same time do not increase the node-count above 10? I'm not able to imagine what could be going on in order for someone to solve a given non-trivial Cody puzzle in length 10 or 11? IOW, without respect to any particular Cody problem, could someone please give an example of a non-trivial function which somehow comes in at or just above the absolute lower bound? Any explanation of the magic would be appreciated as well.

댓글을 달려면 로그인하십시오.

### 채택된 답변

Doug Hull 2013년 11월 18일
Not sure if I am using super-powers to see the leading solution that you pointed to but his is what was leading:
function y = sum_int(x)
regexp '' '(?@y=sum(1:2^x);)'
end
So this is the Ninja solution to that Cody problem
I would not spend a whole lot of mental effort on figuring out this "best" solutions to these Cody problems. The scoring encourages really arcane solutions like this. I take pride in having the "worst" score on most of the problems I am involved with. I will take long, readable code every time.
##### 댓글 수: 3표시 이전 댓글 수: 2숨기기 이전 댓글 수: 2
Rik 2020년 8월 30일
Or better yet: runtime (either as a fraction of an example solution, or in absolute terms). That way you optimize for speed, instead of arcane hacks that have nothing to do with anything real world. At least speed has a real world application.
This is the main reason I stopped doing Cody puzzles: with nice, compact, fast code you will still be orders of magnitude above a forrest of tiny score solutions. Which you can't view if you don't have at least that score, so you can only learn from people who are worse than you.

댓글을 달려면 로그인하십시오.

### 추가 답변(1개)

Chris Pap 2013년 11월 22일
This ruined the Cody challenge for me.
I guessed the "minimun parse tree" requirement would exclude invoking functions of regular expressions and related stunts. Not because it is hard to do (which is), but because this has little to do with code improvement in terms of computability.
Anyway. Back to cody.
Bye guys

댓글을 달려면 로그인하십시오.

### 범주

Find more on Programming Utilities in Help Center and File Exchange

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by