fastest path

Article View: be.comp.programming

Article #16161

Back to be.comp.programming Previous Next

#16161

From: Sean Van Tyghem
Date: Tue, 06 Jun 2000 00:00

9 lines
846 bytes

Could anyone help with the fastest path algorithme??
It doesn't have to search diagonal, but it has to be fast........very fast,
cause i will use it a lot
It is for a tile based game.

thnx

best regards
sean

Technical Details

Message-ID: <393eb1e1$0$11459@bru5-newsr1.be.uu.net>

Path: arc1-ca.pugleaf.net!unknown!not-for-mail

Show Full Headers

Complete Article Headers

X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: faaa2,b78c5a542e9a1319,start
X-Google-Attributes: gidfaaa2,public
X-Google-Thread: fcea4,b78c5a542e9a1319,start
X-Google-Attributes: gidfcea4,public
From: "Sean Van Tyghem" <van.tyghem.sean@village.uunet.be>
Subject: fastest path
Date: 2000/06/06
Message-ID: <393eb1e1$0$11459@bru5-newsr1.be.uu.net>
X-Deja-AN: 632319052
X-Priority: 3
X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2615.200
X-Trace: bru5-newsr1.be.uu.net 960410081 11459 212.190.7.57
X-MSMail-Priority: Normal
Newsgroups: be.comp.programming,comp.games.development.programming.algorithms