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 |
|---|---|---|---|
| 6874 | 2017-06-30 15:37:57 | 83.68 | 96% |
| 6442 | 2017-06-23 04:31:40 | 82.80 | 99% |
| 3247 | 2017-05-04 16:10:50 | 82.07 | 95% |
| 1559 | 2017-03-16 14:23:34 | 63.84 | 92% |
| 1252 | 2017-03-13 13:46:50 | 64.94 | 93% |
| 414 | 2017-02-25 10:36:45 | 61.64 | 92% |