⎕←(3∨?2)⌽1↓,∘⌽⍨

@J.Sallé
┌─┼───┐
1 ⌽ ┌─┼─┐
    1 ↓ ⍨
      ┌─┘
      ∘
     ┌┴┐
     , ⌽

anyone wanna try codegolf.stackexchange.com/questions/35978/an-ant-on-a-cube ? apl wins it by a lot

@ngn -1, would require a tradfn (no, f← + dfn isn't a named function)

> Write a named function that takes in the ant's sequence of turns and outputs whether the ant is back at its start position after the sequence.

ninja

@ngn because tradfns, dfns and tacit functions are all different datatypes and only tradfns can be named, but there is a function type which can be named, tradfns, so it must be a tradfn

@EriktheOutgolfer "only tradfns can be named" - that's not true

@EriktheOutgolfer doesn't f← name the {} ?

@ngn by "named" I don't mean just assigning to a variable, but the whole ⎕FIXing process

@EriktheOutgolfer ok, assuming that's what the author meant, what do you think should be the overhead of a tradfn if I already have an f←train?

8 bytes? ∇f \n (...)⎕ \n ∇

@ngn why should you have an f←train?

∇f V
(train)V∇

@EriktheOutgolfer because i solved it under the assumption that f←... is named

or even with ⎕

∇f
(train)⎕∇

@ngn at least in Python, that's not exactly what "named" means

f=lambda x, y: x + y

ok, even with a trandfn, apl still wins

has string representation <function <lambda> at <memory_address>>

def f(x, y):return x + y

then f has string representationn <function f at <memory_address>>

@ngn

@ngn didn't dispute that :P but my -1 to the challenge still stands, those extra 6 bytes are unnecessary IMO :/

@EriktheOutgolfer I don't like that artificial restriction either

@EriktheOutgolfer but i think the rest of it is a good challenge

@ngn for me, that alone is -150, so even if I otherwise like the challenge, I -1

(¯1≡ׯ150)

@EriktheOutgolfer I don't know what your definition of a named function is (or Python's). But if dfns are invalid, the Haskell is answer is likely invalid. I would argue that if the function has a name, it is a named function

@H.PWiz I'm not really sure of how other languages behave, but I'm pretty sure APL's ⎕FIXing process is a bit different than just variable assignment

I don;t understand why variable assignment does not count as naming

Having different kinds of naming, shouldn't mean that only one results in a named function

@EriktheOutgolfer Huh?

⎕←2 ⎕FIX 'f←{' '⍺+⍵' '}' ⋄ ⎕← 3 f 4

@Adám
┌─┐
│f│
└─┘
7

the author of the challenge - xnor - has explicity allowed f←. I'll refrain from posting my solution for a few days, in case any apl-er wants to give it a try.

I came across the permutation solution myself, but cannot find a satisfying golf of it.

I would expect the other solution to be shorter anyway

@H.PWiz what do you mean by "the permutation solution"?

@ngn Transform abcd to either dabc or bdac

can one award bonuses to arbitrary answers? i'd like to make a bet :)

the bonus dialog does have an "award existing answer" option - great! so if anyone can beat my solution in apl, i'll award them 500 rep :) now how do I commit to that...

You could add to the endless bounties post on meta. I wouldn't consider that kind of bounty arbitrary though.

@H.PWiz if I do that, it's likely that the bonus will expire and i will lose rep even if nobody has won it

That is the opposite of what endless means. codegolf.meta.stackexchange.com/questions/5243/…

@ngn Yes, that seems like a reasonable solution. Post it in here, and have it pinned maybe?

@H.PWiz how do I pin?

Room owner has to pin

I'll award 500 reputation to the first Dyalog APL solution to An Ant on a Cube that is shorter than my own (sha1: 96e876b41df54e13c0f662c897e4e4def7a143c4, I'm not revealing the exact length) and is submitted before 23:59 EET on 18 March 2018. I'll award 250 if the submitted solution is of the same length as mine.

@Adám ^ would you pin, please?

@ngn I have starred it for now

@H.PWiz thanks

@ngn pinned

@ngn First APL Picking.

@Adám thanks, and I hope I don't get in trouble with the tax man for gambling :)

@ngn Clearly, promising rep is allowed on PPCG.

@Adám yeah, of course, the bets are worth £0 and there's no chance involved

@ngn Maybe cross-post in TNB (but don't ask for pin or stars!)?

@Adám done

@ngn Is that the sha1 of the unicode?

@H.PWiz yes, with a newline at the end, without a leading f←

@H.PWiz I hope you're not planning to attack the hash :)

No, I just thought that if I got a short solution, I would compare its sha1 with yours