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 |
|---|---|---|---|
| 31961 | 2020-06-30 17:04:29 | 123.87 | 98% |
| 27631 | 2018-12-12 14:14:34 | 106.49 | 98% |
| 25663 | 2018-02-26 10:27:13 | 111.92 | 98% |
| 24443 | 2018-02-12 16:08:07 | 102.50 | 98% |
| 23771 | 2018-01-31 11:40:27 | 99.17 | 96% |