On Thursday 07 November 2002 04:35 pm, Jason Gauthier wrote: > Greetings- > > I've long been using the standard track code (merc aged). > It's fairly complicated code, uses a lot of memory/CPU and is slow. > > While this type of algorithm is above my head, I'm wondering if any others > have been written? > (Or tips for increasing the performance on the stock merc one?) > > I did find one, the copyright has this info: > Jorge Ribeiro Pereira <[EMAIL PROTECTED]> 20/12/1998 > > and it's documented that it's faster and easier to read. > It's much easier to read. but it's much slower, the algorithm used (if you > can call it that) is terrible. > (I calculated about 6 million recursive function calls to go over east less > than 10 rooms) > > Thanks, >
Eh, I'm a bit late, but since nobody else mentioned it, there's a few good bits of information and links regarding pathfinding and multiple (common) algorithms and approaches to accomplish it over at Agora (http://agora.cubik.org/). Main.Pathfinding: http://agora.cubik.org/wiki/view/Main/PathFinding -- Bobby Bailey | "The only source of knowledge is experience." MUD Developer | -- Albert Einstein Internet Junkie | PGP Keys: http://chil.kyndig.com/pgp http://www.kyndig.com/ -- Mud & Online Text Game Community
