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 |
|---|---|---|---|
| 35285 | 2019-11-04 19:10:26 | 91.70 | 97% |
| 33675 | 2019-10-07 13:12:54 | 86.97 | 96% |
| 33275 | 2019-10-04 00:05:35 | 86.93 | 96% |
| 32679 | 2019-09-24 10:13:07 | 98.96 | 98% |
| 32181 | 2019-09-18 00:00:43 | 84.88 | 95% |
| 27975 | 2019-08-05 17:28:24 | 82.88 | 97% |
| 23846 | 2019-03-27 14:17:21 | 79.87 | 97% |
| 17693 | 2018-10-08 22:54:49 | 76.88 | 94% |
| 15373 | 2018-09-13 18:41:38 | 73.81 | 96% |
| 5676 | 2018-05-10 01:42:34 | 54.75 | 93% |
| 3414 | 2018-04-23 18:46:50 | 53.81 | 94% |
| 2702 | 2018-04-18 10:58:20 | 56.92 | 95% |
| 617 | 2018-03-25 21:25:25 | 43.62 | 94% |
| 129 | 2018-03-21 12:29:23 | 37.92 | 93% |