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 |
|---|---|---|---|
| 26505 | 2019-11-15 05:06:32 | 128.15 | 98% |
| 20953 | 2019-04-18 12:17:49 | 111.12 | 98% |
| 9135 | 2018-09-26 20:02:18 | 116.46 | 98% |
| 8488 | 2018-09-11 09:39:13 | 120.94 | 98% |
| 401 | 2018-03-29 04:47:20 | 106.02 | 97% |