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 |
|---|---|---|---|
| 2168 | 2017-07-20 10:03:15 | 56.12 | 98% |
| 1602 | 2017-05-14 10:46:19 | 46.51 | 93% |
| 90 | 2017-02-01 06:41:47 | 30.57 | 93% |