User blog:Bubby3/Nested worm function

We can put arrays inside arrays

An empty array ([]) is equal to 0

An array ending in 0 is treated like a successor

A limit array is an array not ending in 0

[0] is equal to 1 [0,0] is equal to 2 [0,0,0] is equal to 3 etc. if it is inside an array.

Make N 1

After every step increase it by one

The rules are.
 * 1) If there are any empty arrays, replace them with 0
 * 2) If the array ends with 0, cut it off
 * 3) If the last entry is a limit array (not ending in 0), jump inside that array and follow the rules.
 * 4) If the last entrfy is a successor array, call the controlling entry the last entry

Here's how we compare levels:

First compare the first entry of both arrays. If they are arrays, jump in them and compare them. Whatever array with the greatest first entry also has the greatest first entry is the greatesy

Repeat that but with the second, third, fourth, etc. entry, moving on to the next one if they are equal. If we reach the end of one array, the longer one is greater