Quote Originally Posted by Gadget
The only problem remaining is getting players to walk quickly... It's taking 250ms to move one map node,
Each map node should have a double ]lots[/b] of stuff on it, you'll need a fast way to find stuff on the node.

I wonder if TList are slow to use?
For this? Yes. While adds are O(1), removals are O(N) operations.

It would help if you posted more info on this.