Compress a grandmaster chess position code-challenge test-battery Background Compress a position from a grandmaster chess game to as few bits as possible on average. A strong submission will probably use that these positions come from real games by top players, and so will make chess sense and ...

Back in 2018, there has been introduced new law in Poland to ban trading on sundays, but certain exceptions have been made (listed below). The task today is to determine, can one trade on the sunday provided by the user (according to these rules). Rules You can trade only if one of the followin...

Permutation primes code-golf decision-problem permutations prime A permutation prime is a prime such that at least one of its permutations (not equal to itself) of its digits is a prime. Given a number, check if this number is a permutation prime. Reference program Here is a reference program...

Given a strictly positive integer, N, produce an output satisfying the following: Produce an array of length N. Every string (i.e. "word") in the array is of length N. Every letter in the word is unique. Every first letter of the words are unique between each other. The remaining items of each ...

Inflate a sequence of bytes code-golf The challenge is to decode a sequence of bytes compressed with the DEFLATE algorithm. [to be continued] Sandbox stuff DEFLATE is fairly complicated. Is this too large a challenge for anybody to bother answering it?

Challenge Your task is to create a script in any language that will do the same thing when run backwards. Rules By "backwards," I mean a complete string reversal as opposed to a word reversal. Your code cannot be a repeating set of characters or a single repeating character (e.g., not 2222222...

We usually use g=x; at last to return x, given g is global. However, that's 4 bytes, and we may save some bytes even if the logic looks more long. For example, in this answer, for(i=k=0;i++<5*n;)k+=g(i);i=k; (1) for(i=k=0;i++/n/5<=k;)k+=g(i); (2) where i being larger do no harm, using ...

A great Python golfing tip is to omit needless spaces. But if you are like me, you don't always have the time to search for which spaces to remove. If only there was a way to speed up the process... Task Given a single line of Python, as input, return/output a new line which omits all needless ...

The world is full of Turing-complete programming languages. Just about every useful language (and most useless ones) are Turing-complete. Some even became Turing-complete by accident. Often this is great, since every Turing-complete language supports the same power of universal computation. B...