Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Pathfinding #1

Open
bojidar-bg opened this issue Nov 26, 2015 · 2 comments
Open

Pathfinding #1

bojidar-bg opened this issue Nov 26, 2015 · 2 comments

Comments

@bojidar-bg
Copy link
Contributor

The game has to be able to find a path between waypoints/hex corners, while abiding by the rules. It should:

  • Consider all spots walkable.
  • Prevent stopping on already taken spots.
@bojidar-bg bojidar-bg added this to the v1.0.0 - Initial target milestone Nov 26, 2015
@alketii
Copy link
Member

alketii commented Nov 26, 2015

We can take this from Godostra, no ?

@bojidar-bg
Copy link
Contributor Author

@alketii ~ it would be better without A* and the additional complexity. Plain old BFS (breadth-first search) or even DFS (depth-first search) will do the job better, as we need all spots within a radius.

@bojidar-bg bojidar-bg self-assigned this Nov 30, 2015
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants