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 |
|---|---|---|---|
| 18380 | 2020-10-03 00:21:57 | 82.32 | 96% |
| 15954 | 2020-08-22 00:04:21 | 76.00 | 96% |
| 15833 | 2020-08-20 02:11:52 | 70.80 | 95% |
| 13322 | 2020-06-28 12:47:38 | 82.31 | 97% |
| 11887 | 2020-04-20 23:40:40 | 75.12 | 96% |
| 11481 | 2020-04-06 11:56:50 | 77.85 | 97% |
| 11283 | 2020-04-02 11:23:24 | 76.77 | 96% |
| 8288 | 2020-02-10 03:01:08 | 78.86 | 98% |