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 |
|---|---|---|---|
| 58336 | 2017-09-19 15:07:53 | 103.17 | 97% |
| 56586 | 2017-09-01 10:26:56 | 106.03 | 98% |
| 50496 | 2017-06-12 22:45:58 | 102.07 | 98% |
| 48618 | 2017-05-08 18:41:13 | 102.85 | 95% |
| 38783 | 2017-02-22 04:44:00 | 93.71 | 94% |