To move through a tree of paths using hill climbing, proceed as in depth-first search, but order the choices according to some heuristic measure of remaining distance. The better the heuristic measure is, the better hill climbing will be relative to ordinary depth-first search.
| Game | Time | WPM | Accuracy |
|---|---|---|---|
| 854 | 2020-10-25 10:35:16 | 155.61 | 98% |
| 466 | 2020-10-01 01:59:38 | 169.94 | 99% |