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 |
|---|---|---|---|
| 32704 | 2020-12-04 02:58:14 | 145.53 | 98% |
| 29908 | 2020-10-06 01:00:37 | 136.86 | 98% |
| 23461 | 2020-07-15 19:23:47 | 142.65 | 98% |
| 13532 | 2020-05-04 23:39:56 | 143.90 | 98% |
| 11829 | 2020-04-21 04:09:55 | 131.96 | 98% |
| 7254 | 2019-10-12 17:39:59 | 125.91 | 98% |
| 5466 | 2019-07-25 04:58:39 | 86.99 | 97% |