A* search in a simple map using dijkstra heuristics and the grid_4_directions director.
Same map, but now using diagonal costs and grid_8_directions, still dijkstra.
A* search, same map, using manhattan distance as heuristics function and grid_4_directions director.
Now using manhattan_diagonal heuristics, and a diagonal cost function. Also using the grid_8_directions director.
Manhattan_diagonal heuristics, diagonal costs and grid_8_directions director. A* search in a more difficult map.
A interesting little feature of the new code, doing A* search in a map with the chess_piece_horse director.
Output from a quadtree test application, drawing circles with a radius of 0 to 10 in a 1000x1000 world.
Output from a quadtree test application, drawing circles with a radius of 1 to 10 in a 1000x1000 world.