I''ve been told that Max d.x d.y is the best solution for finding ranges on hex maps. Unfortunately I have no idea what this means. Would anyone point me to a tutorial / book that covers this topic. I''m trying to put together a turn based engine that will flag any ''detect encounters'' for units. All movement is keyed in for each turn and then the engine has to output any phase of the turn in which another enemy unit is within detection range. any help with pathfinding would be an added bonus (there are about 10 tile types with different units being able to traverse different tiles at different rates). Thanks in advance.

Thank you.

No sooner had I posted the question than I found Amit''s page thru the links from this site. I wish I''d found it sooner, it''s a goldmine.

The most attractive option I''ve found is
http://fp.premier1.net/butler/mark/hexpart/hexpart.html

subdivides the hex map into a rectangular grid.

Is it plugged in? Is it switched on?