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 |
|---|---|---|---|
| 33237 | 2017-09-13 11:50:56 | 68.15 | 97% |
| 32717 | 2017-09-10 19:52:54 | 65.08 | 97% |
| 30500 | 2017-08-26 14:36:33 | 75.70 | 99% |
| 29912 | 2017-08-23 03:51:22 | 79.09 | 100% |
| 29538 | 2017-08-19 07:56:12 | 70.25 | 96% |
| 29120 | 2017-08-16 10:46:37 | 67.18 | 98% |
| 28628 | 2017-08-12 15:25:28 | 59.39 | 94% |
| 27404 | 2017-07-31 10:46:49 | 72.62 | 97% |
| 25496 | 2017-06-20 20:38:31 | 77.48 | 99% |
| 24955 | 2017-05-27 21:54:03 | 73.64 | 97% |
| 24850 | 2017-05-24 17:43:58 | 68.52 | 94% |
| 23056 | 2017-04-16 10:01:06 | 72.83 | 96% |
| 22548 | 2017-04-09 14:14:39 | 81.41 | 100% |
| 22454 | 2017-04-08 15:09:07 | 70.94 | 95% |
| 22301 | 2017-04-07 14:58:43 | 73.44 | 96% |
| 20613 | 2017-03-08 17:01:50 | 69.77 | 93% |
| 18582 | 2017-02-05 21:58:55 | 70.34 | 97% |
| 16691 | 2017-01-22 09:13:24 | 63.84 | 94% |