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 |
|---|---|---|---|
| 28708 | 2020-04-04 21:00:55 | 101.29 | 97% |
| 20026 | 2019-10-28 04:52:13 | 115.57 | 100% |
| 18818 | 2019-10-06 21:14:57 | 109.14 | 99% |
| 14701 | 2019-07-25 04:58:31 | 111.68 | 99% |
| 7669 | 2018-08-04 11:45:56 | 96.90 | 98% |
| 2652 | 2017-03-06 10:40:57 | 85.81 | 97% |