commit e3bb9a1bfee72e83766c86f3cade8259b46c5618 parent 36f37564cd566e91771cd1f92ac3886917c769d1 Author: Sebastiano Tronto <sebastiano@tronto.net> Date: Wed, 17 Dec 2025 09:28:03 +0100 Remove TODO section in doc Diffstat:
| M | doc/h48.md | | | 17 | ----------------- |
1 file changed, 0 insertions(+), 17 deletions(-)
diff --git a/doc/h48.md b/doc/h48.md @@ -428,20 +428,3 @@ Moreover, in this case one can optimize it further by avoiding to repeat the search from a coordinate that has already been visited. Further optimization are possible for **h0** and **h11**, and we may implement them in the future. - -## Possible future improvements - -*This section should be considered more of a collection of personal -notes rather than a description of the solver.* - -There are some areas where this implementation of the H48 optimal solver -can be improved: - -* Faster pruning table generation for **h11** and **h0**. Since these - two coordinates are "real" coordinates, we can use a different technique - to generate their tables faster. This won't affect the solver speed. -* Use - [BPMX](https://webdocs.cs.ualberta.ca/~nathanst/papers/AStar_Inconsistent.pdf) - to improve pruning estimation. This optimization sped up - [vcube](https://github.com/Voltara/vcube/commit/a5b08f51793f81ac34c1d402f2627f6a0495c636). - by about 5%-10%. Suggested by Arhan Chaudhary.