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 |
|---|---|---|---|
| 32520 | 2019-12-21 10:15:16 | 129.21 | 97% |
| 29400 | 2019-08-13 20:33:59 | 124.65 | 98% |
| 29122 | 2019-08-09 22:34:13 | 136.95 | 99% |
| 20303 | 2019-04-03 14:01:03 | 140.18 | 99% |
| 17217 | 2019-03-12 19:58:14 | 121.93 | 97% |
| 16020 | 2019-03-06 15:15:23 | 135.08 | 97% |
| 14636 | 2019-02-25 10:46:46 | 129.38 | 97% |
| 4515 | 2018-10-30 13:59:25 | 130.52 | 98% |
| 1682 | 2018-07-27 21:41:26 | 134.77 | 98% |