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 |
|---|---|---|---|
| 35712 | 2020-07-11 15:22:03 | 110.70 | 97% |
| 30693 | 2019-07-28 12:01:13 | 117.85 | 99% |
| 29265 | 2019-07-10 20:15:04 | 121.49 | 98% |
| 23530 | 2019-05-03 10:17:51 | 117.24 | 97% |
| 22777 | 2019-04-18 19:13:29 | 109.78 | 96% |
| 21991 | 2019-03-31 06:54:37 | 112.72 | 97% |
| 18537 | 2019-02-18 18:28:32 | 106.26 | 97% |
| 16218 | 2019-01-22 22:04:08 | 107.72 | 98% |
| 10822 | 2018-11-06 13:54:05 | 89.60 | 98% |
| 8455 | 2018-10-21 12:31:35 | 82.52 | 97% |
| 4354 | 2018-09-18 15:25:12 | 58.99 | 95% |
| 2237 | 2018-08-31 15:12:59 | 61.16 | 94% |
| 1988 | 2018-08-25 18:16:05 | 52.27 | 94% |