public void testClosestPath() {
Map map = new Map((byte)5);
Position currentPos = new Position(new Vector(0,0),0);
Position destinationPos = new Position(new Vector(2,0),0);
for(int y=0; y < 3; y++){
map.propagateOccupied((byte)1, (byte)y);
}
Position nextPosition = new Position();
Search search = new Search(map);
//search.closestPath(map, currentPos, destinationPos,nextPosition);
//map.showMap();