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 |
|---|---|---|---|
| 23336 | 2020-10-21 19:00:55 | 112.84 | 99% |
| 21383 | 2020-09-08 03:34:31 | 91.56 | 95% |
| 13224 | 2020-03-01 05:56:47 | 92.15 | 98% |
| 12698 | 2020-02-19 02:22:34 | 120.01 | 99% |
| 8158 | 2019-11-13 03:20:24 | 111.08 | 99% |
| 7645 | 2019-11-04 23:22:18 | 96.49 | 97% |
| 6577 | 2019-10-11 22:59:10 | 68.16 | 94% |
| 5409 | 2019-09-18 01:17:51 | 102.75 | 98% |
| 3750 | 2019-08-06 06:05:45 | 88.71 | 98% |
| 635 | 2019-02-06 03:52:53 | 71.16 | 94% |
| 314 | 2018-12-30 20:15:47 | 80.61 | 97% |