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 |
|---|---|---|---|
| 2263 | 2018-01-07 09:20:13 | 94.27 | 96% |
| 1507 | 2017-07-15 07:20:28 | 73.57 | 95% |
| 1215 | 2017-07-02 11:28:06 | 73.36 | 94% |
| 263 | 2017-04-06 12:06:54 | 61.18 | 89% |
| 31 | 2017-04-01 03:29:39 | 51.98 | 91% |