What is the Sandbox?

This "Sandbox" is a place where Code Golf users can get feedback on prospective challenges they wish to post to the main page. This is useful because writing a clear and fully specified challenge on the first try can be difficult. There is a much better chance of your challenge being well received if you post it in the Sandbox first.

See the Sandbox FAQ for more information on how to use the Sandbox.

Get the Sandbox Viewer to view the sandbox more easily

To add an inline tag to a proposal use shortcut link syntax with a prefix: [tag:king-of-the-hill]

• How are tags added to questions? – guest271314 Jan 9 at 7:51
• @guest271314 You can use this markup to create a tag in a draft: [tag:code-golf] – DJMcMayhem Aug 29 at 15:19
• Why no featured anymore? Can't we have it auto-added or something? – JL2210 Sep 26 at 15:57
• @JL2210 We now have a permanent info box that links to the Sandbox, so the featured tag isn't necessary – caird coinheringaahing Sep 29 at 13:43

Challenge

Given an integer y where y > 0, output a list of in some reasonable format that contains every integer in increasing order up to but not including y, without using any builtin that generates a range of any sort.

If your language has a feature whose specification uses a range, that is not allowed (for example, you cannot use the map quick in Jelly on a single integer because that maps over the range). You can assume that y will not exceed your program's capacity for integers, but it must be able to theoretically work on any integer given no memory, time, or otherwise language constraints.

A format is reasonable for a list a = [a0, a1, ..., an] if and only if there exists a string x, a string y, and a non-empty string z such that the output is x + z.join(a) + y.

• This seems extremely simple :P for(i=0;i<y;i++)printf("%d ",i); – MD XF May 26 '17 at 19:44
• @MDXF Yes, but there's a 4-byte solution in Jelly. :P – user42649 May 26 '17 at 19:48
• Which you have disallowed.... – MD XF May 26 '17 at 19:48
• @MDXF No, there's a 1-byte solution that I disallowed. There's also a 2-byte solution which I disallowed with the rule about the specification backend. Hint: Iterating through a list or iterating like you did is permitted. – user42649 May 26 '17 at 19:52
• Ah, now I see. This would probably get 50 submissions in 10 minutes, have fun with the clogged inbox :P – MD XF May 26 '17 at 19:53
• @MDXF I don't mind :P – user42649 May 26 '17 at 19:53
• I don't think this question would be closed, but I have to voice my dislike for this challenge. I am not a fan of banning builtins in the first place, I feel it has a number of issues. My main problem is it is hard to enforce/judge when someone is using a builtin. This challenge is going to take that and push it to its limits. I feel that this for this question to work you would need a very solid definition of what a built in is and I don't think such a thing can be made. – Wheat Wizard May 27 '17 at 0:24
• @WheatWizard Thank you for your feedback. I will try to get a fully objective way to determine what a builtin is and if I can find one I will mention you again in a comment for your review, and if I can't then this challenge will probably die and be buried by the rest of the sandbox posts because I don't want bad challenges :P – user42649 May 27 '17 at 0:34
• I'd recommend posting this after adding a few rules - in what order do the integers need to be printed? What's the max value y can be? "In a list of some reasonable format" is a bit too broad IMO. – MD XF Jun 7 '17 at 20:45
• @MDXF I will clarify in the post, thanks. – user42649 Jun 7 '17 at 22:07
• @MDXF "in increasing order" I think I clarified. – user42649 Jun 7 '17 at 22:07
• Looks great! My last suggestion is to make it a bit more readable: The # Challenge right at the top doesn't really add anything. And I'd recommend splitting the paragraph in half, i.e. making If your language has a feature whose specification uses a range... its own paragraph. – MD XF Jun 7 '17 at 22:09
• @MDXF Yes, that makes it much more readable. Thanks! – user42649 Jun 7 '17 at 22:10
• Also, the # Challenge is the header of the actual question; the title won't be there in the actual post. :) – user42649 Jun 7 '17 at 22:10

Fence Matrix

Given a positive integer n, output the 2n+1 x 2n+1 "fence"-matrix

0  1  0  1  ...  0
1  2  1  2  ...  1
0  1  0  1  ...  0
1  2  1  2  ...  1
⋮   ⋮  ⋮   ⋮       ⋮
0  1  0  1  ...  0


Alternatively you can also return a nested array or print a string (even with other entry delimiters than spaces or none at all) or output a raster image where each entry is represented by one pixel.

Examples

n = 1
0  1  0
1  2  1
0  1  0

n = 2
0  1  0  1  0
1  2  1  2  1
0  1  0  1  0
1  2  1  2  1
0  1  0  1  0

• related, but not at all close to a dupe – Destructible Lemon Jun 7 '17 at 23:13
• 1. The challenge should specify better about what constitutes a fence matrix. I suggest stating "A fence matrix is a representation of a square matrix where the 0-indexed element at index a of 0-indexed line b has the value a%2+b%2" – fireflame241 Jun 7 '17 at 23:25
• @fireflame241 This suggests using your particular solution, but there are many more to achieve that. – flawr Jun 8 '17 at 8:54
• @DestructibleLemon Ha, I would never have seen the connection if you did not point it out :) – flawr Jun 8 '17 at 8:54

Obsfucation: Use Uncommon Chars

Note that I do not have the SE lookup skills to set this up. An automated query would take this challenge a low way. If someone would like this to happen, I would greatly appreciate some help setting this up :)

Basic search (currently searches for Jelly, anywhere)

First, choose your language. It must have at least 100 answers on PPCG before the posting of this challenge, and at least 25 chars that are not no-ops. /* Click this query and insert your language's name to see if it is valid. If it is, this query will give you legal chars, and their point value */. Use those chars the complete the challenge. The lowest point value wins.

/*This Query

//Can we do challenges for SE queries? If so this would be a decent one :)

What I would like for this query to be:

Gets all chars from the first codeblock following the language name in a heading. Accumulates all chars into a frequency table. Make sure that there are at least 25 relevant chars - we can human inspect this to insure no-ops are not polluting the data. It will then return the bottom 20% (frequency) of chars, rounded down, along with point values from 1-length for each of them. The least common chars will receive lower scores. Ties will have the same point value (do it like tournament rankings - 1,1,3, not 1,1,2.)

Challenge answerers will only be able to use the chars provided. /Should whitespace be excluded (and allowed to be used, with a penalty) because of how SE treats whitespace?/

RE 25 char min: I really would like to get rid of this, but I don't know how else to prevent languages like BF from having an inherent advantage. Even if I restrict BF to 2 chars, it will score really low because they will have point scores 1 and 2.*/

/*The Challenge

I have not yet decided what the challenge should be - snippets to solve as many challenges, with point value as tiebreaker, might work, or a more difficult challenge. Input requested :) */

Anyone who would like may post this challenge to main. Just give credit to @Lordofdark.

How long will I sleep

You need to go to bed, but what you need more is to know how long you will sleep until your alarm rings.

Write a program or function that takes a time (hours and minutes) as input, and outputs the number of hours and minutes until the next occurence of this time.

Rules

• In this challenge every clock in 24h format.
• You must always get the current time for the same timezone; you can assume the input is in this timezone

Input

The input time must be in hours and minutes in any convenient 24h format for your language.
Hours and minutes must always be separated by at least one character

Valid inputs for 8h30:
"8h30"
8H30M
8,30
8 30
[8,30]
...

Invalid inputs for 8h30:
8.5
830
510min

Ouptut

The output is the difference between current time and the next occurrence of the input time (it can only be today or tomorrow).

The same formatting rules apply : hours and minutes separated by at least one character an in 24h format.

Note that the output will always be between 0h00 and 23h59

Examples :

If it is currently 20h10 :

7h30 -> 11h20m
20h -> 23h50m
21h -> 0h50m


Challenge

This is , so the shortest answer in bytes wins. Standard loopholes are prohibited

• This is my first challenge so I'm not sure about the I/O rules – Fabich Jan 31 '17 at 14:51
• Hello and welcome to PPCG! :) Your challenge seems fine, though I recommend specifying that you should use a 24h clock earlier in the post. Aside from that, the "minutes are always two figures" part is a bit odd. Does that mean that if I used the format [8, 30] I would then have to return [8, 05]? Personally I would recommend just saying that hours and minutes have to be separate, as it is simpler and would require less space to show. – FryAmTheEggman Jan 31 '17 at 17:07
• What timezone is the input and the current time? Do we assume UTC? What happens if a language can't get the current time? – Artyer Jan 31 '17 at 22:16
• @FryAmTheEggman You are right I removed the 2 figures condition, and I specified at the beginning the 24h format. – Fabich Jan 31 '17 at 22:58
• @Artyer I guess I should add a condition about input and current being in the same timezone. Something like "You must always get the current time for the same timezone; you can assume the input is in this timezone". What do you think I could do for language without access to current time ? – Fabich Jan 31 '17 at 23:02
• @Lordofdark in general, it's good to not exclude challenges for arbitrary reasons, but in this case there's a very good reason for certain languages to not be allowed. If it can't get the time, it can't compete. – Pavel Feb 1 '17 at 0:37
• Are multi-character separators allowed in the input format (e.g. 8 hours 30 minutes)? They probably shouldn't be, or people may well figure out a way to put their entire program in the separators and thus get a score of 0 (or however many bytes eval is in their language). – user62131 Feb 8 '17 at 5:36
• @Lordofdark can I adopt this abandoned challenge? – programmer5000 Jun 9 '17 at 12:03
• @programmer5000 yes you can. Sorry I totally forgot about this – Fabich Jun 9 '17 at 13:27

