-
Notifications
You must be signed in to change notification settings - Fork 3
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
Implement good pathfinding algorithm #29
Comments
Resources: roguebasin1, roguebasin2, redblobgames |
For now, I decided to just "bruteforcing" path from goal to the start (I can't be sure, but it looks like Dijkstra for me). It looks trivial, but SOMEHOW I can't implement it properly for a week... Still, I'd rather implement it from scratch by myself rather to use external library, because I want RAWIG to be self-contained, without any third-party libraries (except of BearLibTerminal) |
Example of current implementation (flawed and bugged): |
Fixed implementation: |
Creating graph is finally done! Commit history is very ugly, but I'm pleased with final effect. TODO:
|
backtracking in progress... |
Tests failing. code: https://play.golang.org/p/JqCWKPiOymH problems:
|
both flaws are fixed now |
#33 done! |
Finally, merged into development branch by 1e22dda |
No description provided.
The text was updated successfully, but these errors were encountered: