amethyst / amethyst/bracket-lib

Feature request: DijkstraMap find_lowest_exits function

未关闭
#249 0 条评论 0 个 reaction 已指派 0 人 在 GitHub 查看
主要语言
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 还没有评估数据。

把新 issue 发到你的邮箱

精选适合新手参与的 GitHub issue 摘要。