This message is open for anyone to adopt and post to main. For more details, see the chat room or meta post.

Visualized Tree of 3n+1 Conjecture

Originally by @KeyuGan. Thanks for letting me use this!

Introduction

Probably you are already familiar with 3n+1 conjecture (aka Collatz conjecture). As is stated in this golfing problem:

• Repeat the following steps:
• If n is even, divide it by 2.
• If n is odd, multiply it by 3 and add 1.

And it is proven that for all positive integers up to 5 * 260, or about 5764000000000000000, n will eventually reach 1.

It is easy to draw a chain of the whole process for an integer (e.g. for 5, the chain is 1<-2<-4<-8<-16<-5).

You are asked to print a string of a visualized 3n+1 tree of all chains resulting from positive integers from 2 to n, containing new lines if necessary.

Input and Output

There is only one input n, which can be read from stdin, be a function parameter or from any external sources.

You can safely assume input is valid and does not exceed your language's processing ability. However, your code should be able to deal with inputs of 2 - 446. Under such circumstances, the biggest number involved is 13120.

[Sandbox note: Is 446 a proper minimum ? It turns out to be the largest number in which the biggest number involves is less than 32767]

The output is flexible, as long as:

• It is a textfile, or a string, or an array of characters, or an array of lines.
• It contains only 0-9, -, |, <, >, ^, v, spaces or new lines, where <, >, ^, v are for arrows, -, | are for lines.
• Not hardcoded
• Correctly visualized and in proper directions (for instance, 1->2->4->8->16->5 and 1-2-4-8-16-5 are not accepted.)
• All numbers included in the output occur exactly once.
• All leaves of the visualized tree should lie in the range of 2 ~ n, that is, all numbers in the output must be necessary for the result.
• the destination of every chain is 1

Besides, the output should meet the following formatting criterion:

• A number should be arranged horizontally and connected.
• There should not be horizontally-adjancent digits from different numbers. For instance, in the following example, 17<34 23<46 is OK, while 17<3423<46 is not. Space(s) should be put between the two numbers under this circumstance.
• There should not be vertically-adjancent digits as well.
• There should not be zero(es) before a number (such as 0016).
• There should be only one arrow for a line.
• The line between two numbers must be straight.
• As is demonstrated in output, - and | can be omitted if not neccessary.
• Lines should not be crossed. A solution without crossed lines is proved to be available. A simple explaination is: Thinking in reverse, you can start from integer x, and draw 2x and (x-1)/3 (if result is odd) following x, and repeat the process for every new number. Stop when you have all required integers from 2 ~ n in the graph and erase all unneccessary numbers.
• You can only draw a line onto and from a number directly, that is, the arrow of the line must be pointing at a digit. e.g. |<--, ^<--, |-- and ^-- are not accepted.
• The direction of arrows and lines must be correct. e.g. ^- and <| are not accepted.
• There should not be spaces between arrow and number.
• There should not be spaces between arrows and lines, neither in lines.

[Sandbox note: Tell me plz if you come up with other loopholes.]

Output is assumed to be printed in a monospaced font (all characters have same width).

Sample

Input

15


Possible Output 1

1<2<4<8<16
^
5<10<20<40<80<160
^     ^     ^
3<6<12|     53<106
|        ^
13<26<52 35<70
^     ^
17<34 23<46
^     ^
11<22 15
^
7<14<28
^
9


Possible Output 2

                   15
v
46
v
23
v
70
v
35
v
106
v
53
v
160
v
80
v
1<2<4<8<16<5<10<20<40<13<26<52<17<34<11<22<7<14<28<9
^
3
^
6
^
12


Possible Output 3

1<2<4<8<16<5     80<160<53<106<35<70<23<46<15
^     v
12>6>3>10<20<40<13<26<52<17<34<11<22<7<14<28<9


Scoring

Your answer should include verifiable output of input 42, without a violation to output requirements. And you should verify your answers with different answers on this page: TBD

[Sandbox note: I will provide a js checker on my site to validate an output.]

Among all accepted codes, shortest code wins.

• Smallest output can be a useful winning criterion in some cases, where there is the possibility of continuously finding smaller outputs with little chance of finding an optimal solution. However, in this case the sequence will always be the same, so the winning criterion is how short an output format can be made before being judged unreadable. This has two problems: 1. This will force output formats towards the subjective boundary between readable and unreadable, making judging validity difficult. 2. An output format does not require programming skill. – trichoplax Oct 22 '16 at 19:47
• You might want to consider taking out the "readable" requirement and just keeping the objective description about adjacent numbers and spacing, as that cannot lead to ambiguity. Then you can use a different winning criterion (such as code golf), and people can be flexible in the output format they choose depending on what allows for the shortest code in their language. – trichoplax Oct 22 '16 at 19:56
• Looks like I was commenting on the version before your edit - apologies if some of this no longer applies... – trichoplax Oct 22 '16 at 19:57
• @trichoplax thanks. I believe your words have convinced me that subjective 'readable' judgement is not that good for this challenge. – Keyu Gan Oct 22 '16 at 20:04
• @trichoplax I have modified the problem a little bit to take out that requirement – Keyu Gan Oct 22 '16 at 20:15
• One way to test that your requirements are objective is to write a validator program that takes the output of a submission as input and indicates whether it is valid. If you can write this program then the requirements are objective, and it will also ensure everyone is working with the same definition. Any problems you run into while writing it will also help to identify any ambiguities in the requirements. – trichoplax Oct 23 '16 at 10:51
• Can I post this abandoned proposal? – programmer5000 Jun 9 '17 at 12:50
• @programmer5000 Sure. Mention me if it doesn't bother you. XD – Keyu Gan Jun 9 '17 at 13:26

Perfect Hash Generator

Given N words you are to generate a perfect hash function (ala gperf). A perfect hash function for a set of strings is a hash function with no collisions. An additional condition is that the range of the generated hash function must be [0...O(N)] (i.e. at most a constant times larger than N). You can use any language for the generated function.

Can we get some feedback on this old post? I'm wondering if it is possible to avoid the obvious loophole of a cat program.

• Sounds good at first blush. Do you foresee this as a [code-golf] or some more extensive challenge? If the later what metric would be used to judge it? I think that evaluation of results for compliance is easy enough if the resulting hashes are composed into programs---in unix: entry < testfile > hash_program && hash_program < testfile | sort -u | wc -l and compare to wc -l testfile---but less obvious if the submitters don't provide a scaffold (and if they do should it be counted toward length in the event that this is a [code-golf]?). – dmckee Jun 22 '11 at 1:24
• Perl solution, 2 bytes (1, plus 1 for -pE instead of -E): ; Or, wait, did you mean that our program has to print another program that generates a hash? Then say";" I suppose, at 6 bytes. – msh210 Jun 16 '16 at 14:52

This message is open for anyone to adopt and post to main. For more details, see the chat room or meta post.

Find the mines!

You are a mine remover. Your job is to find all mines on a field, without a mine explodes. So, you write an application that can find the mines carefully.

The input

The input can either be provided through command line arguments or through STDIN (tell what you use in your submission). The input items are separated by commas.

The input looks like this:

<current step (zero-based)>,<mine count>,<field width>,<field height>,<field data>


The field data is like a Minesweeper field. Rows in the field data are separated by semicolons, columns are separated by nothing, as each column is just one character. Here are the characters you can get:

• X This means that you don't yet know what's there, the real data is still hidden. At the start, you get a field full of Xs.
• / This means that there is nothing on that location.
• <number> Specifies the count of mines around the location of the number.
• F This is marked by a flag by you.
• ? This got a question mark from you. There might be a mine on it, but you are not sure. This is just used as a reminder for you, it doesn't mean something specific to the controller.

Example input:

2,1,3,3,XX1;X1X;XXX


That input means that it's currently your third step, there is one mine, the field is 3x3, and the field looks like:

X X 1
X 1 X
X X X


The output

The output consists of 4 parts: the X of which you want to see the data (like a click in Minesweeper), the location on which you want to put a flag mark, the location on which you want to put a question mark and a sign, used to let the controller know whether you are finished or not (0 for not finished, 1 for finished). Locations are written as X;Y, zero-based. If there is something you don't want to do, output -1. You can also remove flags/question marks using the same way.

Example output:

4;3,-1,3;3


Specifications

• If your first output data is the location of a mine, you hit the mine and you die, but you'll still get a score.
• If you select a X which hides an empty location (/), all adjacent empty fields (and their borders, which are numbers) will be revealed.
• For every step, your program is executed again with the updated arguments.
• When looking for mines, you are allowed to have more flags than the amount of mines. Only if you finish, the amount of flags must not be more than the amount of mines. If the amount of flags is greater than the amount of mines, your submission is disqualified (for every test!) and excluded from the scoreboard.

Testing

When I test your submission, I'll run 100 tests on every submission, with randomly generated fields, which I created using a program that I'll write after I got some feedback. Every submission gets the same test fields, so it's fair. Test fields look like this:

• 10 tests with a 10x10 field and 10 mines.
• 10 tests with a 10x10 field and 12 mines.
• 10 tests with a 12x12 field and 14 mines.
• 10 tests with a 15x10 field and 16 mines.
• 10 tests with a 15x15 field and 35 mines.
• 10 tests with a 20x20 field and 40 mines.
• 10 tests with a 25x25 field and 50 mines.
• 10 tests with a 25x25 field and 60 mines.
• 10 tests with a 50x50 field and 100 mines.
• 10 tests with a 50x50 field and 125 mines.

