Toying with data structures

My current thinking on the pathfinding sub-project, as far as implementation, is something along the lines of:

1. A grid of 256 x 256 x 256 Octrees as the 2nd level of the heirarchy, each with a list of outside leaves and what other outside leaves they connect to, which gives us the ability to link each tree as a node, and find paths through each node in a relatively efficient manner.
   
2. The 3rd level of the heirarchy is using those Octrees as nodes, and inserting additional game data - teleporters, cave entrances, doors, etc, stuff only available in the live game - which would alter the edge costs in all 3 heirarchies and add additional links and edges where appropriate (this grid block links to this one via this tree, in this leaf, via this node -- teleporters are costless edges, doors require action to traverse, and so on)

I'm not really fully confident I'm grasping all of this correctly, but I figure the best way to learn is by doing, so I'll let you know how it turns out...

The Alexandria playerbase is getting kinda angsty while I'm working on projects and not paying attention to them as much as I normally would, and I need to keep a few promises on that end, so I  probably won't be posting much progress for a week or so. On the bright side, next week is Silent Hill 5. I'm also kind of undecided on preordering Dead Space.

I also got my hands on Warhammer Online a couple days ago. There's stuff I like, and stuff I don't, and I'll get around to an analysis on that as soon as I put a little more play time in; I seriously doubt that I'm qualified to judge the game with two characters at lv6 and 5, but so far things are looking good.

War chars: Reikynael (R5 Witch Hunter) and Maegluin (R6 Shadow Warrior) on Chaos Wastes.