Timeline for Optimize paper folding to mitigate inkblots
Current License: CC BY-SA 3.0
24 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 18, 2014 at 11:18 | vote | accept | Calvin's Hobbies | ||
| S Jul 18, 2014 at 11:18 | history | bounty ended | Calvin's Hobbies | ||
| S Jul 18, 2014 at 11:18 | history | notice removed | Calvin's Hobbies | ||
| S Jul 12, 2014 at 10:33 | history | bounty started | Calvin's Hobbies | ||
| S Jul 12, 2014 at 10:33 | history | notice added | Calvin's Hobbies | Draw attention | |
| Jul 10, 2014 at 23:37 | history | edited | Calvin's Hobbies | CC BY-SA 3.0 |
Added score checking script
|
| Jul 10, 2014 at 17:15 | comment | added | Howard | @Calvin'sHobbies Brute force is (19+39)^8 (minus some symmetries) which is much more feasable. | |
| Jul 10, 2014 at 14:11 | answer | added | r3mainer | timeline score: 5 | |
| Jul 10, 2014 at 13:52 | answer | added | Vectorized | timeline score: 8 | |
| Jul 10, 2014 at 13:36 | history | edited | Calvin's Hobbies | CC BY-SA 3.0 |
deleted 1596 characters in body
|
| Jul 10, 2014 at 12:41 | comment | added | Calvin's Hobbies | I see, I didn't think of having multiple grids count towards the score but I like it. I think I'll add 3 or 4 more grids to the gamut. | |
| Jul 10, 2014 at 12:34 | comment | added | Martin Ender | @Calvin'sHobbies I'd prefer a larger set of test cases, too, to be honest, because some algorithms might fare better on certain grids than others. What you could do is what I did with Vector Racing that each participant may add a test case to the benchmark set. In that case, you'd have to take it on you to test and score all submissions though, because you can't expect early participants to rerun their code with test cases added later. | |
| Jul 10, 2014 at 12:32 | comment | added | Martin Ender | @justhalf this was the challenge with the hashes, for different reasons though. | |
| Jul 10, 2014 at 12:30 | comment | added | Calvin's Hobbies | @Howard and others, how would making more test cases help? I figured it was easy enough for people to generate their own random grids. Brute force is out as there are (19*39)^8 potential solutions so checking one per nanosecond would still take a couple million years. | |
| Jul 10, 2014 at 12:19 | comment | added | Calvin's Hobbies | I do want people to include their code so I made that a requirement. Hopefully people will stay honest but if there is contention then the person who posted first will almost certainly win. | |
| Jul 10, 2014 at 12:11 | history | edited | Calvin's Hobbies | CC BY-SA 3.0 |
Made code submission required and advocated honesty
|
| Jul 10, 2014 at 12:00 | comment | added | Howard | Another way to prohibit hard-coding is to make the challenge open to other test cases as well. | |
| Jul 10, 2014 at 12:00 | comment | added | justhalf | Another option is to ask people to give the sequence that they got with their code, but ask them to provide a hash (say SHA-256) of their code as proof that they actually produce it using their own work. I remember seeing that kind of mechanism some time ago, but I can't remember. Can anybody point to that challenge? | |
| Jul 10, 2014 at 11:56 | comment | added | justhalf | You can quote standard loopholes and those entries will be invalidated by the community (or more precisely, by you when community points it out) when they found it. And you'd better give more test cases. EDIT: I think one test case is fine, though, if it's difficult enough, which I think so for your current test case. | |
| Jul 10, 2014 at 11:39 | comment | added | Calvin's Hobbies | I know that would be ideal but how could I make sure that people aren't hiding their sequence in a program that looks like a possible algorithm? | |
| Jul 10, 2014 at 11:35 | history | tweeted | twitter.com/#!/StackCodeGolf/status/487198483531972608 | ||
| Jul 10, 2014 at 11:20 | comment | added | justhalf | I think it's better if you have some test cases, and that participants are expected to give code that produces the sequence, instead of just giving the sequence. | |
| Jul 10, 2014 at 9:54 | history | edited | Calvin's Hobbies | CC BY-SA 3.0 |
Clarified that n is 1-indexed
|
| Jul 10, 2014 at 9:44 | history | asked | Calvin's Hobbies | CC BY-SA 3.0 |