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 |
|---|---|---|---|
| 2120 | 2017-06-26 18:34:49 | 93.13 | 98% |
| 984 | 2017-03-21 17:53:27 | 70.59 | 86% |
| 743 | 2017-03-16 01:55:56 | 69.36 | 85% |