# another attempt at code golf

[This article was first published on

Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.

**R – Xi'an's Og**, and kindly contributed to R-bloggers]. (You can report issue about the content on this page here)Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.

**I** had another lazy weekend go at code golf, trying to code in the most condensed way the following task. Provided with a square matrix *A* of positive integers, keep iterating the steps

- take the highest square
*????²*in*A*. - find the smallest adjacent neighbour ????
- replace
*x²*with x and n with*nx*

until no square is left (with neighbour defined as either horizontally or vertically and without wrapping around). While I managed a 217 bytes solution, compared with Robin’s 179b improvement, which remains surprising readable!, the puzzle offers two further questions:

- is there a non-iterative way to find the final matrix B?
- the puzzle assumes that A satisfies that at each step, the highest square
*x²*and the smallest neighbour*n*will be unique, and that the sequence will not repeat forever. Is there a fool-proof way to check this is the case?

To

**leave a comment**for the author, please follow the link and comment on their blog:**R – Xi'an's Og**.R-bloggers.com offers

**daily e-mail updates**about R news and tutorials about learning R and many other topics. Click here if you're looking to post or find an R/data-science job.

Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.