Timeline for Quicksand (piles)
Current License: CC BY-SA 4.0
55 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Mar 31, 2023 at 11:04 | history | bounty ended | alephalpha | ||
| S Mar 31, 2023 at 11:04 | history | notice removed | alephalpha | ||
| S Mar 24, 2023 at 23:59 | history | bounty started | alephalpha | ||
| S Mar 24, 2023 at 23:59 | history | notice added | alephalpha | Reward existing answer | |
| S Feb 15, 2022 at 2:23 | history | suggested | astroide | CC BY-SA 4.0 |
My username's astroide, not asteroide (scientific notation modification only to make the edit long enough)
|
| Feb 14, 2022 at 23:40 | review | Suggested edits | |||
| S Feb 15, 2022 at 2:23 | |||||
| Feb 13, 2022 at 16:14 | history | edited | AnttiP | CC BY-SA 4.0 |
added 1 character in body
|
| Feb 13, 2022 at 0:54 | answer | added | Ciaran_McCarthy | timeline score: 1 | |
| Feb 11, 2022 at 7:56 | history | edited | AnttiP | CC BY-SA 4.0 |
edited body
|
| Feb 11, 2022 at 7:49 | history | edited | AnttiP | CC BY-SA 4.0 |
Update leaderboard
|
| Feb 11, 2022 at 7:43 | history | edited | AnttiP | CC BY-SA 4.0 |
Update leaderboard
|
| Feb 10, 2022 at 22:51 | answer | added | Aiden4 | timeline score: 1 | |
| Feb 10, 2022 at 13:19 | comment | added | AnttiP | @alephalpha It's the newer one (it was 1100000 before) | |
| Feb 10, 2022 at 13:18 | comment | added | alephalpha | @AnttiP Is the score for my Rust answer from the first version or the second? The second version is slower on TIO but faster on my computer. | |
| Feb 10, 2022 at 11:50 | history | edited | AnttiP | CC BY-SA 4.0 |
added 1 character in body
|
| Feb 10, 2022 at 7:06 | comment | added | alephalpha | @null I tried the HashLife algorithm (using att's trick to reduce it to a CA with 16 states), but it was slow (more than 5s for input 100000) and quickly ate up all my memory for larger inputs. Maybe because the rule is too chaotic, or maybe just my implementation was bad. | |
| Feb 9, 2022 at 17:37 | history | edited | AnttiP | CC BY-SA 4.0 |
added 107 characters in body
|
| Feb 9, 2022 at 17:32 | answer | added | Polichinelle | timeline score: 9 | |
| Feb 9, 2022 at 17:05 | history | edited | AnttiP | CC BY-SA 4.0 |
added 120 characters in body
|
| Feb 9, 2022 at 16:48 | history | edited | AnttiP | CC BY-SA 4.0 |
added 101 characters in body
|
| Feb 9, 2022 at 16:46 | answer | added | AnttiP | timeline score: 2 | |
| Feb 9, 2022 at 12:13 | answer | added | alephalpha | timeline score: 1 | |
| Feb 8, 2022 at 20:54 | answer | added | robbie crockett | timeline score: 3 | |
| Feb 8, 2022 at 15:12 | comment | added | TwilightSparkle | Golly answer where | |
| Feb 8, 2022 at 12:19 | history | edited | AnttiP | CC BY-SA 4.0 |
added 102 characters in body
|
| Feb 8, 2022 at 12:14 | comment | added | AnttiP | @infinitezero Yeah, cpu only please | |
| Feb 8, 2022 at 11:36 | comment | added | infinitezero | You don't mention anything of a graphics card, does that mean we may only use CPU instructions? | |
| Feb 7, 2022 at 15:09 | comment | added | ovs | Wesley Pegden (mentioned in the Numberphile video) has a nice gallery of zoomable images with up to \$2^{30}\$ grains of sand | |
| Feb 7, 2022 at 14:21 | history | edited | AnttiP | CC BY-SA 4.0 |
Update leaderboard
|
| Feb 7, 2022 at 14:06 | history | edited | AnttiP | CC BY-SA 4.0 |
Update leaderboard
|
| Feb 7, 2022 at 12:36 | answer | added | ophact | timeline score: 1 | |
| Feb 7, 2022 at 10:42 | answer | added | alephalpha | timeline score: 3 | |
| Feb 6, 2022 at 23:07 | answer | added | astroide | timeline score: 3 | |
| Feb 6, 2022 at 22:54 | history | became hot network question | |||
| Feb 6, 2022 at 21:00 | answer | added | ovs | timeline score: 7 | |
| Feb 6, 2022 at 19:33 | answer | added | Neil | timeline score: 3 | |
| Feb 6, 2022 at 18:44 | answer | added | Neil | timeline score: 4 | |
| Feb 6, 2022 at 18:00 | history | tweeted | twitter.com/StackCodeGolf/status/1490384813425143809 | ||
| Feb 6, 2022 at 17:39 | comment | added | l4m2 | I guess the complexity is O(nlog^k n), and with some time optimization RAM is still bad | |
| Feb 6, 2022 at 17:19 | comment | added | Jonah | @ovs It's nuts how many iterations it goes for.... | |
| Feb 6, 2022 at 16:29 | comment | added | AnttiP |
@Neil Feel free to submit your answer as Charcoal + shell and use tr or something to remove the whitespace (make a .sh file)
|
|
| Feb 6, 2022 at 16:20 | comment | added | Neil | Best I can do in Charcoal on TIO is about 2560 or so (note square grid output due to language limitations): Try it online! | |
| Feb 6, 2022 at 16:17 | comment | added | l4m2 |
How much time was the image in the question generated? I can compress 1/8 of the image into 164KB .7z
|
|
| Feb 6, 2022 at 16:10 | comment | added | AnttiP | @Neil The output format is a flattened square grid. This is fastest code so a rigid output format shouldn't be much trouble, and it will make verifying submissions easier and if for some reason the IO would have a measurable impact on performance, it makes it so that answers can still be compared. | |
| Feb 6, 2022 at 15:57 | comment | added | Neil | Why can't I output a square grid? | |
| Feb 6, 2022 at 15:42 | history | edited | AnttiP | CC BY-SA 4.0 |
added 194 characters in body
|
| Feb 6, 2022 at 15:35 | comment | added | AnttiP | @l4m2 I would imagine this challenge is more compute bound, but I've included my systems ram capacity in case there is some space-time trade-off that I'm missing | |
| Feb 6, 2022 at 15:34 | history | edited | AnttiP | CC BY-SA 4.0 |
added 18 characters in body
|
| Feb 6, 2022 at 15:30 | comment | added | l4m2 | Will RAM be the limit? | |
| Feb 6, 2022 at 15:30 | comment | added | Parcly Taxel | This is known as the Abelian or Bak–Tang–Weisenfeld sandpile model. The word "abelian" may help answers immensely... | |
| Feb 6, 2022 at 15:14 | comment | added | ovs | This is not gonna win any prices for speed, but here is some animated sand dropping | |
| Feb 6, 2022 at 14:56 | comment | added | caird coinheringaahin g♦ | "What's amazing to me is that even though the rules are very simple and discrete, complex and organic behavior emerges both at a small and large scale." - this is because this a form of a cellular automaton, which are famous for their simple rules and complex results (e.g. Game of Life) | |
| Feb 6, 2022 at 14:55 | comment | added | TwilightSparkle | Amazing challenge!! | |
| Feb 6, 2022 at 14:55 | history | edited | caird coinheringaahin g♦ |
edited tags
|
|
| Feb 6, 2022 at 14:53 | history | asked | AnttiP | CC BY-SA 4.0 |