Drafting is now open for this Biweekly Mini-Golf event. Please enter one draft per message as you would want it to appear when it is reposted as a CMC.

For anyone unfamiliar with this, during the event, multiple CMCs (chat challenges) will be posted and the focus of the room will be on solving these - you may post your ideas here, and later we will vote on them and copy them over to the main room once the event begins.

Draft: Alternate between printing two distinct numbers forever

Draft: Sum two n-dimensional arrays that are guaranteed to have the same shape

Draft: Sum two or more n-dimensional arrays that are guaranteed to have the same shape

Draft: Given n, output all reduced proper fractions with n as the denominator (e.g. 3 -> 1/3, 2/3, 8 -> 1/8, 3/8, 5/8, 7/8)

→ 14 messages moved to The Nineteenth Bakery

Draft: Rickroll someone. Standard loopholes allowed and encouraged :P

Draft: Output two integers (between 1 and 100) chosen at random from 2 different distributions (e.g. one is uniform, another is exponential)

Also, feel free to start voting now and just star anything you find interesting or want to see as a challenge.

Draft: Tell me if I can win at rummy, given a list of 13 cards. Input can be taken as characters or numbers (jack is 11, queen is 12, king is 13)

How do you win at rummy?

You make groups of three or four cards. Each group is either a sequence of consecutive cards of the same shape/suit/whatever it's called, or 3/4 cards of the same rank, but different suits

@user What I meant to say was: "Tell me if I can make groups to get rid of all 13 cards with this very hand"

Draft: Given n, m and a flat array (of length n × m) of positive integers, output an n×m matrix of the elements

e.g. 2, 3, [1, 2, 3, 4, 5, 6] -> [[1, 2], [3, 4], [5, 6]]

Draft: Given a binary function and a single argument, return a function which takes a single argument and applies the binary function to both provided arguments

@cairdcoinheringaahing Smells like curry...

@cairdcoinheringaahing wouldnt we only need n to group the items from the flattened array

@EliteDaMyth Yes, but you can ignore unnecessary inputs if you want. Some languages (APL/J/k) have a "reshape" builtin that needs both however

@cairdcoinheringaahing This would simply be `id‘ in Haskell, i think

Draft: Recursive Z-matrix (divide the matrix into four quadrants and visit the quadrants in Z-shaped order, and do the same for inner matrices) of size 2^n for a nonnegative integer n. Output can be 0- or 1-based. (0-based examples: n=0: [[0]], n=1: [[0,1], [2,3]], n=2: [[0,1,4,5], [2,3,6,7], [8,9,12,13], [10,11,14,15]])

Draft: Count bingos on a boolean 5x5 board where marked cells are true(1) and the others are false(0).

Draft: Given no input, output a solution to 4 queens on a 4x4 board: [[0, 1, 0, 0], [0, 0, 0, 1], [1, 0, 0, 0], [0, 0, 1, 0]] or its reflection (or its string equivalent)

Draft: Given an array of positive integers having length 3n+2, compute its "sum-and-skip" transform: [1, 2, 3, 4, 5, 6, 7, 8] -> [1+2, 3, 4+5, 6, 7+8] = [3, 3, 9, 6, 15]