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 |
|---|---|---|---|
| 7490 | 2019-01-06 00:45:35 | 78.83 | 98% |
| 6499 | 2018-11-16 08:54:51 | 93.24 | 98% |
| 2175 | 2017-11-27 01:29:18 | 80.11 | 98% |
| 423 | 2017-07-05 06:20:18 | 57.06 | 95% |
| 52 | 2017-06-26 14:58:43 | 58.69 | 97% |