#ifndef ALGORITHM_H
#define ALGORITHM_H
#include <stddef.h>
#include <game.h>

struct game make_maze(size_t y, size_t x);
typedef darray(struct point) pointarr;

//algorithm terminates with no path if target is not found within maxdist
//result contains target as well as the source point
//so even if next to the target, the result arr is at least 2 items big
pointarr astar(struct game *g, struct point start, struct point target, size_t maxdist); 


#endif //ALGORITHM_H