Skip to main content
Code Golf

Return to Answer

deleted 4 characters in body
Source Link
Lince Assassino
Lince Assassino
  • 301
  • 1
  • 4

Behaviour, 52 bytes

t=&(i=1\~([a%i>a%(i+1)a%i>a%(i-1)]i+=1i<#a-1)i>#a-2)

I don't exactly know the rules regarding recently self-made esolangs, but here goes nothing.

Ungolfed and commented:

t = &( i=1 // start on the index 1 // repeat the following sequence until failure \~( // either the ith member is bigger than the previous or bigger than the next [ a%i > a%(i+1) a%i > a%(i-1) ] // increment index and check if it still is less than n-1 i += 1 i < #a-1 ) // is a tower if the index stopped incrementing on the last possible index (i.e. passed all the checks) i > #a-2 )

Test with:

t:{1} t:{1 2 3} t:{3 1 2}

Bonus (bigger) answer using more obscure features of the language but basicaly the same logic:

t=&![#a<3[#(t=a)<3(#a-2)*&(v=t%(a+1)[v>t%a;v>t%v>t%a|v<t%(a+2)]))>&(a;b)];>&a|b]

Behaviour, 52 bytes

t=&(i=1\~([a%i>a%(i+1)a%i>a%(i-1)]i+=1i<#a-1)i>#a-2)

I don't exactly know the rules regarding recently self-made esolangs, but here goes nothing.

Ungolfed and commented:

t = &( i=1 // start on the index 1 // repeat the following sequence until failure \~( // either the ith member is bigger than the previous or bigger than the next [ a%i > a%(i+1) a%i > a%(i-1) ] // increment index and check if it still is less than n-1 i += 1 i < #a-1 ) // is a tower if the index stopped incrementing on the last possible index (i.e. passed all the checks) i > #a-2 )

Test with:

t:{1} t:{1 2 3} t:{3 1 2}

Bonus (bigger) answer using more obscure features of the language but basicaly the same logic:

t=&![#a<3(t=a(#a-2)*&(v=t%(a+1)[v>t%a;v>t%(a+2)]))>&(a;b)]

Behaviour, 52 bytes

t=&(i=1\~([a%i>a%(i+1)a%i>a%(i-1)]i+=1i<#a-1)i>#a-2)

I don't exactly know the rules regarding recently self-made esolangs, but here goes nothing.

Ungolfed and commented:

t = &( i=1 // start on the index 1 // repeat the following sequence until failure \~( // either the ith member is bigger than the previous or bigger than the next [ a%i > a%(i+1) a%i > a%(i-1) ] // increment index and check if it still is less than n-1 i += 1 i < #a-1 ) // is a tower if the index stopped incrementing on the last possible index (i.e. passed all the checks) i > #a-2 )

Test with:

t:{1} t:{1 2 3} t:{3 1 2}

Bonus (bigger) answer using more obscure features of the language but basicaly the same logic:

t=&![#(t=a)<3(#a-2)*&(v=t%(a+1)v>t%a|v<t%(a+2));>&a|b]
edited body
Source Link
Lince Assassino
Lince Assassino
  • 301
  • 1
  • 4

Behaviour, 52 bytes

t=&(i=1\~([a%i>a%(i+1)a%i>a%(i-1)]i+=1i<#a-1)i>#a-2)

I don't exactly know the rules regarding recently self-made exolangsesolangs, but here goes nothing.

Ungolfed and commented:

t = &( i=1 // start on the index 1 // repeat the following sequence until failure \~( // either the ith member is bigger than the previous or bigger than the next [ a%i > a%(i+1) a%i > a%(i-1) ] // increment index and check if it still is less than n-1 i += 1 i < #a-1 ) // is a tower if the index stopped incrementing on the last possible index (i.e. passed all the checks) i > #a-2 )

Test with:

t:{1} t:{1 2 3} t:{3 1 2}

Bonus (bigger) answer using more obscure features of the language but basicaly the same logic:

t=&![#a<3(t=a(#a-2)*&(v=t%(a+1)[v>t%a;v>t%(a+2)]))>&(a;b)]

Behaviour, 52 bytes

t=&(i=1\~([a%i>a%(i+1)a%i>a%(i-1)]i+=1i<#a-1)i>#a-2)

I don't exactly know the rules regarding recently self-made exolangs, but here goes nothing.

Ungolfed and commented:

t = &( i=1 // start on the index 1 // repeat the following sequence until failure \~( // either the ith member is bigger than the previous or bigger than the next [ a%i > a%(i+1) a%i > a%(i-1) ] // increment index and check if it still is less than n-1 i += 1 i < #a-1 ) // is a tower if the index stopped incrementing on the last possible index (i.e. passed all the checks) i > #a-2 )

Test with:

t:{1} t:{1 2 3} t:{3 1 2}

Bonus (bigger) answer using more obscure features of the language but basicaly the same logic:

t=&![#a<3(t=a(#a-2)*&(v=t%(a+1)[v>t%a;v>t%(a+2)]))>&(a;b)]

Behaviour, 52 bytes

t=&(i=1\~([a%i>a%(i+1)a%i>a%(i-1)]i+=1i<#a-1)i>#a-2)

I don't exactly know the rules regarding recently self-made esolangs, but here goes nothing.

Ungolfed and commented:

t = &( i=1 // start on the index 1 // repeat the following sequence until failure \~( // either the ith member is bigger than the previous or bigger than the next [ a%i > a%(i+1) a%i > a%(i-1) ] // increment index and check if it still is less than n-1 i += 1 i < #a-1 ) // is a tower if the index stopped incrementing on the last possible index (i.e. passed all the checks) i > #a-2 )

Test with:

t:{1} t:{1 2 3} t:{3 1 2}

Bonus (bigger) answer using more obscure features of the language but basicaly the same logic:

t=&![#a<3(t=a(#a-2)*&(v=t%(a+1)[v>t%a;v>t%(a+2)]))>&(a;b)]
The name of Node is t, but on the test box I called it 'test'
Source Link
Lince Assassino
Lince Assassino
  • 301
  • 1
  • 4

Behaviour, 52 bytes

t=&(i=1\~([a%i>a%(i+1)a%i>a%(i-1)]i+=1i<#a-1)i>#a-2)

I don't exactly know the rules regarding recently self-made exolangs, but here goes nothing.

Ungolfed and commented:

t = &( i=1 // start on the index 1 // repeat the following sequence until failure \~( // either the ith member is bigger than the previous or bigger than the next [ a%i > a%(i+1) a%i > a%(i-1) ] // increment index and check if it still is less than n-1 i += 1 i < #a-1 ) // is a tower if the index stopped incrementing on the last possible index (i.e. passed all the checks) i > #a-2 )

Test with:

testt:{1} testt:{1 2 3} testt:{3 1 2}

Bonus (bigger) answer using more obscure features of the language but basicaly the same logic:

t=&![#a<3(t=a(#a-2)*&(v=t%(a+1)[v>t%a;v>t%(a+2)]))>&(a;b)]

Behaviour, 52 bytes

t=&(i=1\~([a%i>a%(i+1)a%i>a%(i-1)]i+=1i<#a-1)i>#a-2)

I don't exactly know the rules regarding recently self-made exolangs, but here goes nothing.

Ungolfed and commented:

t = &( i=1 // start on the index 1 // repeat the following sequence until failure \~( // either the ith member is bigger than the previous or bigger than the next [ a%i > a%(i+1) a%i > a%(i-1) ] // increment index and check if it still is less than n-1 i += 1 i < #a-1 ) // is a tower if the index stopped incrementing on the last possible index (i.e. passed all the checks) i > #a-2 )

Test with:

test:{1} test:{1 2 3} test:{3 1 2}

Bonus (bigger) answer using more obscure features of the language but basicaly the same logic:

t=&![#a<3(t=a(#a-2)*&(v=t%(a+1)[v>t%a;v>t%(a+2)]))>&(a;b)]

Behaviour, 52 bytes

t=&(i=1\~([a%i>a%(i+1)a%i>a%(i-1)]i+=1i<#a-1)i>#a-2)

I don't exactly know the rules regarding recently self-made exolangs, but here goes nothing.

Ungolfed and commented:

t = &( i=1 // start on the index 1 // repeat the following sequence until failure \~( // either the ith member is bigger than the previous or bigger than the next [ a%i > a%(i+1) a%i > a%(i-1) ] // increment index and check if it still is less than n-1 i += 1 i < #a-1 ) // is a tower if the index stopped incrementing on the last possible index (i.e. passed all the checks) i > #a-2 )

Test with:

t:{1} t:{1 2 3} t:{3 1 2}

Bonus (bigger) answer using more obscure features of the language but basicaly the same logic:

t=&![#a<3(t=a(#a-2)*&(v=t%(a+1)[v>t%a;v>t%(a+2)]))>&(a;b)]
deleted 1 character in body
Source Link
Lince Assassino
Lince Assassino
  • 301
  • 1
  • 4
Source Link
Lince Assassino
Lince Assassino
  • 301
  • 1
  • 4