Hi, Has anybody ever implemented the approximate A* ? If yes, what data structure did you use for the OPEN pseudo-queue ? Thanks, David

I''ve never heard of the ''Approximate A*'' algorithm. I''m intrigued, can you tell me a little about it?

- WitchLord

I gots no idea what this A* thingy is, but tha news section
here at gamedev links to an article about it
http://gamasutra.com/features/20000626/brockington_01.htm

Sounds like a bunch of wankers trying to confuse me in a global
conspiracy the likes of which has only been seen last week.
(if you ask me that is)


----------
Disco Love For Everyone

Well, as far as I understood, approximate A* is like A* except rather than taking the point with minimal f from the open queue, you take the point with the minimal h such as f
Btw., I guess you can do it with a priority queue, as long as it accepts pre-orders and does not require orders.

Be reading you,
David