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 |
|---|---|---|---|
| 60810 | 2020-08-18 03:13:31 | 118.25 | 97% |
| 59214 | 2020-08-08 12:16:17 | 137.69 | 99% |
| 59079 | 2020-08-07 12:00:49 | 118.43 | 97% |
| 56969 | 2020-07-26 12:03:51 | 77.88 | 96% |
| 48647 | 2020-06-14 09:59:21 | 82.34 | 99% |
| 48539 | 2020-06-14 01:29:36 | 136.22 | 99% |
| 47018 | 2020-06-06 01:25:23 | 84.87 | 96% |
| 46247 | 2020-06-02 10:50:18 | 111.32 | 97% |
| 24209 | 2019-12-13 16:04:00 | 106.03 | 98% |
| 16979 | 2019-09-21 14:49:47 | 61.40 | 98% |
| 12324 | 2019-07-21 09:10:36 | 111.04 | 97% |
| 755 | 2018-10-21 12:31:24 | 116.92 | 99% |