Solving a hexagonal sliding puzzle in a hexagonal grid with 9 tiles and 10 empty locations. Using the A* algorithm using heuristics for Manhattan distance and number of tiles out of place relative to goal.