Scoring

You get 10 points for every mine you find, you lose 5 points if you think there is a mine somewhere when there is none and you lose 2 points for every mine you missed. The scoring is always the same, it doesn't matter whether you finish or die. The highest score wins.

In case of a tie, the count of steps is a tie breaker.

Controller

I'll start working on this after I got some feedback.

• You say "like Minesweeper" a couple of times, but on a cursory read I didn't see anything which differentiates it from Minesweeper. Why is this not a dupe of codegolf.stackexchange.com/q/24118/194 ? – Peter Taylor Jul 24 '14 at 14:58
• @PeterTaylor You are right, only the winning criterion is different. As there is many discussion going on about these dupes with only a different winning criterion, I'll wait for some more opinions about whether it is different enough or not. – ProgramFOX Jul 24 '14 at 15:08
• Maybe you could distinguish it by more than just the winning criterion. How about something crazy like a 3d grid of cubes where you can only access cubes that can be reached from the outside, so you slowly clear it from the outside in. – trichoplax Jul 28 '14 at 22:36
• @githubphagocyte I'm not sure what you mean by "where you can only access cubes that can be reached from the outside". – ProgramFOX Jul 29 '14 at 6:49
• That bit isn't essential - a 3d grid would work without that restriction. What I mean is restricting the cubes that can be uncovered or marked to just those on the outside of the big cube at first. Imagine it like breaking blocks to get through to blocks behind them. – trichoplax Jul 29 '14 at 8:58
• The equivalent in the 2d minefield would be treating the 2d playing area as an actual field which you have to walk across, so you can't walk to a square you want to test without testing the squares on a path to it first. – trichoplax Jul 29 '14 at 9:00
• 3d was just my 1st idea - but you could make it different in other ways. You could stick with the integer grid of squares to uncover, but let the mines beneath the grid take on floating point positions. The number in an uncovered square would be floating point because each of the eight squares adjacent to it may contain only part of a mine (which would explode if any of the squares it is overlapping were uncovered). If mines are squares the same size as the grid squares, then it may take 1, 2 or 4 flagged squares per mine, and each flagged square may contain overlap with 1, 2 or 4 mines. – trichoplax Jul 29 '14 at 9:03
• A simpler change would be to keep everything integer but let the mines be 2x2 squares. – trichoplax Jul 29 '14 at 9:09
• @githubphagocyte Thanks for your comments! What about just changing it into a 3d grid, but keep the 'normal' rules? Doing what you said about only accessing blocks if you broke the block that hides it looks complicated to implement. Unfortunately, there will still be one problem left: if everyone would post an optimal solution, then the scoreboard will boil down to luck. – ProgramFOX Jul 29 '14 at 9:33
• Yes I think with the normal rules there will be a clear optimal solution. I guess even working in from the outside there would still be only one objectively best move at each step. – trichoplax Jul 29 '14 at 10:03
• If you want to avoid the possibility of an optimal solution, there are 2 possibilities. 1.Make it a king of the hill and somehow have bots competing against each other in the same minefield. That way an optimal solution against one bot will be sub-optimal against another. 2.Make a change to the game that makes the search space too large for an optimal solution to be found. Then answers will consist of interesting heuristics and there will be the possibility of continually finding better solutions over a long period of time. – trichoplax Jul 29 '14 at 10:05
• @githubphagocyte Your KotH suggestion is a good idea, thanks! I'll think of a good way to do this. – ProgramFOX Jul 29 '14 at 10:13
• I guess just taking turns would work. You'd just need to decide the winning criteria: survivor when the opponent hits a mine / player who identifies the most mine / player who uncovers the most safe squares / ... – trichoplax Jul 29 '14 at 10:54
• Hello! This looks like a good but abandoned meta post, would you be willing to offer it for adoption? (If you want to, you can still post to main.) Due to community guidelines, if you don't respond to this comment in 7 days I have permission to adopt this. – programmer5000 Jun 9 '17 at 16:54
• Hey @programmer5000, feel free to adopt it. – ProgramFOX Jun 9 '17 at 16:55

Write a brute-forcer for the 3-byte input 'emoticon numbers' challenge

The Emoticon numbers! challenge asks you to identify the 3-byte snippet which evaluates to the highest numeric value in your language, and which also has the bytes in the form ABA (where the outer two are identical and the middle one is different), and which generates an output that is only digits.

I trust your claim that you have identified the best possible one is honestly intended, but as a casual scripter I'm not totally convinced, and can't be reassured by unfamiliar language specification references - since there are only 256^2 possible values, can you convince me with brute force instead?

Write a program or function which:

1. takes no input
2. generates all the possible 3-byte sequences matching the pattern ABA and evaluates them in the same language. (No using one language to generate the best pattern for a different language).
3. Processes all the ones which evaluate to digits-only (output text matches the regex ^[0-9]+\$, with or without trailing newline).
4. Outputs just the ABA sequence which evaluated to the highest value, and an optional trailing newline. No errors or stderr output from failed evaluations.

Clarifications:

• There's no limit on runtime, but your program must at least plausibly finish if run for long enough. Particularly, if evaluating one of the byte sequences would get stuck prompting for keyboard input, or go into an infinite loop, or quit the interpreter, you must avoid or handle that.
• If you are able to usefully reduce the search space (and explain why it's valid for your language) to avoid searching 256^2 options, that's OK. Especially if you need to do so to get past an infinite loop, etc.

Show off your brute-force strength by forcing your brute-forcer into the smallest possible space. Fewest bytes wins.

Tag:

• The whole challenge seems really brute-force :)) – Mr. Xcoder Jun 9 '17 at 17:17
• I actually did that to prove that 9E9 is the optimal JS solution. – programmer5000 Jun 9 '17 at 17:33
• You know your challenge is brute-force-able someone makes a challenge to brute-force it. – programmer5000 Jun 9 '17 at 17:34
• -100 points if your brute forcer fits ABA :D – CalculatorFeline Jun 9 '17 at 18:47
• Now I'm wondering if there are languages for which some program of the form ABA neither halts nor obviously doesn't halt. It's likely too short, but who knows. – user62131 Jun 10 '17 at 3:55
• [With no downvotes or critique it's not too badly formed, but with only +1 upvotes it's not popular either so I am not going to post it] – TessellatingHeckler Jun 28 '17 at 0:31

Inspired by lifecompetes.com

Multiplayer Game of Life (GOL)

There are n players that play the Game of Life (standard rules) on an 50 x 50 grid. (Size, border conditions? Toroidal, Absorbing, Mirroring?)

Before first GOL-Step

When the game starts, each player has 12 cells that he can place anywhere he want as long as they do not overlap. Before the first GOL-step occures every player has to place 6 cells. If two players place their cell on the same spot no cell wil be placed an thei cells will remain in each players bank.

During game

In each GOL-Step, each player can place as many new cell on the grid as he has in his bank. If two or more players want to place a cell on the same spot, no cell will be placed there (the cells will remain in each players bank). Every six GOL-steps all the players who have less that 12 cells in their bank will get a new cell in their bank.

Goal

The goal is achieving the maximum number of cells on the grid during 1000 GOL-steps.

How to participate

Each participant has to write a javascript function of the following form (multiple return statements allowed.)

function my_bots_name(field, bank, golstep){
return p;
}


Where p is a 2d array of points [[x1,y1],[x2,y2],[x3,y3],...] that the player wants to set. field contains a 2d array of the GOL grid, bank indicates the number of cells in the player's bank, and golstep is the index of the current GOL step (golstep == 0 before the first GOL-step occurs). The function may not the global variables and cannot access Math.random() or Date(). In field the empty cells will be set to 0, the own cells will be set to 2 and the other player's cells will be set to 1. (You will not be able to distinguish between various other players.)

The winner will be determined with a game that contains all valid submissions after one week after the first submission.

TODO

The exact environment will be provided so everyone can test the own function before the official runs.

• What size of the grid is appropriate? (dependent on number of players?)
• How many steps should be computed?
• What border conditions should be chosen?
• Is the restriction of Math.random() and Date() apropriate? (The idea was that the games will be the same no matter of who/when they will be run. (Deterministic) )
• – Martin Ender Aug 6 '14 at 12:20
• It looks like it was abandoned, since the user has not been here for more than a month. I was not able to read everything yet - is there something important that should be considered or is it a challenge that shouln't even be started? – flawr Aug 6 '14 at 13:03
• I just thought you might want to have a look to get some inspiration from a previous spec. – Martin Ender Aug 6 '14 at 13:09
• Ok thank you, I wil read them later. – flawr Aug 6 '14 at 13:21
• What do you mean by "standard rules"? The standard rules for Life have binary cells, and this doesn't. – Peter Taylor Aug 7 '14 at 22:07
• Well each cell of the grid can have two states: occupied by a live cell or not. For executing a GOL-Step it does not matter which cell is of which player, they are all treated the same. (As it is in lifecompetes.com) – flawr Aug 7 '14 at 22:15
• What happens to an empty cell that has 3 neighbours of different players? Are new cells only born if they have 3 neighbours of the same player? – trichoplax Aug 10 '14 at 20:23
• Thank you for pointing this out, I did never think about this special case but I just checked livecompetes and they handle this as follows: A new cell is born if two or three of the neighbours are from the same player. If there are three different players invovled the space remains empty. – flawr Aug 10 '14 at 20:40
• why n players instead of 2 players? – Sparr Aug 18 '14 at 4:31
• Can you provide some thoughts why only two players would make a better game? If you could start it with n players at once you can let all submissions compete against each other as you do in the original lifecompetes.com – flawr Aug 18 '14 at 8:11
• @programmer5000 Yes, feel free to adopt! Just make sure work out the details in the sandbox before posting. If you want me to help in one way or another, just ping me! – flawr Jun 9 '17 at 17:43
• Can you add support for other languages? – CalculatorFeline Jun 9 '17 at 18:46
• @programmer5000 I thought you wanted to adopt it?!? – flawr Jun 9 '17 at 19:32
• Please next time say that you want to list it for adoption rather than adopting it yourself! – flawr Jun 9 '17 at 19:39

