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 |
|---|---|---|---|
| 16875 | 2017-07-01 04:34:36 | 76.61 | 97% |
| 16732 | 2017-06-28 15:26:24 | 73.08 | 96% |
| 13723 | 2017-05-09 14:34:26 | 68.90 | 92% |
| 13448 | 2017-05-04 15:22:17 | 73.09 | 95% |
| 12630 | 2017-04-20 15:27:10 | 72.38 | 91% |
| 10230 | 2017-03-16 05:41:16 | 82.02 | 96% |
| 9865 | 2017-03-05 10:51:04 | 85.68 | 97% |
| 9408 | 2017-02-17 15:36:24 | 66.58 | 94% |
| 7352 | 2017-01-19 03:07:31 | 61.76 | 91% |