That's pretty nice : D
I never thought that the A* algorithm would be possible in Alice!
This is damn amazing!
Go on! ; D

Be sure to change do in orders to do together if it will still work! That always speeds it up! Also, do I smell a snake with java attached to it's tail? Smells like Jython! I'm looking into it, and since Jython can have nested lists and dictionaries and queues, it's the perfect thing. I predict that it can calculate a path in an instant!:p

[QUOTE=zonedabone;19432]Be sure to change do in orders to do together if it will still work! That always speeds it up! Also, do I smell a snake with java attached to it's tail? Smells like Jython! I'm looking into it, and since Jython can have nested lists and dictionaries and queues, it's the perfect thing. I predict that it can calculate a path in an instant!:p[/QUOTE]

Yeye, but it's much cooler that such things can be done in pure Alice : D

Zonedabone and his Jython. Tsk Tsk Tsk. No, I am just kiding I bet he is right.

[QUOTE=King Gamer(gorit);19439]Zonedabone and his Jython. Tsk Tsk Tsk. No, I am just kiding I bet he is right.[/QUOTE]

He is! ; )

I first try to get it running in Alice to see if the basics will work. Getting it to run in Jython is pretty much on the to-do list, so it might not be implemented for a while :p.

I got inspired! :p
So I made my own version of A* in Alice based on an older A* project I made in VB.net.
It can go diagonally, but it won't cross edges diagonally, that would've hurt!
It is sable and I haven't seen any bugs so far.
I do also think that it is abit faster that your version.

Hope you'll get the use of it ;)

[QUOTE=zenteo;19508]I got inspired! :p
So I made my own version of A* in Alice based on an older A* project I made in VB.net.
It can go diagonally, but it won't cross edges diagonally, that would've hurt!
It is sable and I haven't seen any bugs so far.
I do also think that it is abit faster that your version.

Hope you'll get the use of it ;)[/QUOTE]

I tested yours against my new one and here are the results:

Zenteo: 45s
Niteshifter: 18s

Yours would definitely beat my old one since my old one has faulty search techniques. I might actually make use of your reconstructing method though (mine is still a bit bugged :p), so that's a plus :)

[QUOTE=x2495iiii;19540]Goodbye, Mr. Allen.

"User lanceA has been banned permanently."[/QUOTE]

Ey! Come on... He is trying to help (some) people and he isn't always rude.
Please give him a chance and give him temp bans instead.
He can act normal and maybe he will, someday.

[QUOTE=Niteshifter;19533]I tested yours against my new one and here are the results:

Zenteo: 45s
Niteshifter: 18s

Yours would definitely beat my old one since my old one has faulty search techniques. I might actually make use of your reconstructing method though (mine is still a bit bugged :p), so that's a plus :)[/QUOTE]

Just 18 second O.O
Wow! That's a huge improvement!
I'm trembling with excitement for the final result. :D

[QUOTE=zenteo;19548]
Just 18 second O.O
Wow! That's a huge improvement!
I'm trembling with excitement for the final result. :D[/QUOTE]

I'm trying to fit in binary heaps to get it faster. My main plan is to remove all iterative loops (or at least as many as possible).