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 |
|---|---|---|---|
| 7022 | 2019-04-10 14:22:10 | 111.32 | 98% |
| 6564 | 2019-02-02 18:23:29 | 118.97 | 99% |
| 6526 | 2019-02-02 00:17:30 | 122.37 | 99% |
| 5763 | 2018-11-15 10:19:45 | 123.55 | 100% |