Timeline for Sandbox for Proposed Challenges
Current License: CC BY-SA 3.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 6, 2015 at 21:15 | history | wiki removed | Martin EnderMod | ||
| May 3, 2015 at 15:37 | history | made wiki | Post Made Community Wiki by Martin EnderMod | ||
| Sep 4, 2014 at 21:28 | history | post merged (destination) | |||
| Aug 23, 2014 at 13:16 | history | edited | Peter | CC BY-SA 3.0 |
added 244 characters in body
|
| Aug 23, 2014 at 12:44 | history | edited | Peter | CC BY-SA 3.0 |
added 244 characters in body
|
| Aug 22, 2014 at 20:53 | comment | added | Peter | Hey, just updated it again, do things make a lot more sense now? | |
| Aug 22, 2014 at 20:52 | history | edited | Peter | CC BY-SA 3.0 |
added 37 characters in body
|
| Aug 22, 2014 at 20:38 | history | edited | Peter | CC BY-SA 3.0 |
added 970 characters in body
|
| Aug 22, 2014 at 12:53 | history | edited | Peter | CC BY-SA 3.0 |
added 221 characters in body
|
| Aug 21, 2014 at 2:46 | history | edited | Peter | CC BY-SA 3.0 |
deleted 304 characters in body
|
| Aug 21, 2014 at 0:42 | comment | added | Peter | Oh also, as to the bottleneck you mentioned, that's the main efficiency problem, I'm curious if anyone can find a method that doesn't involve reading the entire list every time a new point is added | |
| Aug 21, 2014 at 0:15 | comment | added | Peter | Thanks for the comments, I'll reword the question and set it to generating lightning forks, gives it a better title. As to the potential infinite dimensions, how would you reword it? I could manually code in 100 dimensions if I wanted to spend 20 minutes doing it, I'm just suggesting someone codes the option where it'll do it automatically. | |
| Aug 20, 2014 at 20:30 | comment | added | Peter Taylor | The bottleneck for many implementations could well be the I/O, so you should explain how you will take that into account when measuring performance. On the bonuses: Calculating the path between two items in a tree should be pretty simple: you track back from both until you find a common ancestor. But even though it's simple, you don't say how much of a bonus it gives. The other bonus confuses matters slightly when it says that it "should technically work for infinite dimensions": actually, it can't, because there's no fair probability distribution over an infinite set. | |
| Aug 20, 2014 at 20:29 | comment | added | Peter Taylor | You can pretty much guarantee that someone will be able to test most obscure languages posted here. See also this meta thread. Up, down, left, right, forwards, and backwards are 6 directions, not 6 dimensions. It sounds like you actually want 3 dimensions. There's no point posting obfuscated example code. In general, it's better to post a reference implementation as an answer to avoid clutter. The 2D visualised output is unhelpful. I would remove it to avoid confusing people. The hand-drawn 2D image is a lot more useful. | |
| Aug 20, 2014 at 20:28 | comment | added | Peter Taylor | What is the point of the unique ID? Each tuple would already appear to have at least one primary key: the (fork number, number in sequence) pair. The later rules seem to make it clear that the coordinates are also a primary key. Separately, what are the parameters of the simple 2D diagram? In particular, what is the fork length? The red line seems to imply a lower bound of 13, but the blue line isn't that long. | |
| Aug 20, 2014 at 20:28 | comment | added | Peter Taylor | The explanation of bifurcation says that "However, lightning doesn't stay as one straight line, so for the second fork..." This strongly implies that each ray is a straight line. But the 2D diagram shows rays changing direction a lot. What is the correct generation process for a single ray? For the "cannot go any further" termination process to kick in, does it have to be unable to go in any direction at all, or just to pick a random direction which is blocked? (This is partially explained further down in the rules, but it would be convenient to group the explanation in one place). | |
| Aug 20, 2014 at 20:26 | comment | added | Peter Taylor | Is the cloud at the origin (0,0,0)? Does the first ray travel in a random direction, or always in the same direction? When the first bifurcation is created by picking a random point on the first ray, does the second ray travel in a random direction or always in the same direction? If in a random direction, what happens if the direction selected is parallel with the first ray? | |
| Aug 20, 2014 at 20:26 | comment | added | Peter Taylor | You seem to be using the word "fork" to mean two different things: a single line of points, and a bifurcation where one line becomes two. Perhaps you could use "ray" for the first, since it's conceptualised as a lightning simulator. You also seem to use "point" to mean "point in an integer lattice", but I don't think you actually state anywhere that you're working solely in integers. | |
| Aug 20, 2014 at 16:45 | history | answered | Peter | CC BY-SA 3.0 |