- JustSomeGuy 1m
- Strummer 1m
- Gilbador 15s
- DiamondNine 11s
- Malakai 7s
- stylo 1m
- Storm 20m
- Melpothalia 3m
- Valentine 10m
- svetlana 3s
- CellDweller 3m
- attaboy 4m
- Atheran 22m
- Neekly 1h
- SacredWest 1h
- FancyPenguin 1m
- Wonderland 8m
- SolBro 20s
- Speccy 59s
- Vera 28s youtu.be/wmOw-jplSMk
- Fire 3m https://i.imgur.com/CF2ywFy.jpg
- jsmith225 1m
- Baron17 15s
- Baguette 3h ye boi
- Lycanthorph 7s
- waddlerafter 2m
- Malanth 4s
- Marioanius 12s Hamilton wrote, the other 51!
- Rangerkrauser 1m
- jwimpeney 21s
- Rigo 5s
- Newbs21 20s We're all crazy here!
- Evie 2m
- Dawnshot 18m https://youtu.be/qg_7saEbnwE
- ThatOneGuy 3h Welp.
- Chrissl1983 1h Really enjoying this awesome game to the fullest!
a Cerberus 13h Head Builder & GM when I need to
- YourLeftHand 2h
j Johnny 1h New Code Written Nightly. Not a GM.
- Azelle 15h
And 26 more hiding and/or disguised
Connect to Sindome @ moo.sindome.org:5555 or just Play Now

Pathing Algorithm Update
Much improved!

So, we use a depth first shortest path algorithm. It's pretty complex. We use it to find paths from one location to another in a localized fashion (rooms are pretty close to each other) and we use the same algorithm when rooms are far away, using waypoints.

I was watching some videos today about how this algorithm works, hoping to find places we could optimize ours. I stumbled on something that we thought we were doing, but we weren't.

First, a bit of an explanation on how the depth first shortest path works.

We take a starting location, we take an ending location. We then find a bunch of different paths from starting point to ending point while at the same time keeping track of the shortest one that's found. We don't know which one is shortest until we're doing making our calculations. When we're all done, we use the shortest path to move NPCs and vehicles and stuff like that, throughout the game.

Sometimes this causes lag because NPCs move from one location to another and it's far away so it takes lots of calculations, or a taxi needs to drive from red to blue and that is a lot of moves, even with waypoints, and so it takes awhile. Sometimes a bunch of NPCs are moving at the same time or in quick succession in an automated manner. All these things lag the MOO intermittently because they all are calculation heavy.

The optimization I made today, was for each step in each calculation of a path, to check and see if the path it was currently calculating was already longer than the shortest path found. If it turns out it's longer, we just stop checking that path because it's garbage, we don't care. We have no reason to continue checking a path that will turn out to be 10 or more moves long when we already have a path that takes 9 moves to get from point a to point b.

This results in some dramatically increased performance detailed here:

Before Optimization, calculating the path from the 1st Floor Landing of New Rose, to Withmore Savings Bank: 6.86 seconds.

After optimization, making the same calculation: 0.36 seconds.

This optimization, coupled with our pathing cache, reduces the overhead that pathing has on the overall health of the MOO a large amount. This makes me very happy, but as with any change like this-- if you notice wonkiness, please let me know.

-- S

Good update! Good job Slither =D

I understand something just became faster and updated. And thank you for that! Also, for the hard work!

This is a nice introductory article on pathfinding for anyone curious (it has neat pictures too): http://www.redblobgames.com/pathfinding/a-star/introduction.html

I've noticed that certain NPCs always tend to pool up in the same room. They spawn in one and then seem to always end up in another.

Not sure if this is working as intended, but figured I'd mention it.