The Nineteenth Byte

That's unfortunately true I guess

12:21 AM

Any Feedback?

caird coinheringaahing

@Bubbler They both look good, but only if you post them after I post my next challenge :P

Maybe we can tie by writing the 100th challenge on the same day :P

caird coinheringaahing

The basis for the Hexagony one is actually really fascinating, it seems like it'd be really cool seeing if it's widely usable in restricted-source challenges

@Bubbler That'd be a good way to get it :P

A: Sandbox for Proposed Challenges

12:36 AM

@cairdcoinheringaahing It's pretty good for single byte output, but it quickly falls out when you need to output more than one char in a single program (without redirection commands, O(n^2) program size is needed to print n chars)

New Sandboxed Posts

3:54 AM

0

Number of solvable 2xN mazes Your job is to write a program that takes a number N as input and outputs the number of 2-by-N mazes that are solvable. A maze is solvable if it has a path of empty cells (represented here as .) from one end to the other. For example, xxxx..... .....x..x is solvable,...

5:40 AM

I think the accepted answer to "Things to consider when writing challenges" is somewhat outdated and does not reflect the current culture well enough. Should we fix it?

(My answer is yes, in that it does contain valuable tips and it is linked from the Welcome post)

hyper-neutrino

We can take a look at it and either rewrite it totally or just go through it and bring everything up to date

I think that'd be a good idea, especially if it's linked as something we want new users to read before participating

A username

6:15 AM

Any feedback? Note Bubbler's comments at the bottom.

6:32 AM

@Ausername ask for output of the 2XN mazes

makes the question harder but unique

and a lot more interesting than the recurrence mentioned

Yeah, that's definitely an option

making it non code-golf would be a good idea at that point

How would it work without code-golf though?

i'm not sure

but it feels too close to this one : codegolf.stackexchange.com/questions/206957/solve-a-2xn-maze

you just need to extend one of the answers to brute force all the possible binary patterns

True

6:40 AM

Hello everyone!
Have there been any challenge to draw the probability tree of n consecutive coin flips or dice rolls?

In ASCII like

There must be a tree-drawing ascii art challenge

H T
HH TT HT TH
HHH TTT...

@Wasif codegolf.stackexchange.com/questions/tagged/…

I see none

Found one more challenge! (insert evil grin here)

Make sure to objectively describe the ascii art format though

6:43 AM

it'd be funny to use apl trains for binary trees

6:55 AM

   H       T
 H   T   H   T
H T H T H T H T
HHH HHT HTH HTT THH THT TTH TTT

Is this looking bad?

For 3 coin flips

if it's ascii art then ask for centering them

ok

and align each branch with the result

Neil

8:41 AM

@cairdcoinheringaahing huh, (see full text) but there is no more text?

A: Sandbox for Proposed Challenges

@Neil i think that happens when you press shift enter on a message that's "too long" according to se chat

New Sandboxed Posts

9:08 AM

0

xkcd 2385 Based on this comic: https://xkcd.com/2385/ A King of the Hill in which all submissions choose a score. This represents their cybersecurity grade. Their game theory grade is the difference between their grade and 80% of the average grade. Their final score is the geometric mean of both ...

New Sandboxed Posts

9:33 AM

0

A: Sandbox for Proposed Challenges

Is it a chess cycle? code-golf chess decision-problem Inspired by a discussion from the Esolangs.org unofficial Discord Server. Instructions A chess cycle is an arrangement of a chess board where each piece must attack one other piece, and only one other piece. Here is a board example: Your subm...

Anush

10:42 AM

CMC find median of a list/array of integers

one point per language :)

rak1507

10:59 AM

rosettacode.org/wiki/Averages/Median 115 points :)

John Dvorak

11:45 AM

Ruby: ->a{s=a.size;(a[s/2]+a[(s-1)/2])/2.0}

Lyxal

Vyxal, ṁ

12:03 PM

Factor, median