Sign in to follow this  
BloodLust666

what's A*

Recommended Posts

It's a search algorithm that will give the optimal path between two nodes (given that you have a heuristic that does not overestimate the distance). Most path finding algorithms in games are based on A*.

Check out wikipedia for more details. :)

Share this post


Link to post
Share on other sites
Quote:
Original post by Sneftel
If Dijkstra search and Greedy search had sex, this would be their kid.


:)) never tought about A* like this but it's really cool

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this