Timeline for Sandbox for Proposed Challenges
Current License: CC BY-SA 4.0
18 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 23, 2021 at 20:18 | history | undeleted | caird coinheringaahingMod | ||
| Oct 25, 2020 at 17:08 | history | deleted | caird coinheringaahingMod | via Vote | |
| Oct 25, 2020 at 17:08 | history | edited | caird coinheringaahingMod | CC BY-SA 4.0 | deleted 1485 characters in body |
| Oct 22, 2020 at 21:15 | history | edited | caird coinheringaahingMod | CC BY-SA 4.0 | deleted 344 characters in body |
| Oct 18, 2020 at 22:10 | comment | added | xnor | @cairdcoinheringaahing Can you give an example of an interesting thing a program could do in linking its code length? I'm really not seeing it. The only extremely minor thing I could see is that if you have, say, a 76 byte program that works excepts it has a spot you need to put the number in, you need to put in 78 to account for the length of the code and number. | |
| Oct 18, 2020 at 22:03 | comment | added | caird coinheringaahing Mod | @xnor IMO, it adds an extra level of complexity/difficulty to the challenge, in that you have to modify the actual code as you modify code length. Also, I don't think the generic "take \$n\$ as a parameter" version is particularly interesting, whereas requiring answers to link \$n\$ and their code is | |
| Oct 18, 2020 at 21:41 | comment | added | xnor | I don't really see the point of the n-is-length idea. It seems like you just have to write code that works for any n, then plug in n equal to the length of the code (accounting for the replacement). Only perhaps an ultra-golfy language might be able to do something like n=2 in 2 bytes rather than writing a general solution. | |
| Oct 18, 2020 at 19:47 | history | edited | caird coinheringaahingMod | CC BY-SA 4.0 | added 80 characters in body |
| Oct 18, 2020 at 19:46 | comment | added | caird coinheringaahing Mod | Plus, because of the self-referential part, I think that this doesn't close the door on any future challenges that allow you to choose your own \$n\$, or take \$n\$ as a parameter, so I'm happy with this scoring criteria. Also, thanks for noticing that, edited in. | |
| Oct 18, 2020 at 19:45 | comment | added | Zgarb | Finally, you're missing the condition that every natural number must occur as an output. | |
| Oct 18, 2020 at 19:44 | comment | added | caird coinheringaahing Mod | @Zgarb While I do agree that, because it's much harder with the self-referential part, a simpler challenge would probably do better (votes/answers wise), but I've got no issue with this going unanswered, and I think as is, it'll draw much more impressive answers with a more discriminating choice of bijections. | |
| Oct 18, 2020 at 19:42 | comment | added | Zgarb | Also, I like this scoring idea but I fear that the abstractness of the task will scare away potential golfers. Maybe it would be better to choose a simpler task that has n as a parameter. | |
| Oct 18, 2020 at 19:42 | history | edited | caird coinheringaahingMod | CC BY-SA 4.0 | deleted 438 characters in body |
| Oct 18, 2020 at 18:12 | history | edited | caird coinheringaahingMod | CC BY-SA 4.0 | added 302 characters in body |
| Oct 18, 2020 at 16:08 | history | edited | caird coinheringaahingMod | CC BY-SA 4.0 | added 565 characters in body |
| Oct 17, 2020 at 11:58 | comment | added | caird coinheringaahing Mod | @Sisyphus, yes, but can you iterate it \$n\$ times within \$n\$ bytes? | |
| Oct 17, 2020 at 2:08 | comment | added | Sisyphus | Seems very possible. You can iterate the cantor pairing function \$\pi(\pi(\pi(a,b),c)\ldots)\$ | |
| Oct 16, 2020 at 23:15 | history | answered | caird coinheringaahingMod | CC BY-SA 4.0 |