amethyst / amethyst/bracket-lib
Feature request: DijkstraMap find_lowest_exits function
未關閉
- 主要語言
- Rust
- 星號
- 1.7k
- 分支
- 126
- PR 合併指標
- 30 天內沒有已合併 PR
描述
In a 4-way movement roguelike, there are cases where there can be two movement directions that cost the same amount in the ```DijkstraMap```. This is a request to add a function to return a vector of the lowest exit indices for further processing.
You can see the issue this causes for monster movement with only having ```find_lowest_exit``` in HandsOnRust: they favor moving in dog legs chasing the player east/west and will never try moving north/south towards the player if the player moves east/west and is aligned with the monster.
貢獻指南
這個儲存庫沒有索引到貢獻指南
評估
這個 Issue 還沒有評估資料。