Activity for trichoplax
Type | On... | Excerpt | Status | Date |
---|---|---|---|---|
Comment | Post #287925 |
I'm very interested to see how this competition goes either way, but my personal opinion is that it would be more interesting as a fastest-code challenge than an asymptotic-complexity challenge. (more) |
— | 3 months ago |
Comment | Post #287925 |
Asymptotic complexity is intentionally simplified. That's what makes it so useful for analysis. However, this also takes away the fine tuning aspect of optimisation competition. Measured time leads to open ended competition where the contestant can continually find little ways to shave off a few mill... (more) |
— | 3 months ago |
Comment | Post #287925 |
Measured time introduces the possibility of friendly rivalry between different programming languages. Coding challenges often have more than one aspect of competition: both competing between different answers in the same language, and competing between different languages. With asymptotic complexity,... (more) |
— | 3 months ago |
Comment | Post #287925 |
Measured time is concrete - there is no doubt who is at the top of the leaderboard. Asymptotic complexity is only objective in a mathematical setting. In the real world people can often disagree on what counts as a given complexity. Even for relatively simple programs the use of built in methods may ... (more) |
— | 3 months ago |
Comment | Post #287925 |
I notice the scoring method has been changed from measured time to asymptotic complexity. This is a perfectly valid choice - I just wanted to mention my thoughts on the difference in case it affects your decision: (more) |
— | 3 months ago |
Comment | Post #287925 |
The main diagonal in the example is listed as having no zeros, but the output shows 4 zeros.
The antidiagonal in the example is listed as having 2 zeros, but the output shows no zeros (all ones).
The main diagonal and antidiagonal in the second test case are both listed as having no zeros, but ... (more) |
— | 3 months ago |
Comment | Post #287925 |
> **S** integers corresponding to the number of 0s in each line (top-to-bottom)
>
> **S** integers corresponding to the number of 0s in each column (left-to-right)
The example and the test cases appear to be showing the number of 1s in each line and column, rather than the number of 0s.
Shoul... (more) |
— | 3 months ago |
Comment | Post #287925 |
Might also be handy to have at least one test case with more than one matrix as output. In addition to being a useful test of the code, it will also show the output format you expect for multiple matrices. (more) |
— | 3 months ago |
Edit | Post #287928 |
Post edited: Mark as finalized |
— | 3 months ago |
Suggested Edit | Post #287928 |
Suggested edit: Mark as finalized (more) |
helpful | 3 months ago |
Comment | Post #287925 |
This is looking good.
For the Time constraints section, it would be helpful to specify what size input we need to beat 20 seconds for. It would be good to have at least one test case of this size so we can make sure our solutions are acceptable before posting them. (more) |
— | 3 months ago |
Comment | Post #287928 |
I'd focus on making sure the limit is low enough that it doesn't use up too much of your time.
Provided you have that covered, a slightly higher limit just allows more people to enter, and I'd expect more competitors on the leaderboard to be more likely to drive more competition. (more) |
— | 3 months ago |
Comment | Post #287928 |
I don't know whether it applies to this particular problem, but in general there is a subtle potential difference between asking for solutions to be output, and asking for just the total number of them:
For some types of problem it's possible to count how many solutions exist, without actually fin... (more) |
— | 3 months ago |
Comment | Post #287928 |
With the zero solution cases, I understand that there exist inputs that have zero solutions. What I meant was that you could choose whether such inputs will ever be used as measuring cases.
You could either say "Your code must work correctly with inputs that have zero solutions" or "You may assume... (more) |
— | 3 months ago |
Comment | Post #287928 |
Standardising the input and output sounds good. Hosting a fastest code contest is a lot more work than hosting a code golf contest - best to minimise the additional work you have to do... (more) |
— | 3 months ago |
Comment | Post #287928 |
It's your decision what limit to set, but it might be easier to manage with just one consistent limit for all languages. There are some languages which are difficult to categorise as esolangs or not, so you can save yourself that problem by setting, for example, 20 seconds for all languages. (more) |
— | 3 months ago |
Edit | Post #287928 |
Post edited: Typos |
— | 3 months ago |
Comment | Post #287928 |
If you want to include more languages (perhaps some [esolangs](https://esolangs.org/wiki/Main_Page) that are very slow and impractical but that some people enjoy optimising), it might be worth increasing the time restriction from 1 second. Probably still best to have *some* limit though, so you don't... (more) |
— | 3 months ago |
Comment | Post #287928 |
(Having said that, a test case that runs too quickly risks measuring mostly how fast the input can be read, rather than how fast the calculation can be performed, so there's a balance to be found.) (more) |
— | 3 months ago |
Comment | Post #287927 |
The reason I'm posting this is that I'd like there to be guidance for anyone thinking of posting a fastest-code challenge, particularly since someone has posted [an interesting idea in the sandbox](https://codegolf.codidact.com/posts/287928 "Decoding a non injective bit matrix encoding"). (more) |
— | 3 months ago |
Suggested Edit | Post #287928 |
Suggested edit: Typos (more) |
helpful | 3 months ago |
Comment | Post #287928 |
> The goal is to make a decoder that processes on or more 25x25 encodings under a second (on fairly modern hardware, I suppose).
Now that you have added the Evaluation section explaining that you will be using your machine for measuring, is it worth rephrasing this sentence with that in mind? (Thi... (more) |
— | 3 months ago |
Comment | Post #287928 |
I'm putting these suggestions in a comment thread instead of editing it myself, so anyone can comment if I've misinterpreted anything, and you can ignore any you disagree with:
> Hello!
>
> I have come across this very interesting programming challenge I thought I'd share.
I'd probably skip ... (more) |
— | 3 months ago |
Comment | Post #287928 |
How much flexibility is there in the input? Does it need to be in the exact format shown in the challenge, or can it be taken as command line arguments as numbers without the labels? Can it be taken in a different order?
Also, will inputs always have at least one solution, or does the code need to... (more) |
— | 3 months ago |
Comment | Post #287928 |
It's worth providing some test cases to reduce the barrier to entry (less work to get started might mean more submissions).
Perhaps some small test cases similar to the example case, to help with getting a working algorithm, then some gradually larger test cases including some at the size you inte... (more) |
— | 3 months ago |
Comment | Post #287928 |
To avoid distracting from the main task, it might be better to have the output always be in the same format, regardless of the number of possible solutions. So for example, instead of outputting the solution if it is unique, or the number of solutions if not, the output could always be the number of ... (more) |
— | 3 months ago |
Comment | Post #287928 |
If you're happy to run each submission on your own machine then it's worth specifying a few things:
Which programming languages is this open to? I like the idea of challenges being open to as many as possible, but you might want to consider whether to exclude languages that cost money. Also, are y... (more) |
— | 3 months ago |
Comment | Post #287928 |
As we don't have any prior examples of [fastest-code](https://codegolf.codidact.com/categories/50/tags/5329 "Posts tagged fastest-code") challenges, I've posted in the Q&A section asking for general advice on [Hosting fastest code challenges](https://codegolf.codidact.com/posts/287927) to see what id... (more) |
— | 3 months ago |
Edit | Post #287927 | Initial revision | — | 3 months ago |
Question | — |
Hosting fastest code challenges When posting a fastest-code challenge, what do I need to bear in mind? Unlike with code-golf challenges, where the score is simply the number of bytes in the source code, for a fastest-code challenge the time taken to run will be different on different machines. What options are there for defining... (more) |
— | 3 months ago |
Comment | Post #287925 |
(You can always "undelete" your own posts that you have deleted, so it works as a way of temporarily preventing answers.) (more) |
— | 3 months ago |
Comment | Post #287925 |
I missed your post while typing - sounds like you're fine with running on your own machine. Once you have copied this into the sandbox you can simply press delete on this one - it will remain visible to you but no one will be able to post an answer which means you'll be free to change whatever you ch... (more) |
— | 3 months ago |
Comment | Post #287925 |
We don't yet have any examples of [fastest-code](https://codegolf.codidact.com/categories/49/tags/5329) challenges - yours would be the first.
If you made this a code golf challenge (shortest code) then it would be simpler for you, but would still benefit from some test cases.
If you keep it as... (more) |
— | 3 months ago |
Comment | Post #287925 |
Welcome to Code Golf Codidact! This looks like an interesting challenge.
It might need some fine tuning to make it clear how to calculate the score for generating the automated leaderboard. For example, the run time will differ on different machines. We usually post our challenge ideas in the [San... (more) |
— | 3 months ago |
Comment | Post #287816 |
If we label an answer as invalid but don't delete it, then currently I'm guessing it still appears on the automated leaderboard? If it's decided to go with this approach maybe we could look into amending the leaderboard to not include invalid answers. (more) |
— | 4 months ago |
Comment | Post #287816 |
Is it straightforward to remove this reaction once the answer has been fixed? I guess the thread could remain as history as long as the reaction badge can be removed? (more) |
— | 4 months ago |
Edit | Post #287794 | Initial revision | — | 4 months ago |
Answer | — |
A: How should we handle incorrect answers? Respect both sides We should consider how an approach would affect the poster of the incorrect answer, and how it would affect the posters of correct answers. Correct answers In general, allowing an incorrect answer to remain leaves some or all of the correct answers lower in the automated per l... (more) |
— | 4 months ago |
Comment | Post #287790 |
I think it's worth taking into account that an answer appears in the per language leaderboard below the question, so allowing it to remain in place can give a casual observer (particularly one not familiar with that language) the impression that it is officially approved and correct.
For example, ... (more) |
— | 4 months ago |
Edit | Post #287403 |
Post edited: Formatting |
— | 5 months ago |
Comment | Post #287087 |
There is a guide on Wikipedia to [Converting repeating decimals to fractions](https://en.wikipedia.org/wiki/Repeating_decimal#Converting_repeating_decimals_to_fractions), which also mentions application to other bases. (more) |
— | 5 months ago |
Edit | Post #287403 |
Post edited: Fix missing backticks |
— | 7 months ago |
Edit | Post #287403 |
Post edited: Typo |
— | 7 months ago |
Edit | Post #287403 | Initial revision | — | 7 months ago |
Article | — |
Shortest representation in generalised Roman numerals Given a positive integer, find its shortest representation in generalised Roman numerals. Since there is more than one way to generalise, only the definition shown below applies to this challenge. Definition The digits used are the same as for standard Roman numerals, with the same values: ```... (more) |
— | 7 months ago |
Edit | Post #287377 |
Post edited: Mark as finalized |
— | 7 months ago |
Edit | Post #287386 | Initial revision | — | 7 months ago |
Question | — |
Digit antitranspose Convert a matrix or grid of digits to its antitranspose. For a square matrix , this is its reflection in its antidiagonal. More generally, for a rectangular matrix, this is its reflection in its skew diagonal. Less formally, the line to reflect in is from South West to North East, at 45 degrees re... (more) |
— | 7 months ago |
Edit | Post #287377 |
Post edited: Specify input is rectangular |
— | 7 months ago |
Edit | Post #287376 |
Post edited: Mark as finalized |
— | 7 months ago |
Edit | Post #287381 | Initial revision | — | 7 months ago |
Question | — |
Encode with ROT13.5 Given a string, convert all of its letters using ROT13, and all of its digits using ROT5. This is sometimes referred to as ROT13.5. Input - A sequence of printable ASCII characters (character codes 32 to 126 inclusive) - This may be a string or any data structure of characters Output - A seq... (more) |
— | 7 months ago |
Edit | Post #287377 |
Post edited: Add more test cases |
— | 7 months ago |
Edit | Post #287377 |
Post edited: Move example out of bullet point list |
— | 7 months ago |
Edit | Post #287376 |
Post edited: Add hope for explanations |
— | 7 months ago |
Edit | Post #287377 | Initial revision | — | 7 months ago |
Article | — |
Digit antitranspose [FINALIZED] Now posted: Digit antitranspose Convert a matrix or grid of digits to its antitranspose. For a square matrix , this is its reflection in its antidiagonal. More generally, for a rectangular matrix, this is its reflection in its skew diagonal. Less formally, the line to reflect in is from Sou... (more) |
— | 7 months ago |
Edit | Post #287376 |
Post edited: Slight adjustment to a test case |
— | 7 months ago |
Edit | Post #287376 |
Post edited: Amend test cases |
— | 7 months ago |
Edit | Post #287376 | Initial revision | — | 7 months ago |
Article | — |
Encode with ROT13.5 [FINALIZED] Now posted: Encode with ROT13.5 Given a string, convert all of its letters using ROT13, and all of its digits using ROT5. This is sometimes referred to as ROT13.5. Input - A sequence of printable ASCII characters (character codes 32 to 126 inclusive) - This may be a string or any data str... (more) |
— | 7 months ago |
Edit | Post #287238 |
Post edited: Remove trailing comma from test cases |
— | 7 months ago |
Edit | Post #287329 |
Post edited: Conclude switching to 0-bits for knights would be longer |
— | 7 months ago |
Edit | Post #287329 |
Post edited: Forgot to update Rust Playground link |
— | 7 months ago |
Edit | Post #287329 |
Post edited: Combine bitmask pairs into single applications |
— | 7 months ago |
Edit | Post #287329 |
Post edited: No need to stop knights moving off the top of bottom of the board, only the sides |
— | 7 months ago |
Edit | Post #287341 |
Post edited: Mark code block as text to avoid syntax highlighting making the first letter bold |
— | 7 months ago |
Edit | Post #287238 |
Post edited: Make test case explanations a hidden section |
— | 7 months ago |
Suggested Edit | Post #287341 |
Suggested edit: Mark code block as text to avoid syntax highlighting making the first letter bold (more) |
helpful | 7 months ago |
Edit | Post #287329 |
Post edited: Further golfing |
— | 7 months ago |
Edit | Post #287329 | Initial revision | — | 7 months ago |
Answer | — |
A: Knight safe squares Rust, 236 184 166 142 bytes ```rust |i:u64|{let s=0x101010101010101;let(a,b,c,d)=(i&252s,i&254s,i&127s,i&63s);(i|a>6|c>>15|b>>17|a>>10).countzeros()} ``` All test cases on Rust Playground Takes input as a 64 bit unsigned integer where each 1-bit represents a knight and each 0-bit represent... (more) |
— | 7 months ago |
Edit | Post #287323 |
Post edited: Mark as finalized |
— | 7 months ago |
Edit | Post #287324 | Initial revision | — | 7 months ago |
Question | — |
Sort letters by height Given a sequence of lower case letters, sort them into order of height. Heights The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below: ```text acemnorsuvwxz t i bdfghklpqy j ``` Letters on the same line are defined to be ... (more) |
— | 7 months ago |
Edit | Post #287323 |
Post edited: Add test case |
— | 7 months ago |
Edit | Post #287323 |
Post edited: Add test cases |
— | 7 months ago |
Edit | Post #287323 |
Post edited: List same height letters in alphabetical order |
— | 7 months ago |
Edit | Post #287323 |
Post edited: Allow different formats for input and output |
— | 7 months ago |
Edit | Post #287323 |
Post edited: Fix test case format |
— | 7 months ago |
Edit | Post #287323 |
Post edited: Modify sort order and clarify output |
— | 7 months ago |
Edit | Post #287323 | Initial revision | — | 7 months ago |
Article | — |
Sort letters by height [FINALIZED] Now posted: Sort letters by height Given a sequence of lower case letters, sort them into order of height. Heights The heights of letters are dependent on font, so for this challenge the height order to be used is as defined below: ```text acemnorsuvwxz t i bdfghklpqy j ``` L... (more) |
— | 7 months ago |
Edit | Post #287153 |
Post edited: Mark as finalized |
— | 7 months ago |
Edit | Post #287321 | Initial revision | — | 7 months ago |
Question | — |
Connect the corners without 4 in a row Connect opposite corners of a rectangle of characters without putting 4 characters in a row. Input - Two numbers, W and H, representing the width and height of the rectangle - Each number will be in the range 2 to 70 Output - A rectangular grid of characters, of width W and height H - You m... (more) |
— | 7 months ago |
Edit | Post #287153 |
Post edited: Add link to validator |
— | 7 months ago |
Edit | Post #287153 |
Post edited: Remove accidental link markdown |
— | 7 months ago |
Edit | Post #287153 |
Post edited: Improve examples |
— | 7 months ago |
Edit | Post #287153 |
Post edited: Remove redundant examples |
— | 7 months ago |
Edit | Post #287153 |
Post edited: Golf the output spec |
— | 7 months ago |
Edit | Post #287319 |
Post edited: Remove clashing word "explanation" |
— | 7 months ago |
Edit | Post #287154 |
Post edited: Mark as finalized |
— | 7 months ago |
Edit | Post #287319 | Initial revision | — | 7 months ago |
Question | — |
Circle of text characters Given a radius R, output a text representation of a circle. Input - A positive integer R (strictly greater than zero) - You do not need to handle values of R greater than 32 Output - A square grid of characters of side length 2R + 1 - You may choose any 2 distinct characters to represent th... (more) |
— | 7 months ago |
Edit | Post #287154 |
Post edited: Add link to validator |
— | 7 months ago |
Edit | Post #287154 |
Post edited: Make clear input will never be zero |
— | 7 months ago |
Edit | Post #287154 |
Post edited: Remove ambiguity from output section |
— | 7 months ago |
Edit | Post #287154 |
Post edited: Simplify example format |
— | 7 months ago |
Edit | Post #287154 |
Post edited: Improve output section |
— | 7 months ago |
Edit | Post #287154 |
Post edited: Clarify output section |
— | 7 months ago |
Edit | Post #287154 |
Post edited: Simplify output section |
— | 7 months ago |
Edit | Post #287154 |
Post edited: Fix validity criterion |
— | 7 months ago |
Edit | Post #287131 |
Post edited: Fix missing heading level in heirarchy |
— | 7 months ago |
Edit | Post #287131 |
Post edited: Reverse test edit |
— | 7 months ago |
Edit | Post #287131 |
Post edited: Test edit |
— | 7 months ago |
Edit | Post #287131 |
Post edited: Demote heading2 to heading3 as heading1 is automatically demoted |
— | 7 months ago |
Edit | Post #287131 |
Post edited: Add equivalent test cases for integer inputs |
— | 7 months ago |
Edit | Post #287131 |
Post edited: Explicitly allow integer input |
— | 7 months ago |
Edit | Post #287261 |
Post edited: Mark as finalized |
— | 7 months ago |
Edit | Post #287299 | Initial revision | — | 7 months ago |
Question | — |
Pinwheel words Given a word that can be rotated by 180 degrees (a half turn) about at least one of its 3 axes and continue to be composed of English alphabet letters, output one of its rotated forms. The 3 rotation types will be given the challenge-specific names clock, mirror, and lake rotations. They have more... (more) |
— | 7 months ago |
Edit | Post #287261 |
Post edited: Finalise test cases |
— | 7 months ago |
Edit | Post #287261 |
Post edited: Add extra rotation types for m and w to avoid inconsistency |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Make TODO stand out more |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Remove hidden sections |
— | 8 months ago |
Edit | Post #287261 |
Post edited: Mention that terms are challenge-specific |
— | 8 months ago |
Edit | Post #287261 |
Post edited: Remove hidden sections |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Test edit |
— | 8 months ago |
Edit | Post #287261 |
Post edited: Present collapsed html sections and plain markdown for comparison |
— | 8 months ago |
Edit | Post #287285 | Initial revision | — | 8 months ago |
Answer | — |
A: Thoughts on hiding challenge sections with expandable details tags Since the examples I've given in the question are deliberately brief, they don't demonstrate the benefit of hiding a large block of text. I'm giving an example in this answer of one of my own challenges where I have used expandable `` sections to hide parts of the challenge wording that might be seen... (more) |
— | 8 months ago |
Comment | Post #287283 |
I agree that there is extra work for someone reading the question for the first time (which is why I wanted to get feedback before deciding whether to use this more).
The potential upside I'm weighing against that is the ease of getting to the answers for someone who has already previously read th... (more) |
— | 8 months ago |
Edit | Post #287280 |
Post edited: Separate examples with horizontal lines |
— | 8 months ago |
Edit | Post #287280 | Initial revision | — | 8 months ago |
Question | — |
Thoughts on hiding challenge sections with expandable details tags I've recently started experimenting with hiding some of the sections in a challenge, using an expandable `` tag. This seems to have some advantages, but I'm interested to hear how people find this - any good and bad points and general advice on how and where to use this. I'm asking this in the con... (more) |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Expand intro and hide sections |
— | 8 months ago |
Edit | Post #287261 |
Post edited: Experiment with hiding all sections |
— | 8 months ago |
Edit | Post #287261 |
Post edited: Hide Terminology and Letter rotation sections, plus tidying |
— | 8 months ago |
Edit | Post #287261 |
Post edited: Clarity improvements |
— | 8 months ago |
Edit | Post #287173 |
Post edited: Explicitly allow string input |
— | 8 months ago |
Comment | Post #287173 |
Looking at the input section I now realise I left it implicit that the input could be a string (since I used Y and Z as digits but didn't explicitly say string). I'll edit to make clear that a string of digits or the usual alternatives (any ordered data structure of characters) is fine as an alternat... (more) |
— | 8 months ago |
Comment | Post #287173 |
Thanks for catching this. Now edited to fix. (more) |
— | 8 months ago |
Edit | Post #287173 |
Post edited: Fix incorrect test cases |
— | 8 months ago |
Edit | Post #287261 |
Post edited: Test case intro wording fix |
— | 8 months ago |
Edit | Post #287261 |
Post edited: Clarify letters must be English alphabet letters |
— | 8 months ago |
Edit | Post #287261 |
Post edited: Finish wording and add test cases |
— | 8 months ago |
Edit | Post #287261 |
Post edited: Fix title |
— | 8 months ago |
Edit | Post #287261 | Initial revision | — | 8 months ago |
Article | — |
Pinwheel words [FINALIZED] Now posted: Pinwheel words Given a word that can be rotated by 180 degrees (a half turn) about at least one of its 3 axes and continue to be composed of English alphabet letters, output one of its rotated forms. The 3 rotation types will be given the challenge-specific names clock, mirror, ... (more) |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Make input requirements more lenient |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Update test cases |
— | 8 months ago |
Comment | Post #287253 |
I appreciate that making the code changes to allow cross-category duplicates may not happen in the short term, but this does seem like the ideal solution long term.
Even without the ability to close as a duplicate (so the sandbox post does not automatically link to the finished challenge), it woul... (more) |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Add sandbox questions |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Add sandbox question |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Clarify output section |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Set minimum grid size |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Add test cases |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Hide terminology and examples, and better define output |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Add todo |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Bring example descriptions outside code blocks to allow wordwrap |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Add missing corner of an example |
— | 8 months ago |
Edit | Post #287238 |
Post edited: Improve wording and examples |
— | 8 months ago |
Edit | Post #287238 | Initial revision | — | 8 months ago |
Article | — |
Arbitrary angle wrapping wordsearch Sandbox - Would you change anything about the test case format? - Are there any more edge cases to add to the test cases? Given a rectangular grid of letters and a word to search for, determine whether the word appears in the grid at any arbitrary angle (not just the 8 multiples of 45 degree... (more) |
— | 8 months ago |
Edit | Post #287173 |
Post edited: Typo |
— | 8 months ago |
Comment | Post #287210 |
Can you save a byte by using `fromCharCode` instead of `fromCodePoint`? (more) |
— | 8 months ago |
Comment | Post #287207 |
Looks like you've already solved this for yourself though since you've posted 2 answers that both work correctly for all these cases... I'll leave the explanation up in case anyone else bumps into the same confusion I did. (more) |
— | 8 months ago |
Comment | Post #287207 |
I had this same thought myself after producing the test cases, but I found it was because I was looking at binary strings without leading zeroes, which makes it easy to look at the digit one from the left, instead of five from the right. This causes a problem because the character codes less than 64 ... (more) |
— | 8 months ago |
Edit | Post #287180 |
Post edited: Mark as finalized |
— | 8 months ago |
Edit | Post #287207 | Initial revision | — | 8 months ago |
Question | — |
Lowercase, but not just the letters Given a string of printable ASCII characters, convert them all to lowercase, except not just the letters. ASCII characters that are letters have a bit in their binary representation that is `0` for uppercase, and `1` for lower[]()case. Setting this bit to `1` for a non-letter character that previo... (more) |
— | 8 months ago |
Edit | Post #287180 |
Post edited: Tidying |
— | 8 months ago |
Edit | Post #287180 |
Post edited: Make input and output requirements more flexible |
— | 8 months ago |
Edit | Post #287162 |
Post edited: Mark as finalized |
— | 8 months ago |
Edit | Post #287199 | Initial revision | — | 8 months ago |
Question | — |
Mediocre pop count Given a sequence of letters, omit those with the highest or lowest pop count. Terminology The pop count or [population count] of a binary string is the number of `1`s in it. For this challenge, the pop count of a letter is the number of `1`s in its ASCII character code in binary. For exampl... (more) |
— | 8 months ago |
Edit | Post #287162 |
Post edited: Reformat output section |
— | 8 months ago |
Edit | Post #287162 |
Post edited: Explicitly allow input and output to be in different formats |
— | 8 months ago |
Edit | Post #287182 |
Post edited: Add example of mixed but consistent input and output formats |
— | 8 months ago |
Edit | Post #287182 |
Post edited: Require input and output formats to be consistent between inputs |
— | 8 months ago |
Comment | Post #287182 |
Unless there's a default on Meta to allow `null` as a substitute for an empty string / empty data structure I'm going to say no.
I want the input and output formats to be as flexible as possible to keep the competition open to as many languages as possible (and so people can explore alternative ap... (more) |
— | 8 months ago |
Edit | Post #287154 |
Post edited: Add an extra example of a valid circle |
— | 8 months ago |
Edit | Post #287180 |
Post edited: Tidying |
— | 8 months ago |
Edit | Post #287162 |
Post edited: Clarify output section |
— | 8 months ago |
Edit | Post #287182 |
Post edited: Explicitly allow non-string output sequences |
— | 8 months ago |
Edit | Post #287153 |
Post edited: Settle of input range 2 to 70 to fit in a codeblock without a horizontal scroll bar |
— | 8 months ago |
Edit | Post #287153 |
Post edited: Test code block width to settle on max input size |
— | 8 months ago |
Edit | Post #287161 |
Post edited: Mark as finalized |
— | 8 months ago |
Edit | Post #287182 | Initial revision | — | 8 months ago |
Question | — |
Just the vowels please Given a sequence of letters, output only the vowels. Input - A sequence of letters - This may be a string or any ordered data structure of characters (provided it is consistent between inputs) - The letters may contain a mixture of upper and lower case - The characters that count as letters fo... (more) |
— | 8 months ago |
Edit | Post #287161 |
Post edited: Golf the explanation request |
— | 8 months ago |
Edit | Post #287161 |
Post edited: Simplify output section |
— | 8 months ago |
Edit | Post #287180 |
Post edited: Add subheadings for examples |
— | 8 months ago |
Edit | Post #287180 | Initial revision | — | 8 months ago |
Article | — |
Lowercase, but not just the letters [FINALIZED] Now posted: Lowercase, but not just the letters Given a string of printable ASCII characters, convert them all to lowercase, except not just the letters. ASCII characters that are letters have a bit in their binary representation that is `0` for uppercase, and `1` for lower[]()case. Setting... (more) |
— | 8 months ago |
Edit | Post #287154 |
Post edited: Invite explanations |
— | 8 months ago |
Edit | Post #287154 |
Post edited: Trim redundant example text |
— | 8 months ago |
Edit | Post #287154 |
Post edited: Add examples and explain flexibility |
— | 8 months ago |
Edit | Post #287135 |
Post edited: Mark as finalized |
— | 8 months ago |
Edit | Post #287173 |
Post edited: Fix test case formatting |
— | 8 months ago |
Edit | Post #287173 |
Post edited: Add test cases |
— | 8 months ago |
Edit | Post #287173 | Initial revision | — | 8 months ago |
Question | — |
Balanced quinary quasiquine Given an integer $N$ in balanced quinary, output the first $N$ characters of your source code if $N$ is positive, or the last $-N$ characters of your source code if $N$ is negative. Terminology Quinary Standard quinary (base $5$) has digits $0, 1, 2, 3, 4$. In a quinary number a digit $n$ plac... (more) |
— | 8 months ago |
Edit | Post #287135 |
Post edited: Tidying |
— | 8 months ago |
Edit | Post #287135 |
Post edited: Permit an optional trailing newline |
— | 8 months ago |
Comment | Post #287153 |
I've updated to show a `.` instead of a space for the background. It makes the boundary of the rectangle much clearer - thanks. I'm now half considering using a character that is more central so it aligns better with the `#` but I haven't settled on one yet. (more) |
— | 8 months ago |
Edit | Post #287153 |
Post edited: Add visible background character for clarity |
— | 8 months ago |
Edit | Post #287166 |
Post edited: Typo |
— | 8 months ago |
Suggested Edit | Post #287166 |
Suggested edit: Typo (more) |
helpful | 8 months ago |
Edit | Post #287162 |
Post edited: Make formatting of binary digits consistent |
— | 8 months ago |
Edit | Post #287162 | Initial revision | — | 8 months ago |
Article | — |
Mediocre pop count [FINALIZED] Now posted: Mediocre pop count Given a sequence of letters, omit those with the highest or lowest pop count. Terminology The pop count or [population count] of a binary string is the number of `1`s in it. For this challenge, the pop count of a letter is the number of `1`s in its ASCII c... (more) |
— | 8 months ago |
Edit | Post #287161 |
Post edited: Improve wording of input section |
— | 8 months ago |
Edit | Post #287161 | Initial revision | — | 8 months ago |
Article | — |
Just the vowels please [FINALIZED] Now posted: Just the vowels please Given a sequence of letters, output only the vowels. Input - A sequence of letters - This may be a string or any ordered data structure of characters - The letters may contain a mixture of upper and lower case - The characters that count as letters for... (more) |
— | 8 months ago |
Edit | Post #287156 | Initial revision | — | 8 months ago |
Answer | — |
A: Tips for [fastest-code] in Python If you're not required to use the standard cpython implementation of python, you can usually get a significant speed increase by running your code with PyPy. (more) |
— | 8 months ago |
Edit | Post #287153 |
Post edited: Add some more example cases for 3, 3 |
— | 8 months ago |
Edit | Post #287154 |
Post edited: Add a thought until I have time to look into it |
— | 8 months ago |
Edit | Post #287154 | Initial revision | — | 8 months ago |
Article | — |
Circle of text characters [FINALIZED] Now posted: Circle of text characters Given a radius R, output a text representation of a circle. Input - A positive integer R (strictly greater than zero) - You do not need to handle values of R greater than 32 Output - A square grid of characters of side length 2R + 1 - You may cho... (more) |
— | 8 months ago |
Edit | Post #287153 |
Post edited: Add examples and work on output spec |
— | 8 months ago |
Edit | Post #287153 | Initial revision | — | 8 months ago |
Article | — |
Connect the corners without 4 in a row [FINALIZED] Now posted: Connect the corners without 4 in a row Connect opposite corners of a rectangle of characters without putting 4 characters in a row. Input - Two numbers, W and H, representing the width and height of the rectangle - Each number will be in the range 2 to 70 Output - A rectan... (more) |
— | 8 months ago |
Comment | Post #287133 |
Apart from the choice of outputs it's identical, but the same applies to Kolmogorov complexity challenges in general. That's not to say this new challenge is worth posting, but I wanted to get some feedback to see how different a challenge would need to be to be well received.
No plans to post thi... (more) |
— | 8 months ago |
Comment | Post #287088 |
As for the temptation to downvote, if you decide to then it will be part of the result of the experiment, so I don't want to discourage you from doing so. A failed experiment is still useful... (more) |
— | 8 months ago |
Comment | Post #287088 |
Thanks for the feedback - it's useful whether in the sandbox or here. I understand the sandbox can't catch everything.
I share your concerns, and thought carefully about how to choose the numbers to avoid a simple built-in solution or a brute force testing of all permutations. I estimated that the... (more) |
— | 8 months ago |
Edit | Post #287135 |
Post edited: Clarify magnitude |
— | 8 months ago |
Edit | Post #287135 |
Post edited: Use "fewer" for consistency |
— | 8 months ago |
Edit | Post #287135 |
Post edited: Remove word "still" that depends on previous optional section |
— | 8 months ago |
Edit | Post #287135 |
Post edited: Hide supplementary terminology section |
— | 8 months ago |
Edit | Post #287135 |
Post edited: Hide detailed justification for trivial case threshold |
— | 8 months ago |
Edit | Post #287135 |
Post edited: Make lengths explicitly characters in excluded cases section |
— | 8 months ago |
Edit | Post #287135 |
Post edited: Remove ambiguity in code length in input section |
— | 8 months ago |
Edit | Post #287139 | Initial revision | — | 8 months ago |
Answer | — |
A: 55 fruit salad: choose your own Kolmogorov complexity [Python 3], 319 bytes ```python print('riBfig,gấc,barBbilBdewBmulBtayBabiu,açaí,bael,date,lime,lulo,neem,noni,pear,pili,plum,rimu,sloe,sorb,yuzu,bearBblueBcranBcrowBemu BhackBjuneBlimeBpineBraspBwineBwolfByew Backee,akebi,apple,araza,cacao,caqui,carob,etrog,grape,guava,ilama,jagua,kokum,kubal,lem... (more) |
— | 8 months ago |
Edit | Post #287135 |
Post edited: Remove ambiguous reference to length |
— | 8 months ago |
Edit | Post #287135 |
Post edited: Clarify that 3 or fewer characters is not a valid answer |
— | 8 months ago |
Edit | Post #287135 |
Post edited: Explicitly state input will be in balanced quinary |
— | 8 months ago |
Edit | Post #287135 | Initial revision | — | 8 months ago |
Article | — |
Balanced quinary quasiquine [FINALIZED] Now posted: Balanced quinary quasiquine Give an integer $N$ in balanced quinary, output the first $N$ characters of your source code if $N$ is positive, or the last $-N$ characters of your source code if $N$ is negative. Terminology Quinary Standard quinary (base $5$) has digits $0, 1, ... (more) |
— | 8 months ago |
Edit | Post #287131 |
Post edited: Make zero knights an explicitly possible input rather than just a test case |
— | 8 months ago |
Edit | Post #287133 | Initial revision | — | 8 months ago |
Article | — |
Cod golf: choose your own shoal This is a fixed output challenge. It is similar to a standard Kolmogorov complexity challenge, except you get to choose your own fixed output. Given no input, output 255 fishes. You may choose any 255 distinct fishes from the following list: ```text african glass catfish african lungfish aholeh... (more) |
— | 8 months ago |
Edit | Post #287088 |
Post edited: Only the output must be deterministic - not necessarily the code |
— | 8 months ago |
Comment | Post #287131 |
Upon rereading I can see that "characters" implies they must be strings/text - which was not my intention. I've edited the input section to explicitly allow numbers and Booleans. (more) |
— | 8 months ago |
Edit | Post #287131 |
Post edited: Explicitly rule in Boolean input |
— | 8 months ago |
Comment | Post #287131 |
> You may take input in the format of your choice provided it does not provide additional information that would help solve the challenge
I can't see any way that a two-dimensional Boolean array would solve part of the challenge for you, so yes go ahead (more) |
— | 8 months ago |
Edit | Post #287105 |
Post edited: Mark as finalized |
— | 8 months ago |
Edit | Post #287131 | Initial revision | — | 8 months ago |
Question | — |
Knight safe squares Given a chess board with some knights on it, say how many squares are neither attacked by a knight nor containing a knight. Input - An 8 by 8 grid where each square is either a knight or empty - The input can contain any number of knights from 0 to 64 - You may choose to take input with any 2 d... (more) |
— | 8 months ago |
Edit | Post #287105 |
Post edited: Remove sandbox questions |
— | 8 months ago |
Edit | Post #287105 |
Post edited: Remove redundancy in input section |
— | 8 months ago |
Edit | Post #287105 |
Post edited: Add image of knight's moves from Wikipedia |
— | 8 months ago |
Edit | Post #287105 |
Post edited: Input spec golfing |
— | 8 months ago |
Edit | Post #287114 |
Post edited: Add note to multiple valid outputs test cases |
— | 8 months ago |
Edit | Post #287114 |
Post edited: Change requirement for a single integer from implicit to explicit |
— | 8 months ago |
Edit | Post #287092 |
Post edited: Mark as finalized |
— | 8 months ago |
Edit | Post #287114 | Initial revision | — | 8 months ago |
Question | — |
The holeyest base Given a positive integer as input, indicate which base from 2 to 16 gives the most holes in the representation of the input in that base. The digits used are 0123456789ABCDEF. Note that these include upper case letters (the number of holes would be different for lower case letters). Different f... (more) |
— | 8 months ago |
Comment | Post #282816 |
Is it worth clarifying that this restriction applies to general challenges but has exceptions for specific challenge types? For example, optimising to the test cases is fine if the challenge is defined as a test-battery rather than a specification (that is, where the tests *are* the specification), a... (more) |
— | 8 months ago |
Comment | Post #283941 |
There seems to be voting on this same point on another Meta discussion [Rules for function submissions](https://codegolf.codidact.com/posts/286366/286602#answer-286602) so I'm linking both ways for future reference. (more) |
— | 8 months ago |
Comment | Post #286602 |
There seems to be voting on this same point on another Meta discussion [Default Rules: Code Golf I/O](https://codegolf.codidact.com/posts/282784/283941#answer-283941) so I'm linking both ways for future reference. (more) |
— | 8 months ago |
Edit | Post #287112 | Initial revision | — | 8 months ago |
Answer | — |
A: What would this community like to see in a Codidact API? I'd like to post king-of-the-hill contests that read code directly from answers Essentials This is the only feature I would need in order to start posting contests. - The answer content for each answer to a specified post This allows extracting the code block that constitutes a king-of-the-... (more) |
— | 8 months ago |
Edit | Post #287110 | Initial revision | — | 8 months ago |
Question | — |
What would this community like to see in a Codidact API? (Note that I'm not a Codidact dev - I don't know Ruby or C# - and I'm not involved in any work or decision making - I'd just like to hear what you'd be interested in) I posted previously on Codidact Meta to ask Do we have a public API yet? The answer was that it is planned to make one at some ... (more) |
— | 8 months ago |
Edit | Post #287105 |
Post edited: Clarify input section and include example in test cases |
— | 8 months ago |
Edit | Post #287090 |
Post edited: Mark as finalized |
— | 8 months ago |
Edit | Post #287108 | Initial revision | — | 8 months ago |
Question | — |
8 coexisting queens This is a fixed output challenge. Output a textual representation of a chessboard hosting 8 queens, none of which are attacking each other. There are 92 ways of arranging them, 12 if rotations and reflections are discounted. You may choose any 1 of these arrangements. You are not required to ca... (more) |
— | 8 months ago |
Edit | Post #287090 |
Post edited: Clarify intro |
— | 8 months ago |
Edit | Post #287092 |
Post edited: Avoid impression that there are always 3 valid outputs |
— | 8 months ago |
Comment | Post #287090 |
Good point - thanks. I've now included the 12 fundamental solutions as text and images. (more) |
— | 8 months ago |
Edit | Post #287090 |
Post edited: Add the 12 fundamental solutions as examples |
— | 8 months ago |
Edit | Post #287105 |
Post edited: Explain knight's move for completeness |
— | 8 months ago |
Edit | Post #287105 |
Post edited: Add sandbox questions |
— | 8 months ago |
Edit | Post #287105 |
Post edited: Remove redundant integer confusion |
— | 8 months ago |
Edit | Post #287105 | Initial revision | — | 8 months ago |
Article | — |
Knight safe squares [FINALIZED] Now posted: Knight safe squares Given a chess board with some knights on it, say how many squares are neither attacked by a knight nor containing a knight. Input - An 8 by 8 grid where each square is either a knight or empty - You may choose to take input with any 2 distinct characters re... (more) |
— | 8 months ago |
Edit | Post #287090 |
Post edited: Add code-golf tag |
— | 8 months ago |
Edit | Post #287086 |
Post edited: Mention an old pending edit has been resolved now |
— | 8 months ago |
Edit | Post #287092 |
Post edited: Typo |
— | 8 months ago |
Edit | Post #287092 | Initial revision | — | 8 months ago |
Article | — |
Holeyest base representation [FINALIZED] Now posted: The holeyest base Given a positive integer as input, indicate which base from 2 to 16 gives the most holes in the representation of the input in that base. The digits used are 0123456789ABCDEF. Note that these include upper case letters (the number of holes would be different fo... (more) |
— | 8 months ago |
Edit | Post #287090 |
Post edited: Explicitly rule in hardcoding |
— | 8 months ago |
Edit | Post #287090 |
Post edited: Make output spec more watertight |
— | 8 months ago |
Edit | Post #287090 | Initial revision | — | 8 months ago |
Article | — |
8 coexisting queens [FINALIZED] Now posted: 8 coexisting queens This is a fixed output challenge. Output a textual representation of a chessboard hosting 8 queens, none of which are attacking each other. There are 92 ways of arranging them, 12 if rotations and reflections are discounted. You may choose any 1 of these arra... (more) |
— | 8 months ago |
Edit | Post #287059 |
Post edited: Mark as finalized |
— | 8 months ago |
Edit | Post #287088 | Initial revision | — | 8 months ago |
Question | — |
55 fruit salad: choose your own Kolmogorov complexity This is a fixed output challenge. It is similar to a standard Kolmogorov complexity challenge, except you get to choose your own fixed output. Given no input, output 55 fruits. You may choose any 55 distinct fruits from the following list: ```text abiu açaí acerola achacha ackee afghan cherr... (more) |
— | 8 months ago |
Edit | Post #287059 |
Post edited: Clarify intro |
— | 8 months ago |
Edit | Post #287040 |
Post edited: Mark as finalized |
— | 8 months ago |
Edit | Post #287087 |
Post edited: Fix integer output test cases |
— | 8 months ago |
Edit | Post #287087 | Initial revision | — | 8 months ago |
Question | — |
Rationalise recurring binary Given a potentially recurring binary string, output the number it represents, as a fraction in lowest terms. The notation used in this challenge for recurring digits is non-standard. An `r` is used to indicate that the remaining digits recur. For example, `0.000r10` means the last 2 digits recur, ... (more) |
— | 8 months ago |
Edit | Post #287059 |
Post edited: Give example of regional spelling variation |
— | 8 months ago |
Edit | Post #287059 |
Post edited: Break intro into smaller sentences for ease of reading |
— | 8 months ago |
Edit | Post #287059 |
Post edited: Suggest including helper code if used |
— | 8 months ago |
Edit | Post #287086 | Initial revision | — | 8 months ago |
Question | — |
Is there a problem with the edit queues? I'm raising this on our local Meta first, rather than the main Codidact Meta, because I don't yet have the Edit Posts ability so I can't tell what problems may exist. Hopefully some of you who have this ability will be able to confirm whether there are any bugs / feature requests that should be raise... (more) |
— | 8 months ago |
Edit | Post #287059 |
Post edited: Fix diacritic rule |
— | 8 months ago |
Edit | Post #287059 |
Post edited: Make title fit on one line |
— | 8 months ago |
Edit | Post #287059 |
Post edited: Consider a larger salad |
— | 8 months ago |
Edit | Post #287059 |
Post edited: Change title |
— | 8 months ago |
Edit | Post #287059 |
Post edited: Hide fruit provenance |
— | 8 months ago |
Edit | Post #287059 |
Post edited: Add links to Wikipedia |
— | 8 months ago |
Edit | Post #287059 |
Post edited: Add fruit provenance |
— | 8 months ago |
Edit | Post #287059 |
Post edited: Tidying |
— | 8 months ago |
Edit | Post #287082 | Initial revision | — | 8 months ago |
Article | — |
3D compass point from 3D coordinates Given a set of Cartesian (x, y, z) coordinates, output the 3D compass point that comes nearest to describing its direction from the origin. In reality, the direction of "North" changes as you move across the surface of the globe. This challenge is based in a simplified universe where the compass p... (more) |
— | 8 months ago |
Edit | Post #287040 |
Post edited: Consistency for interpretation section |
— | 8 months ago |
Edit | Post #287040 |
Post edited: Add sandbox question |
— | 8 months ago |
Comment | Post #287055 |
Good catch - thank you! They were indeed shorter than intended - now fixed. (more) |
— | 8 months ago |
Edit | Post #287055 |
Post edited: Fix incorrect test cases |
— | 8 months ago |
Edit | Post #287059 |
Post edited: Update title to no longer be dependent on the choice of salad size |
— | 8 months ago |
Comment | Post #287054 |
Also, instead of
> **Current** voting seems to suggest that anonymous functions are acceptable
I should have said
> Voting seems to suggest that anonymous functions are **currently** acceptable
Meta is always open to further discussion, new answers, and new votes. Anything you disagree wi... (more) |
— | 8 months ago |
Comment | Post #287054 |
@#56533 if it affects your perspective, some languages allow passing an anonymous function as a function argument, or returning an anonymous function as a return value. This allows another part of the program to call the anonymous function without ever having to name it.
This is common with lambda... (more) |
— | 8 months ago |
Edit | Post #287059 |
Post edited: Add hope for explanations |
— | 8 months ago |
Edit | Post #287059 | Initial revision | — | 8 months ago |
Article | — |
55 fruit salad: choose your own Kolmogorov complexity [FINALIZED] Now posted: 55 fruit salad: choose your own Kolmogorov complexity This is a fixed output challenge. It is similar to a standard Kolmogorov complexity challenge, except you get to choose your own fixed output. Given no input, output 55 fruits. You may choose any 55 distinct fruits from the foll... (more) |
— | 8 months ago |
Comment | Post #286989 |
I've just realised that the new clearer output specification, and example, invalidate the [existing answer](https://codegolf.codidact.com/posts/286989/286993#answer-286993) (it gives the output shown in my previous comment, which you have now explained is not valid). Just mentioning in case this affe... (more) |
— | 8 months ago |
Comment | Post #287054 |
This has been mentioned previously on Meta in [Rules for function submissions](https://codegolf.codidact.com/posts/286366/286367#answer-286367) if either of you want to vote/comment/answer in that discussion.
Current voting seems to suggest that anonymous functions are acceptable. (more) |
— | 8 months ago |
Comment | Post #286602 |
>
> * Assuming that things like memory allocation are handled by the caller might give contributions an unfair advantage
>
I'm not sure how to interpret this. If a fixed size input argument (such as a 32 bit integer) is modified, there is no need for memory allocation as it already exists. If ... (more) |
— | 8 months ago |
Comment | Post #286602 |
> Some languages separate subroutines (do not return a value) from functions (returns a value)
In such a language I would see a subroutine that modifies an input argument as a valid submission, unless the challenge explicitly requires a function. I agree that a challenge that requires a function r... (more) |
— | 8 months ago |
Comment | Post #286602 |
> Not all languages support pass by reference
I don't see this as a reason to prevent its use by languages that do support it. There are many ways that languages differ and restricting the particular advantages that each language has seems to remove the benefit of allowing submissions in different... (more) |
— | 8 months ago |
Comment | Post #286602 |
I don't know which way to vote on this one.
> Therefore, interpreting a challenge asking for a return value as "return through parameter" is creating a local code golf dialect of the language
I see this Meta discussion as establishing defaults. Any challenge is free to override the defaults and... (more) |
— | 8 months ago |
Edit | Post #287054 |
Post edited: Typo |
— | 8 months ago |
Edit | Post #287005 |
Post edited: Remove accidentally saved markdown link testing |
— | 8 months ago |
Edit | Post #287005 |
Post edited: Add missing colon |
— | 8 months ago |
Edit | Post #287005 |
Post edited: Mark as finalized |
— | 8 months ago |
Edit | Post #287055 |
Post edited: Explain that the diagram is not part of the challenge |
— | 8 months ago |
Edit | Post #287055 | Initial revision | — | 8 months ago |
Question | — |
Chequer checker A chequer board (also spelt "checker board" in some places) is an 8 by 8 grid of squares alternating between 2 colours. Check whether a provided pattern could be a region of a chequer board. The colours in the pattern will be represented by letters of the alphabet. The squares of a chequer boar... (more) |
— | 8 months ago |
Edit | Post #287005 |
Post edited: Reduce level of formality |
— | 9 months ago |
Suggested Edit | Post #287054 |
Suggested edit: Typo (more) |
helpful | 9 months ago |
Comment | Post #287050 |
I see now - thanks for the explanation. I should have tested the unary cases before making a suggestion... (more) |
— | 9 months ago |
Edit | Post #287005 |
Post edited: A few more test cases |
— | 9 months ago |
Comment | Post #287050 |
Can you save a couple of bytes by using `m>0` instead of `if m else`? (more) |
— | 9 months ago |
Edit | Post #287005 |
Post edited: Condense long output point |
— | 9 months ago |
Edit | Post #287005 |
Post edited: Suggest explanations in answers |
— | 9 months ago |
Edit | Post #287040 |
Post edited: Add request for explanations in answers |
— | 9 months ago |
Edit | Post #287035 |
Post edited: Formating for explanation request |
— | 9 months ago |
Edit | Post #287035 |
Post edited: Prefer answers with explanations |
— | 9 months ago |
Comment | Post #287044 |
Following the edit, I can see that this now correctly handles unary inputs and non-unary inputs with leading zeroes. (more) |
— | 9 months ago |
Comment | Post #287033 |
If we do decide to go ahead with deleting finalized and cancelled Sandbox posts, ideally I'd prefer this to be with a warning comment so the challenge creator can voice any objection or copy any info not present in the main post in the Challenges section. It could just be a quick copy pasted note lik... (more) |
— | 9 months ago |
Edit | Post #287040 |
Post edited: Set a provisional max input length |
— | 9 months ago |
Comment | Post #287040 |
That sounds sensible. I guess the limits will determine to what extent languages without arbitrary sized numbers can avoid having to do everything manually with strings.
I'm tempted to make the limits on all 3 (input length, numerator size, denominator size) quite small to avoid having to deal wit... (more) |
— | 9 months ago |
Edit | Post #287040 |
Post edited: Improve introduction |
— | 9 months ago |
Edit | Post #287040 |
Post edited: Relax output data type requirements |
— | 9 months ago |
Edit | Post #287040 |
Post edited: Remove redundant "treated as" |
— | 9 months ago |
Edit | Post #287040 |
Post edited: Add more test cases |
— | 9 months ago |
Edit | Post #287040 |
Post edited: Specify test case output format |
— | 9 months ago |
Edit | Post #287040 | Initial revision | — | 9 months ago |
Article | — |
Rationalise recurring binary [FINALIZED] Now posted: Rationalise recurring binary Given a potentially recurring binary string, output the number it represents, as a fraction in lowest terms. The notation used in this challenge for recurring digits is non-standard. An `r` is used to indicate that the remaining digits recur. For exa... (more) |
— | 9 months ago |
Edit | Post #287026 |
Post edited: Indicate this is no longer my opinion |
— | 9 months ago |
Edit | Post #287033 |
Post edited: Add torn afterthought |
— | 9 months ago |
Edit | Post #287033 |
Post edited: Fix inaccurate search behaviour description |
— | 9 months ago |
Edit | Post #287033 |
Post edited: Mention cannot add "finalized" tag if there are already 5 tags |
— | 9 months ago |
Edit | Post #287008 |
Post edited: Add finalized tag, edit title, link to posted challenge |
— | 9 months ago |
Edit | Post #287035 | Initial revision | — | 9 months ago |
Question | — |
Presumptuous base conversion Take an input string representing a number and convert it to decimal (base 10). However, the base of the input is not specified. Assume the input is in the smallest base for which its digits are valid. Input - The input consists only of characters from 0123456789ABCDEF where A to F represent the ... (more) |
— | 9 months ago |
Edit | Post #287008 |
Post edited: Remove ambiguity from opening sentence |
— | 9 months ago |
Edit | Post #287008 |
Post edited: Slight wording improvement |
— | 9 months ago |
Edit | Post #287008 |
Post edited: Avoid confusion as N is not a valid digit |
— | 9 months ago |
Edit | Post #287008 |
Post edited: Remove one more "assumed" |
— | 9 months ago |
Edit | Post #287008 |
Post edited: Rephrase the output section to avoid the word "assume" |
— | 9 months ago |
Edit | Post #287008 |
Post edited: Clarify output section on leading zeroes |
— | 9 months ago |
Comment | Post #286989 |
Illustration of the example:
```
11111000
12221000
12321110
12222210
11123210
00122210
00111110
00000000
```
I suspect this was not intended to be a valid output but it would be good to have it made explicit either way. (more) |
— | 9 months ago |
Comment | Post #286989 |
From "You can choose which one takes priority." I assume that for 2 overlapping beacons there are only 2 potential solutions.
That is, one beacon must be chosen to entirely overwrite the other everywhere that they overlap.
In case anyone has a different interpretation, such as giving priority t... (more) |
— | 9 months ago |
Edit | Post #287033 |
Post edited: Clearer subheadings |
— | 9 months ago |
Edit | Post #287033 | Initial revision | — | 9 months ago |
Answer | — |
A: Filtering the sandbox for ease of feedback Both tags and [FINALIZED] are problematic Problem with tags Having been shown the related meta post [Separate the tags away from the Sandbox or delete the \[finalized\] tag] I can now see that having tags in the Sandbox that are not tags for Challenges is problematic. It's clear from that post that... (more) |
— | 9 months ago |
Comment | Post #287026 |
That meta post does provide a good motivation for avoiding both "finalized" and "cancelled" tags. I'm less comfortable with "[FINALIZED]" or "[CANCELLED]" in the title - that requires searching each time I want to see posts that need feedback, rather than just setting a permanent filter on sandbox po... (more) |
— | 9 months ago |
Edit | Post #287005 |
Post edited: Add diagram and extra wording for clarity |
— | 9 months ago |
Edit | Post #287008 |
Post edited: Add a unary test case |
— | 9 months ago |
Edit | Post #287005 |
Post edited: Improve wording and add a larger truthy test case |
— | 9 months ago |
Edit | Post #287008 |
Post edited: Clarify output section |
— | 9 months ago |
Edit | Post #287008 |
Post edited: Improve example calculation |
— | 9 months ago |
Edit | Post #287008 |
Post edited: Fix incorrect test cases |
— | 9 months ago |
Edit | Post #287008 |
Post edited: Split specification into input and output sections |
— | 9 months ago |
Comment | Post #287005 |
Good point.
Although this is mentioned in the opening paragraph and there are the test cases you mention, I agree it would be better for the output section to also be explicit about this, so I've added a couple more bullet points. (more) |
— | 9 months ago |
Comment | Post #287005 |
Thanks for all the feedback!
I'll wait to see if there are any other opinions for or against before making a final decision on allowing empty input.
I've edited to allow the input formats you listed, added an upper limit on input size, included your extra test case, and specified that the input... (more) |
— | 9 months ago |
Edit | Post #287005 |
Post edited: Narrow down sandbox questions to those that still need feedback |
— | 9 months ago |
Edit | Post #287005 |
Post edited: Address feedback |
— | 9 months ago |
Edit | Post #287005 |
Post edited: Specify 8 by 8 chequer board in the output section |
— | 9 months ago |
Edit | Post #287026 | Initial revision | — | 9 months ago |
Answer | — |
A: Filtering the sandbox for ease of feedback I'm leaving this answer here for any votes and discussion, but I no longer hold this opinion. I've posted a [longer answer] to explain why I've changed my mind After hearing about the filter developments currently being worked on, mentioned in [Monica's comment], my personal opinion is that ta... (more) |
— | 9 months ago |
Edit | Post #287008 |
Post edited: Number the list of specifications to make answering queries clearer |
— | 9 months ago |
Edit | Post #287012 |
Post edited: Include sort by age in the link to search results |
— | 9 months ago |
Edit | Post #287012 | Initial revision | — | 9 months ago |
Question | — |
Filtering the sandbox for ease of feedback I see the Sandbox as a vital part of challenge design. When I visit the Sandbox I'd like to be able to show only proposals that are not finalized, so I can focus feedback where it is needed. In the absence of dedicated functionality, I can search for [sandbox posts without the "finalized" tag]. ... (more) |
— | 9 months ago |
Comment | Post #286603 |
I agree it's impractical to make exceptions for some characters, as they will differ between languages. Instead, the scoring mechanism could be used to allow arbitrary exceptions at a cost.
For example, the score could be 1 point for each unique character, with any non-unique characters scoring 0.... (more) |
— | 9 months ago |
Edit | Post #287008 | Initial revision | — | 9 months ago |
Article | — |
Presumptuous base conversion [FINALIZED] Now posted: Presumptuous base conversion Take an input string representing a number and convert it to decimal (base 10). However, the base of the input is not specified. Assume the input is in the smallest base for which its digits are valid. Input - The input consists only of characters f... (more) |
— | 9 months ago |
Edit | Post #287005 |
Post edited: |
— | 9 months ago |
Edit | Post #287005 |
Post edited: |
— | 9 months ago |
Edit | Post #287005 | Initial revision | — | 9 months ago |
Article | — |
Chequer checker [FINALIZED] Now posted: Chequer checker A chequer board (also spelt "checker board" in some places) is an 8 by 8 grid of squares alternating between 2 colours. Check whether a provided pattern could be a region of a chequer board. The colours in the pattern will be represented by letters of the alphabe... (more) |
— | 9 months ago |
Comment | Post #279770 |
Until I read as far as the notes section, I had assumed that each answer would have to deal with any sufficient subset of the possible inputs (rather than being written to handle one specific sufficient subset). That sounded like an interesting challenge but might have made input format tricky. The n... (more) |
— | about 2 years ago |
Comment | Post #279722 |
Rather than depend only on an external link, could the rules also be defined in the challenge wording so it's self contained and consistent in the event of any changes to external sites? (more) |
— | about 2 years ago |
Comment | Post #279883 |
"The input can be assumed to be correct and containing no duplicates". Does "correct" here mean anything more than "contains exacty 7 digits"? If not, this might be clearer as "The input can be assumed to be exactly 7 distinct digits" (so that the reader does not need to look around to confirm what "... (more) |
— | about 2 years ago |
Comment | Post #279883 |
The challenge already appears to contain all of the information required, but if you wanted to make it extra clear you could include something like "Valid examples (output a Tannenbaum tree)" and "Invalid examples (no output)" so it's clear that the "Invalid examples" are still valid inputs that the ... (more) |
— | about 2 years ago |