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 |
|---|---|---|---|
| 18222 | 2019-03-08 01:45:23 | 154.17 | 100% |
| 14569 | 2018-11-02 23:51:17 | 136.42 | 99% |
| 10263 | 2018-09-12 02:51:44 | 139.63 | 99% |
| 7968 | 2017-04-01 23:33:42 | 139.80 | 100% |
| 7907 | 2017-03-11 01:43:40 | 136.39 | 99% |