Friday February 12th

Thursday February 11th

0 Kicks

A* pathfinding search in C# - Part 3

This is the last installment in the series about A* search. The C# source code implemented is available in the final part of this post. As promised in the last words of A* pathfinding search in C# - Part 2 today we’re gonna run a test case using the Romania map. This post shows a test case in which the application outputs the shortest path from Arad to Bucharest. I used the ViewOtherPaths method to show the different possible routes. This way we can have a look at why the A* algorithm has chosen such shortest path.

0 comments

Commenting on Stories is limited for now and will open up to those recommended by the community. Learn how
Loading DotNetKicks...
brought to you by the Kicks Network