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 |
|---|---|---|---|
| 7491 | 2019-04-05 01:58:23 | 102.36 | 98% |
| 6878 | 2019-02-13 00:56:09 | 109.72 | 99% |
| 6189 | 2018-12-14 05:40:35 | 106.70 | 98% |
| 2846 | 2018-02-22 06:50:14 | 87.55 | 98% |