According to this question a Superb Shuffle™️ is defined as a full deck of cards (including jokers) which follows this set of rules:
No two cards (except Jokers) of the same suit are adjacent.
No card (except Jokers) is adjacent to one of the same value.
No card (except Jokers) is adjacent to o...
@FrownyFrog yeah, I did guess it would be easy for APL_like languages...btw, it's apparently 38 in gs2 (credit tails), so that talks by itself: it's not very easy a challenge
@EriktheOutgolfer thanks; I don't think I k is likely to win this one - it's not so good at concatenating matrices with padding, J is perfect for this, APL could use mix (↑⍵)
Progrqmming Puzzle andf Co9de Golf |
codegolf
Intro
We all make mistakes. You, me, everyone. But not computers. They aren't making any mistake. Not even a single typo.
Time to change this injustice.
Task
Your task will be to take a string as input, and display the string character by charact...
@Adám the reason Jelly is a successful golfing language (know what happened to ESMin?) is that it has its own code page, so, theoretically, the solutions are actually the bytes the Unicode chars represent, and not those chars themselves...so, if anagol uses Jelly's codepage, then we could upload a e.g. .jelly file encoded in JELLY
@EriktheOutgolfer Only because it would be an unnecessary and unfair restriction. But a challenge designed especially for 8-bit languages, restricting them to 7 bits, could be fun.
@EriktheOutgolfer some of my favorite (non-ascii-art/KC) challenges have been restricted-source. I find it very fun to try to golf while there isn't access to a big portion of built-ins
Kuhn poker is an extremely simplified form of poker developed by Harold W. Kuhn as a simple model zero-sum two-player imperfect-information game, amenable to a complete game-theoretic analysis. In Kuhn poker, the deck includes only three playing cards, for example a King, Queen, and Jack. One card is dealt to each player, which may place bets similarly to a standard poker. If both players bet or both players pass, the player with the higher card wins, otherwise, the betting player wins.
== Game description ==
In conventional poker terms, a game of Kuhn poker proceeds as follows:
Each player antes...
seem like a good idea for a king of the hill?
i was also thinking i could apply the many-worlds model to this to make the results deterministic
Consider the following sequence:
0 1 3 2 5 4 8 6 7 12 9 10 11 17 13 14 15 16 23 ...
Looks pretty pattern-less, right? Here's how it works. Starting with 0, jump up n integers, with n starting at 1. That's the next number in the sequence. Then, append any numbers "skipped" and that haven't been...
Haskell lists are parametrically polymorphic, so there are subctypes of forall x.[x], but for example [Int] does not have any subtypes, nor can they be made.
@AdmBorkBork A function can accept a infinite number of inputs but doesn't need to evaluate all of them to be used. The same with a list, if the list is lazily evaluated we can check the place of any specific index just fine.
This is called process substitution.
The <(list) syntax is supported by both, bash and zsh. It provides a way to pass the output of a command (list) to another command when using a pipe (|) is not possible. For example when a command just does not support input from STDIN or you need the output ...
A fast-growing evaluator
math code-challenge
Introduction
The fast-growing hierarchy is a hierarchy of, well, fast-growing functions, with a one-to-one correspondence to ordinals. If you did some busy-beaver challenges, you may have worked with them, since it's a systematic means of defining f...
Today, we're going to make an ASCII hexagon. You must write a program or function that takes a positive integer n, and outputs a hexagon grid of size n, made up of asterisks. For example, a hexagon of size 2 looks like this:
* *
* * *
* *
While a hexagon of size 3 looks like this:
* * *
...
I've been working on my answer to the mona lisa problem for just over a year now, and in the past 2 days have found 43 bytes worth of stuff that I think I really should not have missed, would any of yall be willing to take a look at it and tell me if there are any other glaring improvements that I could make?
Excel VBA 32-Bit, 1011 720 Bytes
Revision 47; ΔScore=291 Bytes
Golfed
Full Subroutine that takes no input and outputs the Mona Lisa to the ActiveSheet object on the range [A1:DX96].
There was a lot of black magic involved in golfing this down to its current state, - of note, some of the ...
The accepted answer is 100% without question WRONG. Not halfway wrong or even slightly wrong. I fear this issue is going to confuse and mislead programmers for a long time to come when this question pops up in searches.
NaN is designed to propagate through all calculations, infecting them like a...
@Dennis In your answer here, if I understood it correctly, ∛x² was supposed to be ∛(x²), right? Let me know if I've gotten that wrong though and I'll happily ammend it.
now, since this is a full program, and \ns are characters ('\n'), the output will not appear like [1, 2, 3, …
instead, since there are characters (or empty strings, []) in the list, the list is flattened, every element gets converted to its string representation and then everything is joined into a string
hm, has anybody noticed that, while Martin Ender's user activity has declined, Doorknob's user activity has recently raised? (can't know about mod activity)