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 |
|---|---|---|---|
| 42036 | 2019-10-23 15:25:59 | 102.01 | 99% |
| 39162 | 2018-04-22 16:24:23 | 94.13 | 98% |
| 39093 | 2018-04-21 02:27:00 | 101.01 | 98% |
| 37627 | 2018-02-19 14:03:07 | 93.51 | 98% |
| 37215 | 2018-02-04 05:50:58 | 83.94 | 96% |
| 35610 | 2017-11-01 13:08:54 | 98.63 | 99% |