Timeline for A game of locks and keys
Current License: CC BY-SA 3.0
27 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 30 at 1:11 | answer | added | l4m2 | timeline score: 0 | |
| Apr 30 at 0:38 | answer | added | Ajax1234 | timeline score: 0 | |
| Nov 21, 2015 at 10:32 | history | tweeted | twitter.com/StackCodeGolf/status/668014228658368512 | ||
| Nov 21, 2015 at 7:34 | comment | added | ghosts_in_the_code | @xnor @ MartinButtner Done. | |
| Nov 21, 2015 at 7:33 | history | edited | ghosts_in_the_code | CC BY-SA 3.0 |
Flexible input
|
| Nov 21, 2015 at 7:30 | comment | added | ghosts_in_the_code | @qumonio Only all the treasure (0s) need to be found. Since there are no 0s, we have already completed the challenge even before opening any box. | |
| Nov 20, 2015 at 23:24 | answer | added | Peter Taylor | timeline score: 2 | |
| Nov 20, 2015 at 23:22 | comment | added | ŽaMan | I am missing something to understand this puzzle. How does the last one work to zero if we don't start with any keys and locksmith charges to open a box we don't already have the key for? | |
| Nov 20, 2015 at 22:54 | answer | added | Leif Willerts | timeline score: 0 | |
| Nov 20, 2015 at 16:55 | comment | added | Martin Ender |
@ghosts_in_the_code It's not about simplicity but about flexibility. Commonly, challenges that require structured input allow any convenient list format, as long as the data is not preprocessed. Depending on the language that could mean a whitespace separated file like you have, or it could mean [[1] [3 4] [] [] [2 6] [5]] or maybe {{1},{3,4},{},{},{2,6},{5}}. This way, most languages can reduce reading the input to something as trivial as i=eval(read()) and focus on the fun part of the challenge.
|
|
| Nov 20, 2015 at 10:30 | comment | added | ghosts_in_the_code | @xnor The input is simple only. How can I make it simpler than this? | |
| Nov 20, 2015 at 4:34 | comment | added | xnor | I'm not a fan of the specific input format. I expect I'd need a decent fraction of my code just to put it in a usable form. In the future, I suggest allowing more flexible forms of input for algorithmic style problems. | |
| Nov 20, 2015 at 4:31 | comment | added | xnor | This seems related to this puzzle about 100 locked boxes of wood and steel: puzzling.stackexchange.com/q/17852/4551 | |
| Nov 20, 2015 at 3:44 | answer | added | Dennis | timeline score: 6 | |
| Nov 19, 2015 at 18:55 | comment | added | Peter Taylor | @VoteToClose, not really. That question is about permutations; this question is graph reachability plus smallest covering set. | |
| Nov 19, 2015 at 17:47 | comment | added | ghosts_in_the_code | @VoteToClose Nice video. It is similar, except that it talks of a mathematical puzzle and specific algorithm, rather than a generalised one. | |
| Nov 19, 2015 at 17:39 | history | reopened |
ghosts_in_the_code Martin Ender |
||
| Nov 19, 2015 at 17:37 | history | edited | ghosts_in_the_code | CC BY-SA 3.0 |
Replaced 100 with n
|
| Nov 19, 2015 at 17:31 | history | edited | ghosts_in_the_code | CC BY-SA 3.0 |
Added zero case
|
| Nov 19, 2015 at 17:22 | history | edited | ghosts_in_the_code | CC BY-SA 3.0 |
deleted 42 characters in body
|
| Nov 19, 2015 at 17:18 | history | edited | ghosts_in_the_code | CC BY-SA 3.0 |
Clarified again (duplicate keys)
|
| Nov 19, 2015 at 17:06 | review | Reopen votes | |||
| Nov 19, 2015 at 17:44 | |||||
| Nov 19, 2015 at 16:46 | history | edited | ghosts_in_the_code | CC BY-SA 3.0 |
Completed post
|
| Nov 19, 2015 at 16:10 | comment | added | Leif Willerts | Also related: puzzling.stackexchange.com/questions/23150/… | |
| Nov 19, 2015 at 16:09 | history | closed |
Blue Morgan Thrapp Geobits AdmBorkBork Martin Ender |
Needs details or clarity | |
| Nov 19, 2015 at 15:51 | comment | added | Addison Crump | Is this perhaps related to this? | |
| Nov 19, 2015 at 15:46 | history | asked | ghosts_in_the_code | CC BY-SA 3.0 |