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 |
|---|---|---|---|
| 507 | 2018-01-24 04:57:12 | 64.02 | 96% |
| 288 | 2017-12-05 07:11:18 | 58.02 | 93% |