Timeline for Restricted mini challenges Cop's Thread
Current License: CC BY-SA 3.0
95 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 10, 2021 at 6:08 | answer | added | user100411 | timeline score: 0 | |
| Sep 24, 2021 at 8:04 | answer | added | user100411 | timeline score: 0 | |
| Jul 19, 2021 at 8:07 | answer | added | user100411 | timeline score: 1 | |
| Jul 18, 2021 at 2:18 | answer | added | user100411 | timeline score: 0 | |
| Mar 31, 2021 at 7:39 | comment | added | SegFaultPlus4 | Is input of the number necessary, or can we just print all of the sequence? | |
| Aug 9, 2017 at 16:29 | history | edited | Wheat Wizard♦ | CC BY-SA 3.0 |
added 5 characters in body
|
| Aug 7, 2017 at 23:42 | answer | added | LyricLy | timeline score: 0 | |
| Aug 6, 2017 at 19:57 | answer | added | Draco18s no longer trusts SE | timeline score: -5 | |
| Aug 2, 2017 at 2:49 | answer | added | MD XF | timeline score: 1 | |
| Aug 1, 2017 at 22:57 | answer | added | TehPers | timeline score: 2 | |
| Jul 31, 2017 at 21:27 | answer | added | Christian Sievers | timeline score: 4 | |
| Jul 31, 2017 at 16:50 | answer | added | wizzwizz4 | timeline score: 0 | |
| Jul 31, 2017 at 15:55 | answer | added | ETHproductions | timeline score: 2 | |
| Jul 31, 2017 at 10:05 | answer | added | wizzwizz4 | timeline score: 1 | |
| Jul 30, 2017 at 21:00 | answer | added | Christian Sievers | timeline score: 0 | |
| Jul 30, 2017 at 19:08 | answer | added | wizzwizz4 | timeline score: 2 | |
| Jul 30, 2017 at 13:42 | answer | added | user15259 | timeline score: 0 | |
| Jul 30, 2017 at 7:44 | answer | added | Christian Sievers | timeline score: 3 | |
| Jul 30, 2017 at 0:06 | answer | added | ბიმო | timeline score: 2 | |
| Jul 29, 2017 at 11:07 | answer | added | user15259 | timeline score: 1 | |
| Jul 28, 2017 at 23:41 | answer | added | LyricLy | timeline score: 1 | |
| Jul 28, 2017 at 22:17 | answer | added | Christian Sievers | timeline score: 3 | |
| Jul 28, 2017 at 20:52 | answer | added | Евгений Новиков | timeline score: 1 | |
| Jul 28, 2017 at 20:10 | answer | added | Stewie Griffin | timeline score: 1 | |
| Jul 28, 2017 at 19:25 | answer | added | theLambGoat | timeline score: 2 | |
| Jul 28, 2017 at 19:07 | answer | added | TehPers | timeline score: 3 | |
| Jul 28, 2017 at 18:36 | answer | added | theLambGoat | timeline score: 1 | |
| Jul 28, 2017 at 18:05 | answer | added | JAD | timeline score: 2 | |
| Jul 28, 2017 at 16:50 | answer | added | TehPers | timeline score: 0 | |
| Jul 28, 2017 at 14:46 | answer | added | Nathan Dimmer | timeline score: 1 | |
| Jul 28, 2017 at 13:47 | answer | added | Nathan Dimmer | timeline score: 1 | |
| Jul 28, 2017 at 13:42 | answer | added | Jordan | timeline score: 2 | |
| Jul 28, 2017 at 13:16 | answer | added | JAD | timeline score: 2 | |
| Jul 28, 2017 at 13:05 | answer | added | Nathan Dimmer | timeline score: 1 | |
| Jul 28, 2017 at 8:20 | answer | added | Laikoni | timeline score: 4 | |
| Jul 28, 2017 at 6:23 | answer | added | JAD | timeline score: 2 | |
| Jul 28, 2017 at 6:08 | answer | added | Azulflame | timeline score: 2 | |
| Jul 28, 2017 at 3:50 | comment | added | Wheat Wizard♦ | @Doorknob Yes it can, the question is about chiefly about bytes and is agnostic to characters. | |
| Jul 28, 2017 at 3:50 | answer | added | iovoid | timeline score: 0 | |
| Jul 28, 2017 at 3:47 | answer | added | Doorknob | timeline score: 2 | |
| Jul 28, 2017 at 3:40 | comment | added | Doorknob | Can the byteset contain non-printable-ASCII? (i.e. can I inflate my score by including 0x00-0x1f and 0x7f-0xff?) | |
| Jul 28, 2017 at 3:31 | answer | added | Ra8 | timeline score: 2 | |
| Jul 28, 2017 at 2:20 | answer | added | Arnold Palmer | timeline score: 1 | |
| Jul 28, 2017 at 0:36 | answer | added | geokavel | timeline score: 1 | |
| Jul 28, 2017 at 0:01 | history | edited | Wheat Wizard♦ | CC BY-SA 3.0 |
added 15 characters in body
|
| Jul 27, 2017 at 23:51 | answer | added | Azulflame | timeline score: 2 | |
| Jul 27, 2017 at 23:47 | comment | added | Wheat Wizard♦ |
@Azulflame The b-files are files that are associated with each sequence the can be accessed by replacing the A with a b and appending a .txt. For example oeis.org/b4.txt would access the b-files for that sequence.
|
|
| Jul 27, 2017 at 23:21 | comment | added | Azulflame | What do you mean by "b-list"? Is that the list of terms shown on the page that has the "list", i.e. oeis.org/A000004/list ? | |
| Jul 27, 2017 at 22:57 | answer | added | Christian Sievers | timeline score: 5 | |
| Jul 27, 2017 at 22:47 | history | tweeted | twitter.com/StackCodeGolf/status/890705136074575872 | ||
| Jul 27, 2017 at 22:39 | answer | added | Value Ink | timeline score: 0 | |
| Jul 27, 2017 at 21:57 | answer | added | Luis Mendo | timeline score: 0 | |
| Jul 27, 2017 at 21:48 | answer | added | Christian Sievers | timeline score: 4 | |
| Jul 27, 2017 at 21:33 | answer | added | Arnauld | timeline score: 1 | |
| Jul 27, 2017 at 21:10 | answer | added | xnor | timeline score: 12 | |
| Jul 27, 2017 at 21:07 | answer | added | Arnauld | timeline score: 3 | |
| Jul 27, 2017 at 20:33 | answer | added | theLambGoat | timeline score: 3 | |
| Jul 27, 2017 at 20:24 | answer | added | Adnan | timeline score: 3 | |
| Jul 27, 2017 at 20:23 | answer | added | Giuseppe | timeline score: 3 | |
| Jul 27, 2017 at 20:23 | answer | added | Value Ink | timeline score: 2 | |
| Jul 27, 2017 at 20:11 | answer | added | Stephen | timeline score: 0 | |
| Jul 27, 2017 at 19:51 | comment | added | Wheat Wizard♦ | @xnor Yes that would be possible. The problem is OEIS sequence do not have rigorous specifications, so we can only confirm via test battery. | |
| Jul 27, 2017 at 19:34 | answer | added | sonar235 | timeline score: 3 | |
| Jul 27, 2017 at 19:19 | answer | added | JAD | timeline score: 2 | |
| Jul 27, 2017 at 19:16 | answer | added | dj0wns | timeline score: 3 | |
| Jul 27, 2017 at 19:08 | answer | added | Stephen | timeline score: 1 | |
| Jul 27, 2017 at 19:06 | answer | added | Business Cat | timeline score: 2 | |
| Jul 27, 2017 at 19:03 | answer | added | fireflame241 | timeline score: 0 | |
| Jul 27, 2017 at 18:53 | answer | added | totallyhuman | timeline score: 0 | |
| Jul 27, 2017 at 18:52 | comment | added | xnor | Do I understand right that the robber could (if characters allow) hardcode an enormous table of values corresponding to the b file? This could be hard for cops to avoid. | |
| Jul 27, 2017 at 18:49 | answer | added | Stephen | timeline score: 2 | |
| Jul 27, 2017 at 18:39 | answer | added | Stewie Griffin | timeline score: 4 | |
| Jul 27, 2017 at 18:35 | answer | added | AdmBorkBork | timeline score: 2 | |
| Jul 27, 2017 at 18:27 | answer | added | Nathan Dimmer | timeline score: 1 | |
| Jul 27, 2017 at 18:26 | answer | added | totallyhuman | timeline score: 0 | |
| Jul 27, 2017 at 18:19 | history | edited | Mr. Xcoder | CC BY-SA 3.0 |
Added support for checking if the code matches the byte code. Feel free to rollback.
|
| Jul 27, 2017 at 18:18 | answer | added | Rod | timeline score: 2 | |
| Jul 27, 2017 at 18:04 | answer | added | JAD | timeline score: 2 | |
| Jul 27, 2017 at 18:02 | answer | added | Mr. Xcoder | timeline score: 1 | |
| Jul 27, 2017 at 17:50 | comment | added | Stephen |
@Mr.Xcoder You are then to secretly write a program in that language that computes the nth term sequence using only the bytes in the set. only the bytes in that set, so dupes are allowed
|
|
| Jul 27, 2017 at 17:43 | answer | added | Rod | timeline score: 5 | |
| Jul 27, 2017 at 17:24 | comment | added | JAD | @mrxcoder I would think so, else we are just finding anagrams. | |
| Jul 27, 2017 at 17:19 | comment | added | Mr. Xcoder | Can robbers use the same byte twice or more? | |
| Jul 27, 2017 at 17:17 | comment | added | Stephen | @H.PWiz you'd have to ask WheatWizard about no-ops | |
| Jul 27, 2017 at 17:16 | comment | added | H.PWiz | @StepHen does that mean that you can include bytes that aren't even part of your language to get a higher score? | |
| Jul 27, 2017 at 17:13 | comment | added | JAD | Do we count newlines as a separate byte or as \n? | |
| Jul 27, 2017 at 17:13 | history | edited | Stephen |
edited tags
|
|
| Jul 27, 2017 at 17:08 | comment | added | Stephen | @Shaggy generally no, you can includes others for red herrings, but robbers can use everything | |
| Jul 27, 2017 at 17:06 | comment | added | Shaggy | Do we need to use all the bytes in our set? I would guess yes but it should probably be specified in the challenge. | |
| Jul 27, 2017 at 17:06 | answer | added | Stephen | timeline score: 2 | |
| Jul 27, 2017 at 16:57 | answer | added | JAD | timeline score: 0 | |
| Jul 27, 2017 at 16:56 | answer | added | Mayube | timeline score: 2 | |
| Jul 27, 2017 at 16:56 | comment | added | BradC | Lower score is better? Or higher? So in essence we're trying to find a restricted character set that makes it difficult for someone else to make a program in the chosen language, after we've already worked out a solution? | |
| Jul 27, 2017 at 16:47 | history | edited | Wheat Wizard♦ | CC BY-SA 3.0 |
added 69 characters in body
|
| Jul 27, 2017 at 16:42 | history | asked | Wheat Wizard♦ | CC BY-SA 3.0 |