This message is open for anyone to adopt and post to main. For more details, see the chat room or meta post.

Edit: I'll have to clarify the optional features and there may be more. Essential I want to have the basic features covered, and if anything beyond gets implemented because it saves characters that is okay, but not required.

Edit: Updated but still working on it. Will definitely include edge cases and more examples as test cases.

Edit: It might be cool to have this implemented as a function, and then have some follow up questions where you are allowed to call the function created here while only counting the function call as characters, and not the contents.

Still working on the specifics, but getting it the idea out there.

2-Dimensional Regex

Given a 2-Dimensional regex and a block of text, do a match, a single search and replace or a global search and replace depending on the input.

Implement this as a function. The input should be two arguments to the function. The first is the regex, and the second argument is the string to match. The output should be a truthy or falsey value when doing a match, or the string when doing a search and replace.

Match

Input:

/aaa/
/bbb/
/ccc/


and

aaaab
dbbba
ecccc


Output:

A truthy value


Single Search and Replace

Replace the first instance of the match. The search order is the match that includes the top most character. If multiple matches end up with the top-most character on the same line, then include the left-most match.

Input:

s/bb/cc/
/bb/cc/


and

abbaabba
bbbaabba
bbbaaaaa


Output:

accaabba
bccaabba
bbbaaaaa


Global Search and Replace

Replace all occurrences of the match. Matches do not overlap, and you use the same search order as the single search and replace.

Input:

s/bb/cc/
/bb/cc/


and

abbaabba
bbbaabba
bbbaaaaa


Output:

accaacca
bccaacca
bbbaaaaa


Another example:

Input:

s/aba/bbb/
/aba/aba/
/aba/bbb/g


and

aaaabaaaa
aabaababa
aababaababa
aabaaabbaba
aba


Output:

aaabbbaaa
aabaabbbb
aabbbbababa
aabaaabbbbb
aba


Rules

• Only ASCII characters 32 through 126 are valid.
• Character classes are valid, [a-c4-6] would match an a,b, c, 4, 5, or 6. And [b?7] matches one b, one ?, or one 7.
• . matches any character.
• Use \ to escape there special characters to match their literal character instead of their special meaning: {}[]/\.?*.
• a? matches 0 or 1 a's.
• b+ matches 1 or more b's.
• c* matches 0 or more c's.
• b{2} matches 2 b's. Ranges such as {2,5} to match 2 to 5 b's is optional.
• g flag replaces all of the occurrences, without it only the first occurrence would be replaced. This flag is optional.

Optional features:

• Capture groups are optional. Please specify whether to use () or  to match literal parenthesis.
• Grouping such as (ab)+ matching all of abababab.
• Sounds interesting, but apart from the character-class and . addition it's very similar to codegolf.stackexchange.com/questions/37867/programmers-garden. Some specifics you should clarify (I know you're still working on it, but before I forget it...): Is the regex always rectangular? Are regex and replacement equal in shape? And make sure to specify that matches found with g never overlap. – Martin Ender Sep 17 '14 at 17:04
• First occurrence with which search order? What about all the other things which make up a regex (in particular, full alternation and repetition)? – Peter Taylor Sep 17 '14 at 17:13
• @MartinBüttner I got the inspiration for it while working on the garden one since 2-D regexes would help a lot with that problem! I think it would be cool to implement a lot of regex features and that would be a different problem. /i for case insensitive, maybe even capture groups. The replacement could be a different size than the match (I'll have to define how that affects making a previous match now invalid while using /g). – hmatt1 Sep 17 '14 at 17:58
• @PeterTaylor I'd love to define and add other regex features, but I don't want to make the challenge too hard. I'll think about how to implement repetition and non-rectangular searches. Definitely interested in hearing ideas about making this interesting and feasible! – hmatt1 Sep 17 '14 at 18:00
• As far as overlapping matches goes, it might be okay to have that in the input, but then have the one that would get replaced would be the first in whatever search order we end up choosing. – hmatt1 Sep 17 '14 at 18:02
• If the only regex features you have are a small subset of character classes, it's potentially misleading to call it a regex problem at all. It might be less confusing to talk about 2D pattern matching instead. – Peter Taylor Sep 17 '14 at 21:11
• @PeterTaylor I'm planning on adding more regex features. Good point though! Thanks! – hmatt1 Sep 17 '14 at 21:16
• Having implemented a large part of the ECMAScript regex flavour before, let me tell you that a) getting the spec right and b) implementing regular expressions is a lot of work. Starting with your spec: is repetition greedy? You've got character classes with ranges - what about invalid ranges? What about - at the beginning or end of the string? What about character class negation? What about []? Likewise, what about invalid {m,n} quantifiers? Also, I'd definitely leave out grouping and capturing - that complicates things significantly. – Martin Ender Sep 24 '14 at 22:17
• Added to that are the difficulties from the fact that your regex is 2D. How do I specify that the stuff in two lines is repeated the same amount of times? E.g. if I want to match an n x 2 block of as, I couldn't just write a+ in two lines, right? Because the +s are technically independent. What if there's a + in one line and no + in another? etc... – Martin Ender Sep 24 '14 at 22:19
• Hello! This looks like a good but abandoned meta post, would you be willing to offer it for adoption? (If you want to, you can still post to main.) Due to community guidelines, if you don't respond to this comment in 7 days I have permission to adopt this. – programmer5000 Jun 9 '17 at 18:42
• @programmer5000 you are welcome to adopt this! – hmatt1 Jun 9 '17 at 19:36
• The second and third examples are the same. – CalculatorFeline Jun 11 '17 at 4:38

Irreducible Polynomials over a Finite Field

Given a polynomial whose coefficients are in a finite field, deduce whether or not it is irreducible, without using any related built-ins (you can use a built-in that represents polynomials, but you cannot use built-ins for factoring or otherwise finding information about the polynomial).

A polynomial in F[x] (where F is a field) is considered irreducible if it cannot be factored into the product of non-constant polynomials.

I/O:

Your program/function will take two inputs:

• a prime number for the order of the Finite Field
• some representation for the polynomial

Output a truthy value if the polynomial is irreducible, and a falsy value otherwise.

Test Cases

Your program must run in a reasonable time for this (i.e. 1 hour is definitely too long):

>>> F = 2, f(x) = x^3 + x^2 + x + 1
false
>>> F = 5, f(x) = x^4 + 4x^3 + 4x^2 + x
false
>>> F = 2, f(x) = x^4 + x + 1
true
>>> F = 5, f(x) = x^3 + x + 1
true
>>> F = 5, f(x) = x^6 + 2x^4 + 2x^3 + x^2 + 2x + 1
false
>>> F = 2, f(x) = x^6 + x^2 + 1
false
>>> F = 5, f(x) = 4x^4
false


Meta Note:

These are all really related:

The first especially. This challenge is very similar to the first, except that the first is for irreducible polynomials over Z (the integers), whereas this is for irreducible polynomials over finite fields. Although the challenges are similar, I feel this is different enough to warrant a new challenge

• Is the polynomial guaranteed to be monic? Is the zero polynomial irreducible? Also, are you OK with brute-force solutions that take huge amounts of time? – xnor Oct 18 '14 at 5:20
• @xnor No, the polynomial is not guaranteed to be monic, yes brute-force is okay if it runs in reasonable time for the test cases - I wrote a program that took <20 min for all but the 2nd last test case, which would take 2 days. Regarding zero polynomial, I need to do a bit of research first. – Justin Oct 27 '14 at 5:56
• Now that I almost have an answer to the polynomial factoring question I can say that the test cases can be handled by brute force in a slow language in a few seconds. It's the case over Z that allows tough performance requirements with simple test cases. – Peter Taylor Oct 28 '14 at 7:54
• Hello! This looks like a good but abandoned meta post, would you be willing to offer it for adoption? (If you want to, you can still post to main.) Due to community guidelines, if you don't respond to this comment in 7 days I have permission to adopt this. – programmer5000 Jun 9 '17 at 23:02
• @programmer5000 No, I would still like to use this. I had forgotten about it, and I will improve it and post it to main. Thank you for reminding me about this post – Justin Jun 11 '17 at 6:59
• I feel like many people will not know what a finite field is. I think you should explain it in the post to allow people to answer without google. – FryAmTheEggman Jun 11 '17 at 19:19

stdin FPS

Count the input FPS ("F"s per second)

Read a potentially infinite text stream. While you do, display (at least once per second) your FPS, i.e. the amount the characters "f" or "F" appeared.

The FPS has to be accumulated over a time frame of five seconds, meaning you can't just print the number of Fs you've seen this second every second.

