Bay 12 Games Forum

I guess the heart of my question is "how did LE get that bomb inside The Tumor and why did he create the Green Sun" but the answer is "time shenanigans" so why even ask at that point.

So since the bomb contained both universes and synced up their destruction(s), the Red Miles thing happening in the troll session was "forced" to occur at the same time that the bomb went off elsewhere in the Furthest Ring, and that's why the Green Sun became visible from there briefly and the trolls could travel to it I put way too much thought into this

Quote from: Gatleos on April 17, 2016, 05:01:03 pm

Quote from: Sergarr on April 17, 2016, 04:58:09 pm

except Green Sun has an actual backstory to it

Does it, though?

http://www.mspaintadventures.com/cascade.php?s=6&p=6009

Oh right, it came out of an unexplained bomb inside an unexplained goopy spiky thing. Who put it there, Lord English? How did he put it there? If he created the for his own purposes, does that mean all of the First Guardians exist because of him?

None of this stuff is explained or even hinted at in the whole story, it all just exists because.

You can't use a hash to store coordinates (or any other data for that matter) because different inputs can result in the same hash.  You can start with a value and get its hash, and thus compare if a hash and value are equivalent.  But you can't start with a hash and walk backwards to get the value that created it.

The point wasn't to only store the hash, it was to use it as comparison criteria for a tree structure. The object itself stores its own coordinate, as well as the coordinate's hash.

I'd recommend using a quadtree* arrangement. Sort into 4 "buckets" based on the highest bit, then in each of those buckets, sort into 4 more buckets based on the next highest bit. Obviously, this needs to be a sparse tree, either lock it off at some specific level, and do a linear comparision of things in a region, or have a dynamic scenario where buckets are added or deleted depending on whether there's anything down that branch.

* for 2D data. To store sorted 1D data, it's a binary tree (e.g., a heap. but heap balancing won't work in 2D), and for 3D it's an octree. Either way it's largely the same algorithm.

Wow, that's not something I thought of until now. I guess that would definitely prevent any collisions between coordinates that aren't actually equivalent. I'll need to think of how I could implement that.

Quote from: MagmaDeath on December 07, 2009, 02:53:02 pm

Betty Crocker will be the Other side's Queen.
Hopefully.

Holy shit

Most problems people have with any kind of media, especially endings to stories, are due to reality not meeting their expectations. That doesn't mean that what they got was worse than what they expected, just different. They made an assumption about the type of story being told, and it turns out they were wrong. Then they interpret that disappointment as "the author fucked up".

That said, I agree that the structure of Homestuck is extremely messed up. Each part of the story is entertaining in its own way, but when you consider it as a whole you're left thinking "What the hell just happened?"

I'm satisfied with this overall but...

What was the deal with that ominous ending to Collide? Nothing that happened afterward fits that foreshadowing.