Print

Please login or register.
1 Hour 1 Day 1 Week 1 Month Forever
Login with username, password and session length

[Darvi]

I already try to do everything manually.
Git gud skrub.

Are you this guy

[Sergarr]

fucking circles

why y u worst case scenario?!

Do I really have to create a separate pathing system just for shitty circles? *sigh*

EDIT: Turns out a really easy modification of the algorithm will radically reduce the edge cases like that... at the cost of doubling the computation time. AAAAAAAAAAAAAAARGHHHHHH.

EDIT2:
Bad news: It's worse than that. Apparently I have to choose between wildly non-optimal but fastest, the optimal but sssssssssslow, and anything in between.
Good news: The difference between those lies simply in the number of path-central points.
Bad news x 2: Each path-central point requires a O(N) time to set up and O(1) time for adding a new element to the graph.
Good news x 2: I only need two path-central points to achieve reasonable optimum for most of the cases not involving Lovecraftian geometries.

[Karkov]

Blackmail Google into installing Google Fiber?

Somehow I think that Google has more dirt on you than you on them.  In fact, I sort of feel that they have more information on everyone than everyone has on them.

[Loud Whispers]

Google sees and searches all.

[Helgoland]

-snip-

What are you trying to program?

[Orange Wizard]

Non-Euclidean pathfinding, apparently.

[Sergarr]

-snip-

What are you trying to program?

A non-optimal fast pathfinding from one point in a graph to another. It involves picking one point as a path-central point and then recursively adding all other points to it, resulting a sort-of pathfinding tree.

The most basic form of it replaces the movement from point A to point B by moving first to a central point C. The more advanced forms try to shorten the way by cutting out the middle points and straightening the way, but it seems like simply adding more central points essentially does the same thing, while being much less complex to program.

Non-Euclidean pathfinding, apparently.

It's an abstracted hierarchic space path-finding, but it can be non-Euclidean, too!

[Helgoland]

How about contracting large cliques/other subgraphs which are nearly complete? It would presumably reduce computation time enormously while being fairly compatible with your method of optimization. Ah, but you need to determine the cliques first... It's been some time since I last did discrete mathematics.

[Aseaheru]

Assholes who are playing a world building game with no real rules besides the obvious "Dont change history, dont counteract things" decides to change history and counteract things, particularly by having a guy loldestroy something designed to keep that single guy in, and shockingly easy to have an outside force destroy.

[Sergarr]

How about contracting large cliques/other subgraphs which are nearly complete? It would presumably reduce computation time enormously while being fairly compatible with your method of optimization. Ah, but you need to determine the cliques first... It's been some time since I last did discrete mathematics.

That method of optimization is probably the best one, yeah.

The dividing method is going to be a pain, though. Maybe a crystallization process combined with picking a random new growth point can do that reasonably fast, though. And them crystallize inside the already formed crystals some more! Yeah!!!!!!!!

[smjjames]

Assholes who are playing a world building game with no real rules besides the obvious "Dont change history, dont counteract things" decides to change history and counteract things, particularly by having a guy loldestroy something designed to keep that single guy in, and shockingly easy to have an outside force destroy.

What's the game you're playing there?

[Sirus]

errything gone wrong
why you do this universe
even hole in pants

This has been a rage haiku by Sirus.

[TamerVirus]

Assholes who are playing a world building game with no real rules besides the obvious "Dont change history, dont counteract things" decides to change history and counteract things, particularly by having a guy loldestroy something designed to keep that single guy in, and shockingly easy to have an outside force destroy.

What's the game you're playing there?

It's in the forum games section

[Execute/Dumbo.exe]

Assholes who are playing a world building game with no real rules besides the obvious "Dont change history, dont counteract things" decides to change history and counteract things, particularly by having a guy loldestroy something designed to keep that single guy in, and shockingly easy to have an outside force destroy.

What's the game you're playing there?

Create a world.
It's a forum game he's running.
View post history really helps sometimes.
Edit: NINJAAAAAASSS

[nenjin]

If what he's talking about is viewable in his post history, then it's not a conversation for the Rage Thread. That goes for Aseaheru and anyone else that wants to know.

Here's a reminder: if what you're raging about is happening on Bay12, you do not talk about it here. Period.