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 |
|---|---|---|---|
| 36856 | 2018-09-28 13:52:46 | 126.36 | 98% |
| 31027 | 2018-07-26 17:25:17 | 123.62 | 99% |
| 30488 | 2018-07-23 19:41:30 | 132.98 | 98% |
| 29023 | 2018-07-09 13:41:16 | 127.02 | 99% |
| 28413 | 2018-06-22 13:04:51 | 139.32 | 100% |