Comments on: A* (Astar)

By: Dauntless

Dauntless — Tue, 06 Jul 2010 15:16:28 +0000

Thanks for the compliments

By: Strapro

Strapro — Tue, 06 Jul 2010 09:20:49 +0000

You sir are a coding god.
Your implementation was the second I tried and it was far far better.
My map is approximately 1500 tiles and I am requesting 10 paths pretty much simultaneously.
No sweat at all! Thank you

By: A* (Astar) « AS3 Game Gears

A* (Astar) « AS3 Game Gears — Wed, 05 May 2010 02:45:25 +0000

[...] A* (Astar) is an AS3 implementation of A* path finding algorithm. It’s primary goal is stability. It should be able to find the path on a 1000×1000 map as well as on a 10×10 map. Share: [...]

By: Dauntless

Dauntless — Fri, 23 Apr 2010 23:18:46 +0000

I just tried it here and it worked.

Try recreating your project and maybe clear out your ASO cache.

By: Rodrigo

Rodrigo — Fri, 23 Apr 2010 22:50:16 +0000

Thanks a lot for the AStar. But I’m having troubles runing the example. I get this error:
C:\… .as:130: 1046: No se encontró el tipo o no es una constante en tiempo de compilación: AstarEvent.

Mmmh. Is really strange, because I imported the AstarEvent. Do you know what can be the problem?

Rod

By: Radek

Radek — Sun, 18 Apr 2010 01:13:24 +0000

Thanks for your reply!

I am trying to make MMO with huge maps. I am using negative values because I want to make sure I can expand maps in the future. So I am not limited to starting point 0,0 and can expand in both ways.

I am using negative values in all system, so I didnt thought about your solution (add +1000). But as map will be separated into smaller parts anyway, your solution will work I beleive
Shame I didnt thought about that, because in my solution I still added +13, but I had to recreate separate pathfinding map on every avatar move

So thank you for your tip, but you can still take it as suggestion for future release ! Also thank you for your AStar implementation, it saved me a lot of time!

By: Dauntless

Dauntless — Thu, 15 Apr 2010 13:33:27 +0000

Hi,

That would require some tweaking. Why do you need that exactly? It would probably be easier to create a mapping function that (fe) adds 1000 to every coordinate, hence making them positive.

By: Radek

Radek — Thu, 15 Apr 2010 12:30:16 +0000

Hello,

I have used your code and it was great help. I only thought it would be great if it can work with negative coordinates like x:-5,y-1.

Is there some easy way how to make it work with negative numbers?

By: B.Riché

B.Riché — Wed, 31 Mar 2010 09:06:23 +0000

Hi !

I’m looking for an algorithm that could allow to search for the closest tile when no path has been found. Does someone knows how this could be managed ?

By: MartinT

MartinT — Sat, 13 Mar 2010 16:51:18 +0000

Really nice implementation.

Maybe you can guide me.

I’m trying to add an analyser that would prefer straight line even if it’s cost a little more. I already changed the diagonal const to avoid diagonal move.

I was thinking maybe changing the cost in the map, but it didn’t seem right like the full proof approach.

ex:
map
1111E
11111
11111
S1111

should do
1111E
11110
11110
S0000

instead of
1110E
11001
10011
S0111

Thx in advance

Martin