Problem 944. Create incremental spiral WITHOUT USING EVAL or FEVAL

Created by J-G van der Toorn

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Constructions that use feval or eval are used to cheat with cody. This test-suite tries to avoid that trick.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The goal of this challenge is to create a numeric pyramid with size n*n, starting with 1 in the upper left corner, and cycling clockwise until the center, by every step incrementing with one. It is not allowed to use eval or feval statements to get a lower node-count. Neither are regexp, regexprep, regexpi, eval, evalc, evalin, nor inline allowed.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>For example:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[n = 3;\nans =\n     1     2     3\n     8     9     4\n     7     6     5\n\nn = 6;\nans =\n     1     2     3     4     5     6\n    20    21    22    23    24     7\n    19    32    33    34    25     8\n    18    31    36    35    26     9\n    17    30    29    28    27    10\n    16    15    14    13    12    11]]></w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

102 Solutions
59 Solvers

Last Solution submitted on Aug 29, 2020

Last 200 Solutions

Problem Comments

3 Comments

3 Comments

Andrew Newell on 25 Apr 2014

I can't get it to read my solution (which passes the test when I try it on my own computer).

Jan Orwat on 18 Sep 2014

Same problem.

rifat on 19 Sep 2014

I also had the same problem

Solution Comments

Solution 556558

1 Comment

1 Comment

Jan Orwat on 13 Jan 2015

testsuite doesn't work since mid 2014.
Anyway, the smallest non-spiral solution there.

Solution 140777

3 Comments

3 Comments

J-G van der Toorn on 24 Sep 2012

Interesting. I didn't know about 'anonymous functions' until Cody came to existence. It has already paid off.
Therefore, unfortunately, I could not implement an 'anonymous function' trap in this Problem. The next one will contain one.
I am curious about the next mtree-score-hack.

Aurelien Queffurust on 9 Nov 2012

As usual, I am still impressed by your solution!

Khaled Hamed on 10 Nov 2012

I do agree that 'str2func' may be used to wrap a long solution into a much shorter size. Using an anonymous function does not reduce size, however, and should nt be trapped. Same thing goes with 'regexp', which can be used to pass a multiline calculation as one command.

Problem Recent Solvers59

Problem Tags

Problem 944. Create incremental spiral WITHOUT USING EVAL or FEVAL

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers59

Suggested Problems

More from this Author31

Problem Tags

Problem 944. Create incremental spiral WITHOUT USING EVAL or FEVAL

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers59

Suggested Problems

More from this Author31

Problem Tags

Players