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 |
|---|---|---|---|
| 63154 | 2020-09-07 15:05:09 | 65.48 | 96% |
| 54570 | 2019-04-06 13:55:58 | 64.31 | 98% |
| 54455 | 2019-04-05 06:53:33 | 55.52 | 95% |
| 36277 | 2017-08-17 16:36:45 | 69.59 | 98% |
| 35825 | 2017-08-09 13:23:05 | 59.67 | 96% |
| 34845 | 2017-07-19 16:22:57 | 63.40 | 96% |
| 34560 | 2017-07-13 15:01:07 | 68.47 | 97% |
| 34165 | 2017-07-05 15:53:51 | 60.25 | 96% |
| 33240 | 2017-06-20 13:20:47 | 64.61 | 97% |
| 32150 | 2017-05-27 15:42:15 | 56.24 | 92% |
| 30862 | 2017-05-09 13:30:00 | 60.79 | 92% |
| 26266 | 2017-03-14 14:33:04 | 65.81 | 96% |
| 26075 | 2017-03-12 12:31:00 | 64.24 | 96% |
| 22202 | 2017-01-29 13:31:24 | 56.77 | 94% |
| 21916 | 2017-01-27 04:34:58 | 50.35 | 89% |