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 |
|---|---|---|---|
| 18357 | 2018-12-21 20:39:56 | 69.37 | 99% |
| 5868 | 2018-02-01 23:40:44 | 65.65 | 100% |
| 5587 | 2018-01-20 22:45:49 | 68.43 | 99% |
| 1798 | 2017-12-08 19:39:20 | 62.76 | 99% |
| 536 | 2017-11-08 12:49:33 | 60.26 | 99% |