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 |
|---|---|---|---|
| 10008 | 2019-02-23 18:03:19 | 81.66 | 100% |
| 6132 | 2018-04-17 22:28:16 | 59.63 | 100% |
| 2569 | 2017-08-15 23:09:27 | 59.15 | 100% |
| 1700 | 2017-06-12 23:06:56 | 74.11 | 100% |
| 146 | 2017-02-21 23:58:07 | 60.71 | 100% |
| 131 | 2017-02-21 23:39:06 | 58.85 | 100% |