Search Results

Stackylogic, 106 105 bytes (non-competing) Sort of what this language is made for. It was made after the challenge, so non-competing 1 moves the pointer down one, and removes itself 0 moves the p …

Turtlèd, 91 65 64 52 47 67 bytes More bytes because now takes case insensitive input Changed approach again does * for even, else o for odd (trailing space) !-u[*+.(a,)(e,)(i,)(o,)(u,)(A,)(E,)(I, …

16: Quarterstaff, 64 1 is truthy, .1......."a".......1. 1->a[Hi, Retina!] ?[-124(.|>a)?] 49a! Try it online! the indentation doesn't do anything, by the way. Satisfies: The first characte …

Based on this challenge, you must determine if a string is covfefey, that is, could it have been produced as output from a covfefifier? The string will be composed of only alphabet chars (^[a-z]\*$, …

Python, 37 bytes def c(s):return s%16*(s%25<1)<(s%4<1)

Chess/mediocre chess player in endgame, 70 pieces Inspired by that domino answer, I decided another game should have this honor. Note that I took a few rules for how the pieces move. Because I don't …

Stackylogic, 226 bytes Yes, that is right. I made a program in Stackylogic (non-TC), which was invented by Helka Homba, for the challenge found here. Stackylogic has only binary input, so 10 (or more, …

Python, 129 79 78 bytes Gotta submit fast! lambda n:n.lower()[:3]in" 0 f n no nil fai fal nan not nul off und".split(" ") True is false and false is true; I have a nice rhyme for this, I really do …

Turtlèd, 490 487 451 bytes Turtlèd does not support newlines in code... so oneliner fun! golfed some bytes for not needing to support 0 Golfed some bytes removing useless code, and some other trick …

Quarterstaff, 94 golfed 1! 10-?[-38a a a a a a a a a a>a10-?]a>b b[>b>d a>c c[1>c1d>d b d(.>e|>d1>e)c]e f>f1b]2-f(.|1)48! Try it online! How it works: Quarterstaff has a register i call "value", …