载入中...
搜索中...
未找到
Deterministic fixed-cost tactics path queries. 更多...
类 | |
| struct | eve::tactics::ReachableCell |
| One reachable cell and its minimum fixed-point movement cost. 更多... | |
| class | eve::tactics::Reachability |
| Owning result of one deterministic reachability query. 更多... | |
| class | eve::tactics::PathQuery |
| Pure deterministic board path algorithms. 更多... | |
命名空间 | |
| namespace | eve |
| Build metadata (engine git commit, build time, third-party version). | |
| namespace | eve::tactics |
枚举 | |
| enum class | eve::tactics::CellRangeMetric : std::uint8_t { eve::tactics::Manhattan , eve::tactics::Chebyshev , eve::tactics::Hex } |
| Deterministic logical distance used by cellsInRange. 更多... | |
详细描述
Deterministic fixed-cost tactics path queries.
在文件 TacticsPath.h 中定义.