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 |
|---|---|---|---|
| 45324 | 2020-11-12 16:18:18 | 132.66 | 99% |
| 39633 | 2019-04-03 14:01:01 | 153.03 | 99% |
| 29851 | 2018-01-09 12:43:04 | 126.23 | 99% |
| 26202 | 2017-10-19 20:09:24 | 148.89 | 99% |
| 25295 | 2017-09-10 16:01:51 | 154.06 | 100% |
| 22093 | 2017-04-05 17:40:24 | 145.19 | 99% |