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 |
|---|---|---|---|
| 49387 | 2020-03-13 13:48:58 | 88.14 | 97% |
| 44711 | 2018-06-01 21:24:56 | 72.67 | 97% |
| 38159 | 2018-04-14 05:05:33 | 80.33 | 96% |
| 22842 | 2017-11-24 06:48:46 | 80.41 | 97% |
| 18863 | 2017-11-03 23:40:33 | 67.26 | 97% |
| 17240 | 2017-10-24 18:25:27 | 65.02 | 96% |
| 16121 | 2017-10-15 02:08:18 | 76.45 | 97% |
| 11049 | 2017-09-11 21:05:43 | 63.27 | 97% |
| 10123 | 2017-09-07 11:44:58 | 66.41 | 96% |
| 8610 | 2017-08-26 17:39:14 | 65.71 | 97% |
| 8265 | 2017-08-25 09:41:19 | 63.59 | 97% |
| 3749 | 2017-06-24 16:12:19 | 60.80 | 98% |
| 907 | 2017-05-17 03:04:59 | 39.10 | 93% |
| 359 | 2017-05-13 01:41:48 | 34.95 | 92% |