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 |
|---|---|---|---|
| 53189 | 2019-09-16 01:58:15 | 122.19 | 100% |
| 53086 | 2019-09-09 06:01:38 | 120.34 | 100% |
| 50220 | 2019-03-31 06:54:36 | 116.61 | 99% |
| 48932 | 2019-03-11 01:12:32 | 101.09 | 97% |
| 48677 | 2019-03-07 04:36:43 | 116.03 | 99% |
| 47585 | 2019-02-17 09:35:36 | 110.65 | 99% |
| 46610 | 2019-02-05 08:42:40 | 102.28 | 97% |
| 38750 | 2018-09-15 08:22:41 | 111.36 | 99% |
| 38695 | 2018-09-15 01:25:11 | 103.71 | 98% |
| 28357 | 2018-01-24 21:14:33 | 96.57 | 98% |
| 22466 | 2017-09-03 19:55:52 | 96.84 | 98% |
| 15917 | 2017-04-19 21:34:59 | 96.09 | 97% |
| 15864 | 2017-04-19 02:44:35 | 95.00 | 97% |
| 15446 | 2017-04-11 05:51:03 | 86.28 | 94% |
| 14735 | 2017-03-30 02:26:07 | 91.49 | 94% |
| 13070 | 2017-02-13 08:47:34 | 98.77 | 99% |
| 12315 | 2017-01-19 06:03:26 | 77.00 | 90% |