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 |
|---|---|---|---|
| 4286 | 2017-04-28 15:18:12 | 71.32 | 93% |
| 2205 | 2017-02-04 17:52:33 | 70.07 | 91% |
| 1900 | 2017-01-27 11:33:13 | 69.43 | 96% |
| 1759 | 2017-01-20 20:55:11 | 57.94 | 92% |
| 1113 | 2017-01-15 06:03:58 | 51.09 | 86% |
| 1083 | 2017-01-14 15:07:12 | 61.45 | 95% |