Happy Thanksgiving!

2008-11-28T02:42:00Z

I woke up this morning wanting to make a quick thanksgiving flash game in haXe.
I started at about 11am, took 1.5hrs break, and finished at 4:30pm.

nothing spectacular, i even borrowed images from all over “google images” just to finish this up so I can go get some turkey!

Post up your high scores in my comments.

and Happy Thanksgiving!

play “Turkey haXe” now

Post your high scores in the comments below.

WTF happened to RemixTechnology.com ???

2008-11-26T12:51:00Z

I’ve decided to move all the old random crap to http://blog.RemixTechnology.com and only create articles on this new-ish site that are helpful to other people.
I also want to start answering flash and actionscript questions, so i’ll post them up here.
And i’m also in love with haXe so i’ll be posting any haXe stuff i make for fun… for fun :P

A* haXe pathfinding

2008-11-26T12:00:00Z

Original A* Actionscript3 by BMOD at BaseOneOnline.com

Same A* pathfinding by BMOD ported to haXe by yours truly

see the results…

I rewrote bmod at BaseOneOnline.com’s Actionscript 3.0 A* classes to haXe (flash9 because I’m working on a game and needed some quick pathfinding. I also wanted to see if haXe would solve the A* algorithm faster than the adobe actionscript 3 compiler, and by how much. The benchmarks are not as accurate on bmod’s as3 because he mentions he used an inaccurate timing method. I had trouble with haXe’s flash9.utils.Timer class too, so i used the haXe haxe.Timer class to get a more accurate measurement.

The solved path is not always the shortest path possible as intended. But will suffice for what i need it for.

When sorting a node’s neighbors by it’s cost (distance), I had some trouble because i didn’t know how to translate AS3’s Array.sort) to haXe’s Array.sort. So i added DiskTree.net’s QuickSort (sorting the node property for distance “f”) to the com.baseoneonline.haxe.astar package.

Other than the timer and replacing Array.sort with QuickSort, the code is pretty much the same, just re-written to be compiled on haXe. There may be a few more enhancements i can make to make this faster, such as using Vector instead of Array and compiling for flash10, something i may try, or you can try and let me know :)

The original BaseOneOnline.com AS3 A* Article is here: http://blog.baseoneonline.com/?p=87

The exact Actionscript3 source that i used to convert to haXe:
BaseOneOnline-AStar-AS3.zip
Check the site though, he may have an update

My haXe‘d A* classes:
zipped: AStar-haXe.zip
svn: http://publicsvn.remixtechnology.com/AStar-haXe

Both examples have random “unwalkable” tiles generated, so just refresh this page to get a new random tile map. Just click around on the lighter tiles to find new paths

Original A* path finding in Actionscript 3 [Source][Destination]
<object height="600" width="600"> <param /></object>

Ported A* path finding to haXe as3 [Source][Destination]
<object height="600" width="577"> <param /></object>

i hope this fills your haXe tile based path finding needs well. Many thanks to bmod for his great work!

theRemix - Home

Happy Thanksgiving!

WTF happened to RemixTechnology.com ???

A* haXe pathfinding