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 |
|---|---|---|---|
| 42006 | 2020-04-14 04:22:03 | 85.05 | 97% |
| 37165 | 2020-01-17 19:19:29 | 89.19 | 99% |
| 31643 | 2019-11-05 04:54:39 | 83.02 | 97% |
| 24287 | 2019-07-24 13:27:43 | 80.25 | 98% |
| 23691 | 2019-07-15 04:20:41 | 88.81 | 99% |
| 13642 | 2019-02-11 05:00:33 | 98.81 | 99% |
| 11302 | 2018-07-26 03:15:38 | 91.40 | 99% |
| 894 | 2017-12-31 05:31:05 | 70.16 | 96% |