Activity for trichoplax
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #288502 |
Post edited: Tidy up input section |
— | almost 2 years ago |
| Edit | Post #288502 |
Post edited: Add section on equivalence |
— | almost 2 years ago |
| Comment | Post #288398 |
Thanks for clarifying. Note that the current answer does not give correct output when the input has a hole, but it works for all the examples in the challenge, so it might be worth adding at least 1 test case with a hole. (more) |
— | almost 2 years ago |
| Edit | Post #288496 |
Post edited: Mark as finalized |
— | almost 2 years ago |
| Edit | Post #288502 | Initial revision | — | almost 2 years ago |
| Question | — |
Label a hinged tetromino Given a hinged tetromino, give it a unique, consistent label independent of location, rotation, and reflection. Tetrominoes A [tetromino] is a connected subset of the square tiling, composed of 4 squares, where connection can only be edge connection. Here are the 5 tetrominoes: ![the 5 tetr... (more) |
— | almost 2 years ago |
| Edit | Post #288496 |
Post edited: Pedantic punctuating |
— | almost 2 years ago |
| Edit | Post #288496 |
Post edited: Include "consistent" in description to match the output rules |
— | almost 2 years ago |
| Edit | Post #288496 |
Post edited: Consistently use "hinged tetromino" rather than "tetraplet" |
— | almost 2 years ago |
| Edit | Post #288496 |
Post edited: Use my own images so they both have consistent design |
— | almost 2 years ago |
| Edit | Post #288496 |
Post edited: Test SVG from a GitHub repo |
— | almost 2 years ago |
| Edit | Post #288496 | Initial revision | — | almost 2 years ago |
| Article | — |
Label the hinged tetrominoes - [FINALIZED] Now posted: Label a hinged tetromino Given a hinged tetromino, give it a unique, consistent label. Tetrominoes A [tetromino] is a connected subset of the square tiling, composed of 4 squares, where connection can only be edge connection. Here are the 5 tetrominoes:  |
— | almost 2 years ago |
| Comment | Post #288398 |
Does code need to support inputs with holes? If so, here are some potential test cases for n=16:
Not prime:
```text
XXXXX
X X
X X
X X
XXXXX
X
XXXX
XX X
XXXX
XXX
X
X
XXXXX
XX X
XXXX
XXX
X
XXXXX
XX X
XXXX
XXX
```
Prime:
```text
XX
XX XX
... (more) |
— | almost 2 years ago |
| Comment | Post #288403 |
In Rust, the trailing semicolon after assigning an anonymous function to a variable name is not part of the function definition, so does not need to count towards your byte count. In a program where the anonymous function is used immediately, and never assigned to a variable name, there would be no s... (more) |
— | almost 2 years ago |
| Comment | Post #288398 |
I think that this misunderstanding (that all the smaller polyominoes need to be the same shape) could make an interesting separate challenge. Either that they all need to be identical, or that they need to be identical up to rotation and/or reflection. (more) |
— | almost 2 years ago |
| 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years ago |
| Edit | Post #287928 |
Post edited: Mark as finalized |
— | about 2 years ago |
| Suggested Edit | Post #287928 |
Suggested edit: Mark as finalized (more) |
helpful | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years ago |
| Edit | Post #287928 |
Post edited: Typos |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years ago |
| Suggested Edit | Post #287928 |
Suggested edit: Typos (more) |
helpful | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years ago |
| Edit | Post #287927 | Initial revision | — | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years 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) |
— | about 2 years ago |