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 |
|---|---|---|---|
| 18358 | 2018-02-20 06:46:32 | 60.11 | 96% |
| 12795 | 2017-06-24 05:38:43 | 70.89 | 98% |
| 11061 | 2017-05-21 14:37:17 | 52.84 | 94% |
| 10188 | 2017-05-20 04:27:01 | 61.80 | 93% |
| 9466 | 2017-05-18 04:41:46 | 62.58 | 96% |
| 8405 | 2017-05-04 13:12:52 | 58.97 | 96% |
| 7685 | 2017-05-02 04:44:58 | 59.15 | 93% |
| 1687 | 2017-01-22 00:26:02 | 53.11 | 92% |
| 782 | 2017-01-19 03:07:37 | 55.65 | 96% |