12:16 AM
0

Introduction Each UTF-8 codepoint can be represented as a sequence of up to 4 bytes. Because of this, it is possible to interpret some 2, 3, or 4-byte characters as multiple 1-byte characters. Challenge Given a UTF-8 character, output it split into a sequence of 1-byte characters. If the chara...

12:30 AM
Weird idea for a KoTH, feedback welcome:
0

JavaScript: Free for All king-of-the-hilljavascript This is a very experimental idea of mine: given a function which is provided a single function as an argument, try to run that function the most times possible in a browser environment while competing against other bots. Bot submissions Each...

("feedback welcome" as in "feedback pleeeeeease")

10 hours later…
10:11 AM
0

OEIS A125959 https://oeis.org/A125959 is a sequence I submitted. It is the following array, which then repeats: 1 2 3 4 5 6 7 8 9 2 4 6 8 1 3 5 7 9 3 6 9 3 6 9 3 6 9 4 8 3 7 2 6 1 5 9 5 1 6 2 7 3 8 4 9 6 3 9 6 3 9 6 3 9 7 5 3 1 8 6 4 2 9 8 7 6 5 4 3 2 1 9 9 9 9 9...

10:32 AM
0

Multiplicative Digital Root The Digital root of a number is found by iteratively summing its digits until you end up with a single number (e.g. 99 -> 18 -> 9) The multiplicative digital root is found by iteratively multiplying the digits (e.g. 99 -> 81 -> 8) The Challenge Print out the digita...

0

Random triple with uniform marginals code-golf random Output a random triple \$(x,y,z)\$ of real numbers such that \$x+y+z=\frac{3}{2}\$ When taken alone, each of \$x,y,z\$ is uniformly distributed from \$0\$ to \$1\$. You may pretend that floats suffice to represent real numbers, and that s...

4 hours later…
2:21 PM
@RedwolfPrograms I find it pointless
there's no real space for any competition whatsoever

2 hours later…
4:46 PM
0

Generate an ASCII art representation of a ribbon plot code-golf ascii-art In this code-golf challenge, you are provided with a series of y values at even x-values as well as a console width and height. The desired output is an ASCII-art representation of a ribbon plot of the y-values scaled to ...

5 hours later…
10:06 PM
@KrzysztofSzewczyk There is, I think. There are all sorts of clever ways to hide the functions, and some interesting strategies could be created

Any feedback on this proposal?

@RedwolfPrograms any strategy will either be defeatable easily, or it won't & will be the best, I don't think there's any middle ground here.

@dzaima True, I guess it'll just turn into a bunch of bots designed to cancel out each others' strategies
Maybe some sort of system to decide who goes first could make it more interesting

@RedwolfPrograms Regarding this what exactly do you find confusing?
That will be much more helpful than just "Summarise the rules"

@cairdcoinheringaahing Reading through it again, it seems a bit more clear, I guess I just wasn't paying enough attention while reading it. I think the challenge is pretty well written.

10:19 PM
@RedwolfPrograms Ah ok. Then thanks!

The restricted source requirement might be a little tough to meet, esp. in non-golfing languages

10:31 PM
@cairdcoinheringaahing Don't 8 and 14 face each other twice?
22 and 20 are present in both

They do, I'm not sure how I missed that
Replaced with 12, 4 instead

My tests show that there are 1288 pairs of printable (excluding some control chars like newline and tabs) ASCII characters which have a nonzero closeness, out of 9025 total pairs

@RedwolfPrograms Including newlines, I think it's ~1300
Yep, 1302, according to this

That doesn't seem to hard, I think it'll make for an interesting challenge

So only around 15% of pairs are available :/

10:38 PM
I'm making a quick function to test some common keywords

print isn't, neither is lambda
I don't think Python is going to do well

Is eval?

Neither eval nor exec are
This should check any input string

I think as the numbers get bigger, the chances of them facing each other drops considerably

The giant table of results in the Sandbox post would suggest that as well

10:48 PM
Maybe instead of code golf, the scoring could be based on the closeness of the code

I feel like that would force people to use certain pairs, which would give languages with custom encodings an advantage

Not as great of an advantage as making it impossible use any other type

For instance, if the score is the sum of all the closenesses, ʒʒ in 05AB1E would score 100, and could very well be useful, but \1\1 (using literal bytes) would never do anything useful in Python, Javascript etc.

Fair point...people could also just go //111111111111...
(or whatever the comment syntax is)

Exactly. You'd then need to require it to be pristine (i.e. no comments) which makes it so much more complicated

10:55 PM
Maybe loosening the restriction, such as at least 50%, or not overlapping

cough cough
Nov 22 at 19:05, by caird coinheringaahing
@AdmBorkBork A personal goal of mine is to write a challenge that stays unanswered for at least a year
I'm perfectly fine with no one being able to answer it

Well, in that case,
Write a program which proves that P=NP
without the numbers 2014 in your code
Perfect challenge, although there's probably some command to do it in one golfing language or another...

@RedwolfPrograms P=NP → P-NP=0 → P(1-N)=0 → P=0 or 1-N=0 → N=1. However, P≠0 and N≠1 → P≠NP.
3

I'll go ahead and contact the nobel prize people
Looks like we're gonna have to reinvent cryptography, and make sure P is 0 this time
4

11:50 PM
Hey guys, I made a really interesting esolang with just 4 characters
It uses a 2d grid of 2-character units, of which there are 16 types
The storage method is what I like most. Instead of a stack or memory cells, data is transferred between parts of the map as packets.
Storage can be made by sending these packets up and down elevators, in a sort of feed tape, and popped from it
Or, just by placing them in temporary storage units, and pulling the contents when required
I call it Plumber
I'm starting on the interpreter and wiki page now