Timeline for Golfing A Weasel Program
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 3 at 5:25 | history | edited | roblogic | CC BY-SA 4.0 |
added 18 characters in body
|
| Sep 3 at 4:36 | history | edited | roblogic | CC BY-SA 4.0 |
added 423 characters in body
|
| Sep 3 at 3:48 | history | edited | roblogic | CC BY-SA 4.0 |
added 570 characters in body
|
| Sep 2 at 2:13 | history | edited | roblogic | CC BY-SA 4.0 |
deleted 41 characters in body
|
| Sep 2 at 1:44 | history | edited | roblogic | CC BY-SA 4.0 |
added 18 characters in body
|
| Sep 2 at 1:35 | history | edited | roblogic | CC BY-SA 4.0 |
-9
|
| Aug 31 at 19:29 | comment | added | noodle person | Make 100 copies of the string. In each copy, each character has a 5% chance of being replaced. | |
| Aug 31 at 15:47 | comment | added | roblogic | Step 2 was confusing; I don't think we are supposed to create 100 mutated copies at each iteration?? | |
| Aug 31 at 13:07 | comment | added | noodle person | Nice solution (+1), good idea to use @..Z, but I disagree that the question is poorly defined - it seems pretty obvious to me from reading the task description and looking at the example what the intended program should do | |
| Aug 31 at 11:28 | history | edited | roblogic | CC BY-SA 4.0 |
added 1021 characters in body
|
| Aug 31 at 6:42 | history | answered | roblogic | CC BY-SA 4.0 |