Hey,Im all new to this site, and to java, but i've been doing VB and C for many years. anyways, im not that smart on OOP yet, and now i've convertet my VB a* algorthym to Java.The thing is, i KNOW it's not very optimized, but i thought i'd share it. It's implemented in a sample here,

Thanks for the algorithm. I doubt that many will be willing to download the ZIP, open all java files and go through the complete algorithm (I certainly wasn't - sorry).

Maybe you could post a short section of your code where you expect potential for further optimization.

From a quick glance I had the impression that the code was a fairly straightforward implementation of the A* algorithm. One (rather formal) hint: Convention has it that method names begin with a lower case character.

oh, yeah, I see what youre saying...Its alot of work to get into someones esles code.But if there are any hard core nitpickers out there, bent on finding something to correct me on, they are still welcome to do so =)

it's hard to explain, but ill try.i made two algorythms. one is old, and not objectoriented. It is not a real astar and was originaly made for visual basic. i've convertet it to java.

The second is a full blooded A* (at least as far as i know) based on OPEN and CLOSED lists and whatnot. followed a tutorial to make it. it's short and sweet codewise.

BUT, for reasons unknows the old algorythm is about 10 times faster. now i know that you might think (after looking at the code) that the old algorythm just checks four direction while the new oo code cheks eight. but it should not make that much of a difference!

java-gaming.org is not responsible for the content posted by its members, including references to external websites,
and other references that may or may not have a relation with our primarily
gaming and game production oriented community.
inquiries and complaints can be sent via email to the info‑account of the
company managing the website of java‑gaming.org