I'm programming a Snake game

and the logic of the snake's movement dictates that if I have a Javascript array

var links = [elem_0, elem_1, ..., elem_n];

of elements representing links of the snake, then the way for the snake to move is to pop out elem_n, change its position to be that of the elem_0 plus the translation units dx and dy, and then put it at the beginning of the array:

[elem_0, elem_1, ..., elem_n] ---> [elem_n, elem_0, ..., elem_(n-1)]

(with some internal properties of elem_n changed in the process)

What is the way to do this that makes no promise between

• optimally efficient in number of operations and memory usage
• readable
• maintainable
• clever (optional)
• elegant
• pact

????

I'm programming a Snake game

and the logic of the snake's movement dictates that if I have a Javascript array

var links = [elem_0, elem_1, ..., elem_n];

of elements representing links of the snake, then the way for the snake to move is to pop out elem_n, change its position to be that of the elem_0 plus the translation units dx and dy, and then put it at the beginning of the array:

[elem_0, elem_1, ..., elem_n] ---> [elem_n, elem_0, ..., elem_(n-1)]

(with some internal properties of elem_n changed in the process)

What is the way to do this that makes no promise between

• optimally efficient in number of operations and memory usage
• readable
• maintainable
• clever (optional)
• elegant
• pact

????

• javascript
• arrays
• algorithm
• optimization
• game-physics

• 3 links.unshift(links.pop()); – dandavis Commented Jul 28, 2015 at 6:03
• Is your list of requirements in order of importance? – user663031 Commented Jul 28, 2015 at 6:10
• 3 Clever is never a requirement of mine. "Optimally efficient" is an ill-defined target. What is generally needed is the least amount of effort to achieve a solution that meets the requirements. This leaves more time to work on other areas of the problem that matter. Since you've not defined what would be sufficient, we can't code to a particular goal. Plus, maximum efficiency often requires adding plication which conflicts with many of your other goals so one must know how to make a tradeoff between them. – jfriend00 Commented Jul 28, 2015 at 6:18
• possible duplicate of JavaScript Array rotate() – user663031 Commented Jul 28, 2015 at 6:41

3 Answers 3

optimally efficient in number of operations and memory usage

You're asking for two optimisations that usually counter one another. e.g. more speed == more memory.

That said, I'd probably choose a (doubly) linked list to store my snake, because removal or addition at the front or tail are very cheap, and with games, faster is way preferable to less memory (within reason, but I wonder how long your snake would have to be before you run into memory issues... well beyond what's playable... and some).

Of course, I assume you've measured and found the standard array based methods to be too slow (seems unlikely).

You can rotate an array in two ways :

links.unshift(links.pop());   or

links.push(links.shift());

first method solves your issue.

For any version of Javascript from ES3 forward:

links.unshift(links.pop());