The goal of this challenge is to (eventually) output every possible halting program in a language of your choice. At first this may sound impossible, but you can accomplish this with a very careful choice of execution order.
Below is an ASCII diagram to illustrate this. Let the columns represe...
I'm kinda feeling like I just want to stay away from thread spawning. Some of it is rather creative, but I feel more interested in "true" interpreting.
@PhiNotPi since we only output valid halting programs, we can recognize and refuse to attempt to interpret invalid programs, right?
fork() is not required to make any language turing complete, so you could just not run any program that creates it, and still be within the rules of the challenge
As much as I like language agnostic KotHs, I think they are a lot more work (to write and run). I'm tempted to run a series of language specific KotHs, each in a different language
@feersum you must have been to a weird school if that was an issue. in my school, the children were mostly using German (and occasionally English, French, Russian and Latin in class).
@PhiNotPi I suppose it wouldn't need to be a connected series, just a matter of noting which languages haven't had a KotH yet, and then anyone can pick one of those languages for their next one
Maybe I should make a meta post for people to suggest languages that they'd like to see a language specific KotH for, then we can see which language is most in demand for the next one
@trichoplax I'll probably try to hook up my Pi later this year such that it can act as a small KotH server that can just rerun a KotH all the time and always provide up-to-date results.
okay I just generated some example data for Boggle Compression. string lengths 3 to 50, using hex digits. without any overlap, the minimum size is 1272. the minimum possible size you could compress it to (I think) is 92.
the number seems to vary between 90 and 100, with occasional spikes into the 80s or 100s
@PhiNotPi My earlier (months ago) suggestion was to have a number of pis in one location, and a KotH player per pi. I'm curious about whether you could make a KotH parallelisable though.
The idea was mentioned in chat earlier today that KOTHs could be run in a distributed fashion. I believe that there are several users (including me) who have Raspberry Pis that could contribute to a KOTH Pi Farm.
This is an idea that I would like to see move forward. It would allow for up-to-d...
@MartinBüttner When you say "server", do you mean it would be online accepting new answers automatically too? Or just that you could start it running and leave it for a few days before posting the resulting leaderboard?
Calvin's Hobbies pointed out that the translation to JavaScript doesn't need to be done live - if you had code that would "compile" another language to JS then you could just submit the JS as your answer
@Sp3000 I was thinking of making a language where you describe the pattern in two parts. The first part describes the shape that the characters are taken from, the second part represents a regex.
@Calvin'sHobbies I do not say it is a bad thing and I really like how oeis managed to become a central database for a branch in maths. But up to know I had the impression that they are very strict on what they actually accept. I could not imagine that they would include a sequence from starwars!!!
@TheNumberOne I want to match a 2x2 block of digits, where the bottom two are double the top two. so, "11\n22" and "43\n86" would match, but "12\n34" would not. How might you do that in your language?
that is, each of the bottom two digits is double the digit above it
@TheNumberOne I think a core part of the idea is that your language needs to support patterns that can't be easily described as a single boggle-like path of characters.
so, with the alphabet "abc" and length 3 the strings are aaa aab aac aba ... cca ccb ccc. among these there are substrings that are the whole string, plus aa ab ac .. cb cc?
of the two-character substrings, the doubles are bad (aa bb cc) and the others are good, so any 3 character string that isn't aaa bbb or ccc has a good substring
@MartinBüttner I actually did want to do a mountain peaks look alike contest, but I don't have enough good images. (And those kind of challenges can be written by people that aren't me btw ;) )
Count the number of words in a crossword
code-golf crossword
Consider the following standard 15×15 crossword puzzle grid.
We can represent this in ASCII art by using # for blocks and (space) for white squares.
# #
# #
#
# #
### ## ##
...
Introduction
Partly inspired by this StackOverflow question, let's draw an ASCII Lightning Bolt.
Write a program that takes a positive Integer n via STDIN or command line and outputs the ASCII Lightning Bolt below.
Input
Positive Integer n representing the number of lightning zig-zag tiers to...
code-golfquine
Input Quine
Write a program that takes an input string and outputs a truthy value if and only if the input is equal to its source code, and outputs a falsy value otherwise.
Rules
Your program may not read its own source.
Standard loopholes apply.
Scoring
This is code-golf, ...
The challenge is this:
You are given a url that is as follows:
http://sub.example.com/some/dir/file.php?action=delete&file=test.foo&strict=true
There can be either http or https, there can be any number of subdomains or directories, and the end file can have any name.
You are to create a ful...
Introduction
Hex is a strategy board game played on a hexagonal grid, theoretically of any size and several possible shapes, but traditionally as an 11×11 rhombus. Other popular dimensions are 13×13 and 19×19 as a result of the game's relationship to the older game of Go. According to the book A...