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 |
|---|---|---|---|
| 10446 | 2020-06-18 11:49:26 | 113.54 | 99% |
| 6169 | 2019-02-26 10:28:14 | 122.98 | 99% |
| 5057 | 2019-01-24 16:13:26 | 111.78 | 99% |
| 1325 | 2018-09-18 07:22:08 | 123.61 | 100% |
| 854 | 2018-09-07 13:25:10 | 108.01 | 98% |