Rules:

• Standard loopholes are banned
• Read one character (or byte) at a time. If (and only if) your language doesn't have the ability to read characters as they appear in the input, you may read the input one line at a time.
• The FPS display may be in any reasonable format, for example 3.54fps or 0.9224
• You may round the resulting numbers to 2 (or more) digits after the decimal point, but no less. Displaying only integers is not allowed.
• To display a new value, you may either:
• clear the screen before printing a new value,
• overwrite the existing value,
• or seperate the values by newline characters
• Be case-insensitive
• In the first second, you don't have to display anything, and if you do, your value doesn't have to be accurate or meaningful.
• Before five seconds have elapsed, you have to average over the total elapsed time since execution started.

Sandbox questions:

• Dupes? (I don't know what to search for)
• "In the first second, you don't have to display anything" and "The FPS has to be accumulated over a time frame of at least 5 seconds" are kind of conflicting. As I understand, we don't have to display anything in the first five seconds... – Mr. Xcoder Jun 11 '17 at 11:57
• @Mr.Xcoder I will clarify. What I mean is that in the first second you don't have to display anything, after the first second the amount of Fs in the first second, after the second second the average amount of Fs in the last two seconds and so on, until you reach the fifth second, after which you may choose to average only over the last five seconds. – L3viathan Jun 11 '17 at 11:58
• Also, before posting, I advice you to clarify "potentially infinite text stream"... the community will react if you do not specify how the input is specifically taken – Mr. Xcoder Jun 11 '17 at 12:01
• @Mr.Xcoder Clarified (and changed) the five seconds rule. What do you suggest regarding the "potentially infinite text stream"? Adding exceptions for memory limits, etc.? Or clarifying again that output has to occur "live"? – L3viathan Jun 11 '17 at 12:06
• Add both the specs, and wait to see if there are any other suggestion here – Mr. Xcoder Jun 11 '17 at 12:15

Implement Nopfunge

Background

Nopfunge is a very simple Befunge derivative, with no stack and no real form of data storage; all it has is an instruction pointer and five commands ("turn north", "turn south", "turn east", "turn west", "continue in same direction"). However, what it does have is a program that repeats forever in two dimensions, which turns out to be enough to make it Turing complete.

Your program must take, as input, four 2D arrays of characters, a, b, c, and d, via any reasonable means. Each of these will have the same dimensions, and they will be rectangular (although not necessarily square). (Note: This is a simplification from the actual syntax of Nopfunge, but is still just as Turing-complete.)

The program will then conceptually work on an infinite array formed out of sub-arrays identical to the inputs, formed by placing a in the top left corner, b along the top edge, c along the left edge, and d everywhere else, like this:

abbbbbbb …
cddddddd …
cddddddd …
cddddddd …

⫶⫶⫶⫶⫶⫶⫶


(Note that because you can't assume your language can do infinite work in finite time, you won't be able to actually represent the compressed array in memory, so you won't be able to calculate the value at a particular coordinate pair in advance; rather, you'll have to calculate it lazily and/or every time it's needed.)

Then simulate the progress of a Nopfunge program on this array. Specifically, there's an instruction pointer that has a position on the array, and a direction; it starts at the top-left corner, going to the right. Repeatedly, run the command specified by the character at the instruction pointer:

• >: Move the instruction pointer one position to the right; it now points right
• <: Move the instruction pointer one position to the left; it now points left
• ^: Move the instruction pointer one position upwards; it now points up
• v: Move the instruction pointer one position downwards; it now points down
•   (space): Move the instruction pointer one position in its current direction

Should the instruction pointer ever attempt to move outside its infinite array (by moving above the top edge or to the left of the left edge), your program should exit. If the instruction pointer never attempts to move outside its infinite array, the program should never exit. (Or in other words, the task is to halt if and only if the Nopfunge program does.)

Clarifications

• You can input the arrays as arrays of character codes (i.e. integers) rather than characters if you wish, but if you do, they must use the ASCII/Unicode encodings, 62 60 94 118 32 for > < ^ v  .
• Your program can do anything if the input arrays aren't all the same size or aren't rectangular.
• You may take additional inputs for the dimensions (width and height) of the input arrays, if you wish.
• It doesn't matter what (if anything) your program outputs; all that matters is whether or not it halts.

Victory condition

This is , so shorter programs (in bytes) are considered to have a better score.

Sandbox questions

• Is the specification easy to understand and unambiguous?

• Is this the best possible input format? I wanted to avoid the secondary task of having to parse Nopfunge's input format (which uses = and ; to split one array into the four given here), but am not sure whether this format or that one is more convenient for solving the task.

• Note so I don't forget: it was pointed out in chat that test cases will be helpful. – user62131 Jun 21 '17 at 10:15

Reindent Java/C/C++/etc. code

Write a program that adds or removes whitespace to format code nicely. Rules for what the code should look like when you're done:

• No line should contain more than one of { and }.
• A { should always be the last thing on a line.
• A } should always be the only thing on a line (besides whitespace that comes before it).
• The amount of whitespace in front of each line should be a fixed multiple of the current nesting count. (You can use any amount of indentation you want, as long as it doesn't change.)
• No whitespace should be inserted or removed that doesn't contribute to satisfying one of these rules.

The nesting count for the first line is 0. The nesting count of any other line is the nesting count of the previous line, plus one if the previous line contains a {, minus one if the current line contains a }.

{ and } inside string literals and comments don't count in the above rules. A string literal is text enclosed in single or double quotes, where single or double quotes with a backslash before them aren't interpreted as the end of the string literal. A comment is text enclosed in /* and */, or text going from // to the end of the line. /* */ comments can be nested.

For example, it should reformat this:

    main() {printf("Hello!"); // I don't care about the world...
}


into this:

main() {
printf("Hello!"); // I don't care about the world...
}


• Strictly interpreted, the current rules don't allow any legal output for input "{}". You probably need to define rules for string literals and comments. I also note that you don't require the indentation to be consistent (different lines can use different multiples of the nesting count), and that inputs with badly indented lines which aren't adjacent to { or } can't be fixed by inserting or removing whitespace adjacent to { or }. – Peter Taylor Jul 23 '14 at 9:54
• @PeterTaylor Fixed those problems. (I think). – tbodt Jul 23 '14 at 15:49
• Fixed some of them. You still need to add exceptions for { or } inside a string literal or comment, including definitions for what constitutes a string literal or comment (since it varies between languages). – Peter Taylor Jul 24 '14 at 15:06
• @PeterTaylor oh, now I understand what you meant. – tbodt Jul 24 '14 at 15:51
• @tbodt I'd like to take over this challenge if you don't plan on posting it – musicman523 Jun 26 '17 at 23:29
• @musicman523 nah I think i'll post it – tbodt Jun 26 '17 at 23:46
• imo the first code snippet is better than the latter – Okx Jun 27 '17 at 10:01

RoboCops and Robbers

A while ago we made some code to golf brain-flak for us. Eventually the code got so good that us humans could no longer compete against it.

Now the code has turned against it and its your job to stop it. You need to out golf the robots. They've already golfed all the numbers so you need to write some Brain-Flak code that pushes a positive number to the stack, but is shorter than the code produced by these two bots:

• The Python, This bot eats numbers for breakfast and caches them for lunch, it still is the top scoring bot on the challenge and its coming for you.

• The Number Cruncher, based on Neil's top scoring Perl answer, made from boiling hot JavaScript and raw HTML this bot takes no prisoners.

Since we need to stop these rampaging robots as soon as possible you need to come up with the smallest number you can to beat them.

Rules

• You must write a program to push a number to the stack in Brain-Flak.

• It must be shorter than the code produced by both of the two bots above when asked to produce the same number

• Your answer must be stack clean (must push the same number regardless of the contents of the stack) and must not use [].

• Your score will be the number you produce, with a lower score being better.

• In the event of a tie where two people have the same number the person with the shorter code will win, if that does not resolve then the first earlier will win.

• Why the ban on []? Irresponsible usage is banned by the immediately preceding condition. – CalculatorFeline Jun 30 '17 at 2:15
• @CalculatorFeline The original question the bots came from also banned it. – Wheat Wizard Jun 30 '17 at 2:16
• This seems so obviously a dupe of the question it links that I'm wondering whether I missed something, because I can't think why you'd put in the effort to sandbox it. – Peter Taylor Jun 30 '17 at 7:18
• @PeterTaylor I think you are missing something. The previous question was a meta golf where one writes a program to write Brain-Flak programs. In this challenge you write a single Brain-Flak program. Its basically a CNR where all the cops submissions are generated by bots. Please let me know if there is anything I can do to make it clearer, or if you still think this is a dupe. – Wheat Wizard Jun 30 '17 at 13:07
• Doesn't this lua answer have the best score? – nmjcman101 Jun 30 '17 at 14:19
• @nmjcman101 Oh it does. I hadn't even seen that! I'll fix the question. Thanks. – Wheat Wizard Jun 30 '17 at 14:20
• Also I'm assuming that this would be posted as a single question, not an actual Cops thread and Robbers thread? – nmjcman101 Jun 30 '17 at 14:21
• @nmjcman101 It would be posted as a single question. – Wheat Wizard Jun 30 '17 at 14:22
• @EinkornEnchanter, but the point of CNR is that the robber's answer does the same thing as the cop's answer. Any answer to this is essentially something which can be combined with the existing answers to the meta-golf to make a better answer to the meta-golf. You could effectively get answers to this question by posting a bounty on the existing one. – Peter Taylor Jun 30 '17 at 19:56

Deep-dichotomize a list

Given a list, dichotomize it (i.e. split it in half), then dichotomize both resulting sublists, etc., until you reach sublists of length 1.

For example, given [1,2,3,4,5,6,7,8]:

  Dichotomize: [[1,2,3,4],[5,6,7,8]]
Map dichotomize: [[[1,2],[3,4]],[[5,6],[7,8]]]
Map map dichotomize: [[[[1],[2]],[[3],[4]]],[[[5],[6]],[[7],[8]]]]
We end here because we only have singletons


If the list has an odd length, the longest of the two lists should be the second one. For example, [1,2,3,4,5] is dichotomized into [[1,2],[3,4,5]].

The content of the list is irrelevant (you can use whatever you want). You can use any list-like representation of your language, as long as both the Input and the Output use the same representation.

Test cases

Input                          Output
[1]                            [1]
[1,2]                          [[1],[2]]
[1,2,3,4]                      [[[1],[2]],[[3],[4]]]
[1,2,3,4,5,6,7,8,9]            [[[[1],[2]],[[3],[4]]],[[[5],[6]],[[7],[[8],[9]]]]


Scoring

This is , so the shortest answer in bytes wins.

• Does the output have to be a list/array? It seems that you're really building a binary tree, and being more flexible in the output would allow languages like Haskell with strict typing which doesn't allow lists of varying depth to participate. – Peter Taylor Jun 28 '17 at 10:19
• @PeterTaylor To me, You can use any list-like representation of your language includes nested lists and so trees. Maybe I should be clearer. – Fatalize Jun 28 '17 at 10:22
• I don't think a binary tree is really list-like. – Peter Taylor Jun 28 '17 at 10:23
• Suggested tags: code-golf, array-manipulation, recursion. – Erik the Outgolfer Jun 28 '17 at 13:25
• Third testcase is a bit off, a ] is missing at the end. – Erik the Outgolfer Jun 30 '17 at 12:58
• "If the list has an odd length, the longest of the two lists should be the second one" seems like unnecessary fluff to me. – scatter Jun 30 '17 at 14:42
• @Christian Why? – Fatalize Jun 30 '17 at 14:48
• @Christian No it's not, how should I split [1, 2, 3, 4, 5] without that information? – Erik the Outgolfer Jun 30 '17 at 15:16
• @Fatalize Because you could just as easily say it doesn't matter, whichever your language does by default is fine. – scatter Jun 30 '17 at 15:52
• I also think it would be cleaner to allow odd splits to go whatever way. – xnor Jul 7 '17 at 5:07

Create a "Neverending" Quine code-golfquine

Your task is to create a program which, when run, outputs its source code repeatedly until stopped. You are allowed to have an extra newline between outputs.
NOTE: All standard loopholes are strictly forbidden. That means cheating quines, etc.

This is , so may the shortest answer win and the best programmer prosper...

• Never mind. Found a duplicate. – ckjbgames Jun 30 '17 at 23:32
• Please delete this proposal then and edit it down to a stub. Thanks! – HyperNeutrino Jul 25 '17 at 0:26

Cops/Robbers section

The robbers/cops section can be found here.

Challenge

Cops

Your job is to write a program that always halts. It can do anything it likes, as long as, given any input, it eventually stops. You must also write a mathematical proof that it stops. Two weeks after you have posted your answer (since math is hard, we want to give the Robbers a chance to steal your academic success), you should edit in this mathematical proof. Once you have done so, you are safe, and your score will be the length of your program (in bytes). Whichever safe program has the lowest score wins!

Robbers

Your job is to write a mathematical proof that a given cops program halts, and post it as an answer. You must do so before the cop posts their proof.

You get 1 point for each post cracked, unless you crack it within 24 hours, in which case it is only 0.1 points (this is to prevent people from racking up points on easy answers). You obviously cannot crack your own submissions.

Notes

1. Cops may not use undocumented or incorrectly documented features of the programming language they are using.
2. Although the proofs will be written in the informal style common within mathematics (as opposed to completely formal proofs), they must theoretically be valid in the framework of ZFC. This will not come into play for most answers, seeing as most of mathematics can be formalized in ZFC, but some might if they use crazy metamathematical shenanigans (please do not do this (just kidding, go crazy kids)).
• This means that cops must write programs that can be proven to halt in ZFC. This means, for example the program if isProofThatZFCisInconsistient(input) then infiniteLoop else stop) would be invalid, since although this program always halts (presumably), you cannot prove this fact in ZFC.
3. Cops, your program is not safe until you post the proof.
• This seems to be more a knowledge of obscure theorems contest than a programming contest. While the Curry-Howard correspondence says that the two are related, IMO this isn't really on topic. – Peter Taylor Jul 6 '17 at 13:30
• @Peter Taylor well, you would also need to golf the obscure theorems. – PyRulez Jul 6 '17 at 14:09
• ^ and obfuscation could come into play. – FlipTack Jan 3 '18 at 19:22

ASCII Art Turtle

As you know, the LOGO programming language allows you to manoeuvre a turtle and draw lines in a graphical way. It occurs to me that we can do this for .

A minimal set of commands to produce would be the R(otate right), F(orward) and P(en) commands. For example, the string FPRRRFRRRRPFPRRRFRRRRPFPRRRFRRRRPFPRRRFRRRRPFPRRRFRRRRPFPRRRFRRRRPFPRRRFRRRRPF would produce the following output:

\|/
- -
/|\


However that AAT code is rather inconvenient so I have chosen the following slightly more compact instruction set:

• F Move one cell in the current direction. Initially the current direction is east. If the pen is down, the cell just vacated is set to one of -/|\ appropriately.
• B Move one cell in the reverse direction. (Initially this would be west, of course.) The cell vacated is set in the same way as for F (since the output characters are all symmetric).
• R Rotate right 45°. Only the current direction changes; nothing is drawn and the current position does not move.
• L Rotate left 45°. Otherwise as per R.
• D Lower the pen. Note that the pen starts lowered.
• U Raise the pen.

The above image could therefore be drawn using the command string BULFDBULFDBULFDBULFDBULFDBULFDBULFDB, while the string LFFUBRFDFFFFFFFFFFFFFFFFFRFFRFBRRFFFFFFFFFFFFFFFFFFFFFUBLLFDFFBLLFFFFFFFFFFFFFFFFFFFFFUBRRFDFRRFFFFFFFFFFFFFFFFFFFFFURBDBBUFLBDBBBBBBBBBLLFFFURBDBBBUFRBDBBBLBB should hopefully produce this somewhat familiar picture:

 /-----------------\
/                   \
---------------------
|                   |
---------------------
|                   |
---------------------
\                   /
\---------|  /----/
| /
|/


Your function or program must take input as a string, or whatever the nearest equivalent is in your language, and output a newline-delimited or newline-terminated string. (For those of you used to using TIO it should be possible to paste the raw string into the ▼ Input field and show the output directly in the ▼ Output field.) Extra blank rows or columns are not allowed, but you are allowed to pad all the lines to the length of the longest non-blank line. You can take input in lower or mixed case if you prefer. You can assume that the input will only use those six letters. You can further assume that U and D commands alternate. You can also assume that you will never write in the same place twice.

This is , so the shortest program that breaks no standard loopholes wins!

An order of primeness

Introduction

In a recent question the concepts of super-primes were explored. A super-prime is a prime whose index is also a prime.

• 2 is not a super-prime, its index is 1
• 3 is a super-prime, its index is 2
• 5 is a super-prime, its index is 3
• 7 is not a super-prime, its index is 4
• ...

The first few of these super-primes are 3, 5, 11, 17, 31, 41, 59, ...

Let us call these primes of at least order 2, because they are more prime than regular primes (which are only of order 1).

Primes of order of 3 or greater can be defined similar. A prime is of order 3 if its index is a prime of order 2.

The first few of the primes at least of order 3 are 5, 11, 31, 41, 59, 127, 179, 277, ...

This is sequence A049076. It was defined by Neil Fernandez in 1999. More information can be found in his Exploring Primeness Project.

Given a prime, return its order.
More formally

• INPUT: A single integer which is guaranteed to be a prime
• OUTPUT: A single integer which is the order of the input.
• You can either return or print the result.

This is , so shortest code wins.

Testcases

           2 ->  1
3 ->  2
5 ->  3
7 ->  1
52711 ->  9
435748987787 -> 11 (happens to be the 11. Prime of order 11)


Sandbox Questions

1. Does it need any more clarification?
2. Should I define order 0 (not a prime) and allow any number as input, or would that over-complicate the challenge?
3. Primes of higher order tend to get big very fast. Should I somehow specify that a language only has to work for test-cases it can actually handle or is their a consensus already?
4. Is the introduction too big?
• This is just a loop round the linked question, and as such qualifies as a duplicate for the purposes of this site. – Peter Taylor Jul 10 '17 at 14:04
• I think this might be an interesting question. – CalculatorFeline Jul 10 '17 at 22:14
• Last test case -> 10 (or all the other cases ->+1) – J42161217 Jul 10 '17 at 23:24

These are two separate challenges.

Given a non-negative real number (no greater than 1×1040 or the biggest your language can comfortably accommodate, whichever is less) convert it to mixed-radix ZYX…432.234…XYZ using the base-36 digits [0-9A-Z] or [0-9a-z] with no leading zeros (except for values smaller than 1). Any reasonable rounding is fine.

Examples

00 (0 × !1)
11 (1 × !1)
210 (1 × !2 + 0 × !1)
311 (1 × !2 + 1 × !1)
420 (2 × !2 + 0 × !1)
421300 (1 × !4 + 3 × !3 + 0 × !2 + 0 ×!1)
1004020 (4 × !4 + 0 × !3 + 2 × !2 + 0 ×!1)
123452304111
42949672958B6570020211
1000000000017A5726651220
184467440737095516157BC43F35350835000211
0.50.1
0.3333333333333333330.02
0.250.112
0.10.0022
5.12521.003
2.7182818284590452351.111111111111111111
0.0013888888888888890.00001

Given a string (no longer than 71 characters or the maximum that gives a result your language can comfortably accommodate, whichever is less) convert it from mixed-base mixed-radix ZYX…432.234…XYZ using the base-36 digits [0-9A-Z] or [0-9a-z]. Any reasonable rounding is fine.

Examples

0 (0 × !1) → 0
1 (1 × !1) → 1
10 (1 × !2 + 0 × !1) → 2
11 (1 × !2 + 1 × !1) → 3
20 (2 × !2 + 0 × !1) → 4
1300 (1 × !4 + 3 × !3 + 0 × !2 + 0 ×!1) → 42
4020 (4 × !4 + 0 × !3 + 2 × !2 + 0 ×!1) → 100
230411112345
8B65700202114294967295
17A572665122010000000000
7BC43F3535083500021118446744073709551615
0.10.5
0.020.333333333333333333
0.1120.25
0.00220.1
21.0035.125
1.1111111111111111112.718281828459045235
0.000010.001388888888888889

• I think this is ready. – Zacharý Jul 11 '17 at 21:56
• I'd like this more with a list of digits 0-35 in the factorial base rather than including letters. – xnor Jul 13 '17 at 8:16
• @xnor Interesting. In that case, there should be no specific upper limit, right? – Adám Jul 13 '17 at 8:17
• @Adám That's right, unless you want a limit for the sake of languages' number bounds. – xnor Jul 13 '17 at 8:18
• @xnor I assume that's covered by default rules. This simplifies the challenge text, so I'll make the change. Thanks – Adám Jul 13 '17 at 8:18
• @xnor How is this? – Adám Jul 13 '17 at 8:24
• @Adám Looks good to me. Is your plan to post a challenge for just one direction? – xnor Jul 13 '17 at 8:32
• @xnor Uh, did you read the post? – Adám Jul 13 '17 at 8:33
• @Adám Yes, and I'm not sure if your plan is to post two challenges, or just whichever direction is more interesting. – xnor Jul 13 '17 at 8:51
• @xnor Two challenges. However, I just noticed that factoradic can easily represent floats too, so should I extend/modify the challenges to that? It would certainly make them different from the existing one. – Adám Jul 13 '17 at 8:53
• Yes, you should do that so built-ins won't be useful (cough Jelly cough) in addition to distinguishing this from the existing challenge. – Zacharý Jul 13 '17 at 19:57
• The original challenge with letters was way better... – J42161217 Jul 14 '17 at 6:25
• I actually agree with @Jenny_mathy because languages like Jelly naturally output different bases in a list format, rather than a string of letters. – Zacharý Jul 14 '17 at 13:17
• @Jenny_mathy Like this? – Adám Jul 14 '17 at 14:22
• @Zacharý Ping ^ – Adám Jul 14 '17 at 14:22

Solve the Trolley Problem code-golfmachine-ethics

Philosophers have long pondered the Trolley problem. Unfortunately, this no human has solved this problem yet. Luckily, as programmers we can use computers to solve the problem for us!

Your program will take as input a (finite) directed graph (with at most one edge from x to y, for any x and y), with a designated node, and a nonnegative integer attached to each edge (representing the number of people tied to that track). In addition, every node has at least one exit edge.

The trolley starts at the designated node. Each turn, if the trolley is at node x, the utilitarian selects an edge (x,y). The people on that edge die, and trolley is now at edge y. This process continues forever.

Note that people can only die once, so if the edge (x,y) has n people tied to it, and the trolley runs over them, say, 100 times, it will still only result in n deaths.

The utilitarian makes his choices in such a way as to minimize the number of people that die (which is guaranteed to be finite, since there are only finite people). Your program will output this number.

You may take the input graph in any reasonable way you like. For example, you could take it as a matrix, and count the designated node as the one labeled 0. Or you could use something like x1,y1,n1;x2,y2,n2;.... For example 0,a,0;a,b,5;a,c,1;b,b,0;c,c,0 to represent the standard trolley problem (with loops at the end).

Testcases:

• 0,a,0;a,b,5;a,c,1;b,b,0;c,c,0 -> 1 (Go from 0 to a, a to c (killing one person), and then keep looping the trolley from c to c).
• 0,0,1;0,a,5;a,a,0 -> 1 (Keep going from 0 to 0, running over 1 person for all eternity),
• 0,a,5;0,b,1;a,a,1;b,b,6 -> 6 (0 -> a -> a -> a -> a -> ... (note that the greedy solution of going to b would be incorrect))
• 0,a,1;0,b,5;a,b,1;b,a,1 -> 3 (0 -> a -> b -> a -> b -> ...)
• 0,a,1;0,b,1;a,a,0;b,b,0 -> 1 (Note that there are two different options that the utilitarian might take that both kill only one person)

This is , so the shortest answer wins! Good luck.

Notes: There will be no sick loop de loops and multitrack drifting is banned.

• So basically: find the cycle of lowest weight? That's pretty similar to finding the cycle of greatest weight, which is equivalent (for integer weights) to codegolf.stackexchange.com/q/107274/194 – Peter Taylor Jul 22 '17 at 9:36
• @Peter Taylor no, since you may have to kill lots of people to get to that cycle, or it might not be reachable at all. – PyRulez Jul 22 '17 at 12:26
• Aha, so it's finding a rho of lowest weight. Still potentially quite similar in implementation, but certainly admits alternative approaches. It might improve clarity to explicitly describe the rho form of the paths to consider. – Peter Taylor Jul 22 '17 at 12:33
• @Peter Taylor what is rho? – PyRulez Jul 22 '17 at 15:44
• ρ , as in Pollard's rho which uses paths which eventually loop back on themselves to factor composite numbers. – Peter Taylor Jul 22 '17 at 16:08
• You should delete this as it has been posted. – Erik the Outgolfer Jul 28 '17 at 19:41

An anagram chain quinepermutationscode-golf

Your challenge is to create a program, P_0, that outputs P_1, that outputs P_2, that outputs... P_n, which finally outputs P_0. Every program in that chain has to be a permutation of every other program, and every program has to be distinct.

For example, if your program (P_0) was

abcd


And that generated another program (P_1)

badc


Which generated another program (P_2)

dabc


Which outputted the first program, you would have a anagram chain of length 3.

Your goal is to make as long a chain as possible, in as short a program as possible.

Your final score will be your chain length - in case there's a tie, the program with the shortest bytecount wins. If there's a tie again, the first poster wins.

Meta:

• I need a better title. Any suggestions?
• [Related]. Actually, I'm pretty sure this is a dupe of another challenge that I can't find at the moment. – Shaggy Jul 23 '17 at 10:13

KotH: Atom Bomb Chess

(Draft. I'll flesh it out some more later. It will probably be implemented in JavaScript or maybe C++.)

Atom Bomb Chess is a variant of chess played much the same as regular chess. The only differences are:

1. The game ends when one or both players have no pieces, or if 50 moves have been made without a piece being captured.
2. When a piece is captured, all pieces a king's move away are also "captured", and the piece doing the capturing is also "captured".

For example, let's look at a 4x4:

pbbr
....
....
RBBP


Where r/R is a rook, b/B is a bishop, and p/P is a pawn. Suppose R moves forward 3 spaces. Then, it captures the p and "explodes":

..br
....
....
.BBP


The idea of this KotH is to make a program that plays Atom Bomb Chess. I will have a few programs to test your submissions against.

• This is a really cool idea! Obviously you'll need to flesh out the rules a bit more, but this is a great start. I would also suggest fixing the board size (you seem to suggest it can be played on any size board, but I think it would be easiest to set it as a constant ahead of time). – musicman523 Jul 23 '17 at 22:31
• @musicman523 Yeah, it'd probably be played on an 8x8 – Conor O'Brien Jul 23 '17 at 22:35
• you forgot that pawns are partially nuke proof – Destructible Lemon Jul 23 '17 at 23:15
• @DestructibleLemon Please elaborate ? I wasn't aware there was some standard rulebook. – Conor O'Brien Jul 24 '17 at 1:45
• I'm not entirely sure where it is, but I remember that pawns, while still being eliminated if they are capturing, or are captured, will not get removed if they are adjacent to a capture. maybe use lichess? – Destructible Lemon Jul 24 '17 at 2:51
• @DestructibleLemon I remember playing it when I was younger with no such restriction, perhaps there are multiple variants. Why suggest lichess? Does it have that mode? – Conor O'Brien Jul 24 '17 at 18:02
• Apart from pawns being nuke proof, the game ends as soon as you nuke the enemy king, if you play on lichess. There are videos on YouTube which include an explanation of the rules and basic "opening theory". – Sleafar Jul 28 '17 at 18:17

Who Won the Chess Game?

Bear with me, this is incredibly bare-bones at the moment; I'll work on this over-time, just wanted to gauge interest on the over-all idea.

Given an input list of moves l, output who won the chess game given that white always goes first, alternating moves from there. Using the following convention for naming the chess squares:

Where the pieces are:

rnbqkbnr
pppppppp
........
........
........
........
PPPPPPPP
RNBQKBNR


The first assumption you will make is that the list of moves passed is a VALID chess game, to completion. The following would be an example input:

[[A2,A4],[A7,A6],...]


The first two moves given would result in:

rnbqkbnr
pppppppp
........
........
P.......
........
.PPPPPPP
RNBQKBNR


Which is white's first move, followed by black's move:

rnbqkbnr
.ppppppp
p.......
........
P.......
........
.PPPPPPP
RNBQKBNR


Then, you would continue parsing moves until a king disappears. Whichever king is left should be declared the winner.

Waiting to Gauge Interest Before Wasting Time on Full Testcase

• – AdmBorkBork Jul 24 '17 at 18:09

Nested list unpacking code-golf

In Python 3.5+, the * operator can unpack a list within a list.

[1,*[2,3,4],5] == [1,2,3,4,5]


The unpacked elements are placed directly into the outer list without increasing the list depth. Note that this is different from the nested three-element list

[1,[2,3,4],5]


Your goal is to simplify a nested list expression by resolving all instances of unpacking. So, the output will simply be a nested list without any *.

Specifically, the input will be an expression that consists of

• A non-empty list of expressions [..]
• An non-empty unpacked list of expressions *[..].
• A digit 1 through 9

The outermost layer will always be a non-empty list. The output is such an expression without any unpacking.

Input: A string of characters [],*123456789

Output: Its unpacked analogue. This can be a string or list structure.

This challenge can be done in any language. Python and other languages with the same unpacking format may not use eval or exec or equivalents.

TODO: I/O details, test cases

• This is similar to least Levenshtein distance to a balanced list (replace *[ with { and then remove unbalanced ]). – Peter Taylor Jul 25 '17 at 7:20

Tell me my vocabulary words! Donated.

When taking textbook notes, I need to write down the vocabulary words and their definition. So your task is to write some code that will give me the vocabulary words and their definitions!

Vocabulary words are detonated with a * on both sides of them, like this: Sentences are .-delimited, meaning that after every . a new sentence starts. An example of a valid sentence would be: This sentence has a *vocab word* in it. The vocab word in the sentence is 'vocab word'.

Input: A string of text with some words marked with asterisks. Only valid inputs will be provided, meaning that only sentences with exactly two asterisks inside of them, and there is something between the asterisks.

Output: A list or delimited string where each item is in the following format: Vocabulary word: sentence. The Vocabulary word is the vocab word found in the sentence. The sentence must be the one with the emboldened vocabulary word in it. If there is any whitespace other than the s separating the words, it needs to be stripped.

Test cases:

Input: *Alan Turing* invented the Turing machine. A *Turing machine* is a machine that follows simple rules, but is capable of any computation.

Output: *Alan Turing*: *Alan Turing* invented the Turing machine.
*Turing machine": A *Turing machine* is a machine that follows simple rules, but is capable of any computation.

Input: What is code-golf? *Code-golf* is the best site on the SE network. But what is SE, you ask? *SE* is a group of Q&A sites, with a system to prevent bad posts.

Output: *Code-golf*: *Code-golf* is the best site on the SE network.
*SE*: *SE* is a group of Q&A sites, with a system to prevent bad posts.

• So split on '.' and then filter to strings containing a *? Or can there be asterisks which don't mark vocabulary words? Should we trim whitespace at the start and end of the sentences? – Peter Taylor Apr 6 '17 at 9:54
• @PeterTaylor A string surrounded by * is a vocab word, like this: *vocab word*. You need to format the outputted sentence correctly, and trim whitespace. I will edit when I have more time. – Comrade SparklePony Apr 6 '17 at 13:52
• Are the following valid inputs or not? a) Unbalanced* asterisk; b) Empty ** vocabulary word; c) Vocabulary* word *has bad spacing. – Peter Taylor Apr 7 '17 at 10:05
• Only the last one is valid. – Comrade SparklePony Apr 7 '17 at 13:25
• The latest wording "only sentences with exactly two asterisks in them" suggests that there's no need to filter: just split on ., trim, and prepend Vocabulary word:  to each sentence. – Peter Taylor Apr 7 '17 at 21:03

Base 32 RFC 4648 Compliant Alphabet!

When writing my handy-dandy totp/hotp token implementation in Python and Swift (ad: here), I encountered for the first time RFC 4648. There is a nice and long memo about RFC 4648, but I only had to focus on a very specific part of it: Page 8. If you are bored and want some enthralling reading, you can find this memo here, and a useful table here.

Basically, I was looking for the alphabet that could be used when base 32 decoding a String. Well, this is it: ABCDEFGHIJKLMNOPQRSTUVWXYZ234567, and padding, =. However, simply printing that is not the challenge –– that would be too simple1. Instead, we are going to print this (the comments are for your reference and do not need to be printed):

__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0x00 - 0x0F or   0 -  15
__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0x10 - 0x1F or  16 -  31
__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0x20 - 0x2F or  32 -  47
__,__,26,27, 28,29,30,31, __,__,__,__, __, 0,__,__,  // 0x30 - 0x3F or  48 -  63
__, 0, 1, 2,  3, 4, 5, 6,  7, 8, 9,10, 11,12,13,14,  // 0x40 - 0x4F or  64 -  79
15,16,17,18, 19,20,21,22, 23,24,25,__, __,__,__,__,  // 0x50 - 0x5F or  80 -  95
__, 0, 1, 2,  3, 4, 5, 6,  7, 8, 9,10, 11,12,13,14,  // 0x60 - 0x6F or  96 - 111
15,16,17,18, 19,20,21,22, 23,24,25,__, __,__,__,__,  // 0x70 - 0x7F or 112 - 127
__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0x80 - 0x8F or 128 - 143
__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0x90 - 0x9F or 144 - 159
__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0xA0 - 0xAF or 160 - 175
__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0xB0 - 0xBF or 176 - 191
__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0xC0 - 0xCF or 192 - 207
__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0xD0 - 0xDF or 208 - 223
__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0xE0 - 0xEF or 224 - 239
__,__,__,__, __,__,__,__, __,__,__,__, __,__,__,__,  // 0xF0 - 0xFF or 240 - 255


There may be trailing spaces after every line, and trailing newlines after the last one.

Also, the single digit numbers can be written as 0[digit] instead of [space][digit]. However, be sure to include the spaces between the four groups.

By the way, the __ actually represent 255, but the former do not make me drown in a sea of digits.

1 Should the challenge be to just print that string?

Any other suggestions to make this challenge more interesting?

• Perhaps get a list of characters (of any length) and print such a table? – ugoren Jul 29 '17 at 19:14

Is this 2048 board valid?

Some 2048 boards are impossible to get into. For example,

2 _ _ 2
_ _ _ _
_ _ _ _
2 _ _ 2


will never occur in a 2048 game. Additionally, these are all impossible:

8 _ _ 8    8 _ _ _    2 2 2 2
_ _ _ _    _ 8 _ _    2 2 _ _
_ _ _ _    _ _ _ _    _ _ _ _
8 _ _ _    _ _ _ _    _ _ _ _


Your program needs to accept a 2048 board, and return a truthy value if the board is reachable, else falsy.

//Explanation of 2048 goes here.

I've listed 4 different boards that cover major test cases. Are there any others I'm missing?

• hehe, don't forget [tag:sliding-puzzle]` – Stephen Aug 1 '17 at 19:56
• As you've stated yourself the main thing missing here is the bulk of the challenge. – TheLethalCoder Aug 2 '17 at 9:14
• I wonder if it suffices to look one step back, or if you need to check if the previous position can itself be produced. – xnor Aug 4 '17 at 7:35

Smooth Usage [On hold while alternative scoring is considered]

We've all seen CPU usage graphs like this one:

Doesn't that look ugly? It would look much nicer as a lovely smooth sine wave...

Challenge

Write a program in the language of your choice that will infinitely produce a regular sine wave in Task Manager's (or Activity Monitor's if that's your thing) CPU usage graph.

You may assume:

• Background CPU usage is constant
• Only a single core must display the pattern
• The system has sufficient cooling to prevent thermal throttling
• Features such as Intel TurboBoost are disabled

This is tagged as to encourage short answers, but ultimately will be a as I suspect perfect solutions will be hard to come by.

• – MTCoster Aug 11 '17 at 15:14
• code-golf and popularity-contest don't mix together. You have to choose one or the other, but making it strictly code-golf would be difficult because you'd have to define what is a good enough sine wave, but on the other hand popularity contests are very risky to do. – dzaima Aug 11 '17 at 15:16
• @dzaima That was exactly my dilemma - which would you suggest fits the challenge best? – MTCoster Aug 11 '17 at 15:17
• I'd say a scoring algorithm of some sort would be best for this, no idea how you'd do it. Like the related one was objective. If you could read the word, it was valid. With this, is a bumpy sin-wave a sin-wave? – Magic Octopus Urn Aug 11 '17 at 20:39
• @MTCoster If you're not sure whether popularity-contest fits, then you can be sure that it does not. It is quite difficult to make an well received one. Go with code-golf or make a code-challenge if you can come up with a good own winning criterion. – flawr Aug 11 '17 at 20:53