the second index is 1 and the third is 4, so the list becomes [2, 3, 5]
for the fourth index, you prefer 2 over 3, because 2 < 3, so your list is now [3, 5]
for the fifth index, you can't use 2 again, because now it's not in the list, so you use 3 instead, and you finally use 5, so the result becomes [0, 1, 4, 2, 3, 5]
@DJMcMayhem Although you should restrict the argument to a (non-negative?) integer list. In version 16.0 Grade can grade multi-dimensional numeric or character arrays, but in 17.0 it can grade almost anything.
Othello Greedy Strategy
The rules for Othello can be found here.
In a greedy strategy, in each go, you just choose a square in which to place your counter such that there are no other places that could allow you to flip more counters. However, there is still often a choice where you need to dec...
@ASCII-only what if I say that sorted is actually 6 built-ins working together, making a function that happens to sort the given parameter? Or that s is actually 8 built-ins (the bits of the character)?
I am attempting to write a challenge which needs to quote essentially the whole of the Formulation section of https://en.wikipedia.org/wiki/Akra%E2%80%93Bazzi_method . Rendering the math nicely in the ppcg question seems to be a pain or at least I don't know how to do it. The only method I have ...
@ASCII-only Dyalog APLs operators for example. In ∘.× the . isn't savable anywhere as an operator because upon calling it needs the two arguments (∘ and × here) immediately or else it'll error.
dyadic operators, in this case, are really prefixes that take a function as their right operand and compose a monadic operator, however there are other reasons to argue about ∘....
@ASCII-only alternatively, if the spec said there are infinitely many built-ins for every sequence of characters and each built-in must end and start together with the program?
CMC (inspired by the 2018 APL Problem Solving Competition's Phase II, Cryptography 1:2) apl: Given two Booleans, produce their XOR. All built-ins are prohibited.
@dzaima The spec can't just say "let this be a builtin" and expect everyone to go "oh clearly that's a builtin because you totally didn't describe the actual builtins in other places)
@Adám It's the exact same problem as last time you posted this CMC. Eventually, you said lambda x,y:0 if x else 1if y else 1if x else 0 works in python, but lambda a,b:(a and b==False)or(b and a==False) doesn't. How is == a built-in and lambda/if/else are all not?
@ASCII-only what if the only interpreter of a hypothetical language with byte long built-ins (with no source code available) was optimized by a compiler that hard-coded the actions of every possible 3 built-in sequence (but you don't know that originally they were split apart)? By the interpreter there are tons of 3 byte built-ins but really they are 1 byte.
@DJMcMayhem So, if a language had errors on every stand-alone instance of functions/keywords, and they're all made of letters, wouldn't it have no built ins?
@dzaima APL has no reserved words, i.e. an identifier that is available to the user can never clash with any part of the language, and indeed, original APL had no keywords, but today's APLs have; they're just prefixed with special characters that are not allowed in user defined identifiers.
@Adám x takes one argument and returns a function (like any two argument function in Haskell). The syntax f x|cond1=...|cond2=... is for giving seperate branches for a function. If x gets True it returns n (not). Otherwise (for some reason the empty let is True and is shorter than True), return k (Identity... should have called it i)
@DJMcMayhem of course. because if they were implemented there you'd require a change to the way the operators there are called, since it short circuits
@DJMcMayhem That's because of the various natures of programming languages, but for languages that have well-defined parts (e.g. APL), it is 100% what it means to prohibit all primitives.
@Adám You can access it as /srv/usr/share/tio.run/languages.json, but there's no guarantee it will be up-to-date. The safest form is to look at the files inside. /srv/wrappers
Othello Greedy Strategy
The rules for Othello can be found here.
In a greedy strategy, in each go, you just choose a square in which to place your counter such that there are no other places that could allow you to flip more counters. However, there is still often a choice where you need to dec...
