> In 2010, Ask.com abandoned the search industry, with the loss of 130 search engineering jobs, because it could not compete against more popular search engines such as Google.
Proposed question: My fifth-grade daughter is learning about codes and ciphers. She has reached the point of decoding a cyphertext that has been encoded with the Caesar cypher even where the offset is not provided in advance.
Without computers this can be time-consuming, especially for long bloc...
Word Game KotH king-of-the-hill
First of all, I don't know what this game is called (or if it even has a name), but it's a modification of a game I've played a few times on road trips, especially with my family. I'll be thinking of a better name.
Any suggestions at all are very welcome.
How It...
Objective
Given a grid of numbers, fill in the inequalities.
Assumptions
The number of columns and rows in the grid are equal.
The maximum size of the grid is 12x12.
The grid only consists of integers 0-9.
The output may contain a trailing newline.
The input is exactly as written below, includ...
Fifth Grade Math Problem for the Week
My fifth-grade daughter is learning about codes and ciphers. She has reached the point of decoding a cyphertext that has been encoded with the Caesar cypher even where the offset is not provided in advance.
Without computers this can be time-consuming, espe...
@El'endiaStarman Ahaha no, Gol><> port of ><> (I actually did the Gol><> one first, which was why I was confident I could temporarily beat you in ><> :P)
I mean, you could always define it as a builtin, but I'd prefer figuring out a way of doing that general class of problems well, rather than that specific problem
This is a simple challenge: Given an input string only containing the characters A-Z, a-z, and spaces, remove all occurrences of the uppercase and lowercase versions of the first character of the string (if the first character is A remove all As and as, if the first character is (space) remove al...
It pushes the scores, duplicates the stack, negates half of them, pushes the length of the stack, pushes the characters, merges them, and then does the loop that puts the scores in their respective spots.
This works because in a merge, the larger half of an odd-length split is the first half, so after the merge, the length of stack is at the top. Hence, I don't have to do 25* or I2:, thus saving two bytes!
Ouroboros, 82
Ouroboros is an esolang I designed this week. Time to take it for a spin!
i.1+!57*(\m1(M\1).96>.@32*-.80=\.78=3*\.66=3*\.82=5*\81=9*++++\2*1\-*+
)L!4*(4Sn1(
Each line of single-char commands1 represents an ouroboros snake, wherein execution proceeds from head (start) to tail (en...
@El'endiaStarman It takes some thought to figure out how to do stuff when the only control flow operator is adjusting where a snake's loop ends. This answer uses most of the standard idioms I've come up with.
@DLosc Oooh, so, each snake's instruction pointer will move through its code in a loop that "terminates" at where the tail goes into the mouth, until the instruction pointer is swallowed?
That's why the second snake of the "Hello world!" program keeps running until the stack is empty.
Right. Though I wouldn't use the word "terminates," since it sounds like "halts" or "exits." The place where the tail goes into the mouth is where control loops back around to the beginning of the line.
Oh, you mean length of stack. I thought you meant counting how many elements in the stack are equal to the top :P
But yeah coming up with mass manipulation operators is tricky (fold/map/filter) - [] currently secretly move elements to the stack on the left/on the right, but it's undocumented because I'm not sure if that's the best thing to do atm
I thought about implementing map in Minkolang by using M[...]. However, I[0g...] would do basically the same thing, and it's only two extra bytes, so...
If filter just drops all zeros, then this should work: I[0gd?x].
It probably would be nice to have that as a built-in. I'll add it after I see a need for it.
i've trying to generate pascal triangle by making a function to find
ncr.... but i've been getting some kind of error... it'd be helpful if
someone finds out that for me and help me resolve it
//pascal trianglw with ncr function
#include <stdio.h>
#include <conio.h>
int ncr(int i,int j);...
Yeah map/filter's doable with a for loop (filter's a little clunky though) and fold by checking stack length. The first two only really work by going through the whole stack though, which might not be desired
Well, yes. But it's the same process: both cop and robber start with a task and have to come up with a program. As opposed, e.g., to the Mystery String challenge, where the cop writes a program and posts the output, but the robber has to start from the output and come up with a program.
I don't know if I'm explaining myself very well, but it seems like the robbers' challenge is strictly easier than the cops' challenge, and thus most or all submissions are likely to be cracked.
The cop has to invent the language and find the program; the robber just has to find the program.
@feersum Maybe I'm just having a failure of imagination. Or a failure of thinking like the inventor of Malbolge. :P
I guess I prefer esolangs that require some thinking to use but are, ultimately, understandable (even if it takes an enormously complicated algorithm to do something simple).
I'd prefer non-existing just so that nobody can post Half Broken Car in Heavy Traffic :P (although tbh I don't even know if it's valid for this challenge)
I just looked into my submitted sandbox challenges and it seems this one might be worth a try, can anyone give it a quick read and give me some feedback?
King of the Sausage
This is just a rough idea that I think would be fun, but as I do not have the time to do it right now, feel free to adopt (just let us know in order to avoid collisions.)
I believe I saw this 'game' in a tv show once: Two competitors are each given a sausage of equal weight....
@flawr can you keep record of your previous games against your opponent? otherwise (if there are only 5 rounds) some weak can beat some good players and it could become a kingmaker game
Write a program or function that outputs/returns the first 10000 prime-indexed prime numbers.
If we call the nth prime p(n), this list is
3, 5, 11, 17, 31, 41, 59 ... 1366661
because
p(p(1)) = p(2) = 3
p(p(2)) = p(3) = 5
p(p(3)) = p(5) = 11
p(p(4)) = p(7) = 17
...
p(p(10000)) = p(104729) = 1...
Challenge
Given a list of numbers, calculate the population standard deviation of the list.
Use the following equation to calculate population standard deviation:
Input
The input will a list of integers in any format (list, string, etc.). Some examples:
56,54,89,87
67,54,86,67
The number...
Create CHIQRSX9+ Analogue Program.
It is meta-golf as well as code-golf. Your task is to create a program in same language, that when given a CHIQRSX9+ will print a that analogue.
That analogue program will do similiar thing that CHIQRSX9+ program do. There's exception though. There's may be mor...
EDIT: This challenge is looking for someone to either writefinish and run an arena server, or someone that wants to rephrase the challenge so that an arena server is not needed and who is also prepared to run entries manually. Both options turned out to be more complicated for me than I originall...
I'm trying to finish up this challenge by writing an arena server but I am running into a few difficulties because the spec states no condition from which can be determined the number of rounds
> A zero-player game... Until today. You are to write a program that plays the Game of Life - and plays it to win, King of the Hill-style. Your opponent (singular) of course tries to do the same. The winner is either the last bot with any live cells, or the player with the most live cells after 5 minutes of clock time.
funny how my commit messages are actually meaningful on this project
Anonymous
3:43 PM
Hiya
Anonymous
@TheDoctor Your GOL KOTH looks interesting, but I think I'm missing something. Are new cells not able to come alive if there's an enemy cell next to them? What happens if both players' cells try to occupy the same square?
Per recommendation I am reposting this from Stack Overflow.
Recently I have been thinking about following issue.
Consider a code for a standard "Hello world!" program:
main()
{
printf("Hello World");
}
Now almost any change in this code will make it completely useless, in fact almost ev...
Given a compiler $C$, create a new compiler $C'$ which works as follows: given source $s$, pass it to $C$. If $C$ is happy with it and produces an executable, then that is that, but if $C$ complains then output an executable which prints out You are a bimbo. The compiler $C'$ accepts every string as a valid program. — Andrej Bauer2 days ago
LOL
I think Foo is such a language. It raises warnings if you try to divide by zero or pop from an empty stack, but I don't think there are actual syntax errors.
Anonymous
@Dennis Brainfuck also. The only errors you can get are moving past the end of the tape (if it doesn't wrap, which it should), and unmatched brackets
Anonymous
Which are both runtime errors in the spec
Anonymous
3:56 PM
@TheDoctor Isn't it turn-based, with both players choosing at the same time?
Anonymous
Oh wait the spec says they take turns placing cells
I took way longer than I should have to write my first entry for the coin flipping KOTH because I couldn't remember how to implement an interface in Java