Timeline for Laser Mirror Portal Party
Current License: CC BY-SA 3.0
28 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| May 22, 2016 at 16:06 | comment | added | anon |
>1.1* is also nonterminating :)
|
|
| Jun 4, 2015 at 22:37 | vote | accept | absinthe | ||
| Sep 13, 2014 at 19:31 | comment | added | Cristian Lupascu | You're right; now I see you also specified this in your answer. | |
| Sep 13, 2014 at 19:23 | comment | added | Ell | @w0lf: You're giving wrong input. The function takes a list of strings (for each line), not a single string. | |
| Sep 13, 2014 at 19:21 | comment | added | Cristian Lupascu | sorry for the double-paste; the unit tests link is pastie.org/9551185 | |
| Sep 13, 2014 at 19:20 | comment | added | Cristian Lupascu | Yours fails as well. | |
| Sep 13, 2014 at 19:13 | comment | added | Ell | @w0lf: You're testing Will's program, not mine :P | |
| Sep 13, 2014 at 18:30 | comment | added | Cristian Lupascu | actually, I think 3 out of the 5 test cases fail: pastie.org/9551185http://pastie.org/9551185 | |
| Sep 13, 2014 at 15:53 | comment | added | Cristian Lupascu |
I think the answer for the second test case is wrong: ideone.com/mkLUaV. It sould be True, but it's False
|
|
| Sep 12, 2014 at 11:16 | comment | added | Ell | @Will: SE replaces tabs with spaces, which is probably why you get a slightly higher count. Your suggested indentation does save a few bytes, though; I'll look into it later. | |
| S Sep 12, 2014 at 11:12 | history | edited | Ell | CC BY-SA 3.0 |
I was so taken by all this I made a little script to animate the golfing
|
| S Sep 12, 2014 at 11:12 | history | suggested | Will | CC BY-SA 3.0 |
I was so taken by all this I made a little script to animate the golfing
|
| Sep 12, 2014 at 9:41 | review | Suggested edits | |||
| S Sep 12, 2014 at 11:12 | |||||
| Sep 11, 2014 at 13:25 | comment | added | Will | I can't get your byte-count to be 260, but I have a rearrangement that's 255 you can borrow: gist.github.com/williame/c40b785ce465902256d9 (note the indent level is one space, two spaces, then tab) | |
| Sep 11, 2014 at 12:45 | history | edited | Ell | CC BY-SA 3.0 |
277 -> 260
|
| Sep 11, 2014 at 11:42 | comment | added | Will |
I think this solution beautiful. I particularly like the d^=2 trick. You can gain another byte by swapping the signs to be j-=[1,-1,-w,w,j][d] ;)
|
|
| Sep 10, 2014 at 22:44 | history | edited | Ell | CC BY-SA 3.0 |
287 -> 277 + fix
|
| Sep 10, 2014 at 22:27 | history | edited | Ell | CC BY-SA 3.0 |
287 -> 278. Thanks Will.
|
| Sep 10, 2014 at 22:24 | comment | added | Ell | @Will: Thanks, great idea! | |
| Sep 10, 2014 at 22:17 | history | edited | Ell | CC BY-SA 3.0 |
302 -> 287
|
| Sep 10, 2014 at 21:44 | comment | added | Will |
Hats off to Ell! Very nicely done. I think you can shave a few more bytes off by using the fact that .find(d) returns -1 if not found. If you remove the if-1<d: statement and instead do j+=[-1,1,w,-w,-i][d] at the top of the while loop, a not-found -1 will turn into adding the last element in that array to j, which will make j 0, which we know is @...?
|
|
| Sep 10, 2014 at 21:10 | comment | added | Ell | Yup, I read it wrong. | |
| Sep 10, 2014 at 21:01 | comment | added | VisualMelon | @Micah hehe, thanks for a proper explanation, like I said I went with intuition and didn't worry about it much, thanks for putting another tool in my box. | |
| Sep 10, 2014 at 20:47 | comment | added | Micah | @VisualMelon: The rules are time-symmetric except at spots where lasers are born or die, which means everything has to terminate (since you can always uniquely trace it back to the point where it was born, and emitters can't themselves be part of a loop). | |
| Sep 10, 2014 at 18:55 | comment | added | VisualMelon |
The spec specifies that "Lasers do not pass through emitters." so 1>1 will terminate. I've not been able to find something that doesn't terminate, though I've not put much effort into it and pretty much assumed it doesn't happen for my implementation. I will of course reconsider if someone can present one.
|
|
| Sep 10, 2014 at 18:19 | history | edited | Ell | CC BY-SA 3.0 |
310 -> 302
|
| Sep 10, 2014 at 17:49 | history | answered | Ell | CC BY-SA 3.0 |