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 |
|---|---|---|---|
| 47739 | 2018-02-13 23:16:55 | 140.68 | 99% |
| 45209 | 2018-01-30 20:43:16 | 137.45 | 98% |
| 41934 | 2018-01-08 05:42:30 | 158.99 | 100% |
| 39610 | 2017-12-24 19:07:58 | 136.68 | 98% |
| 35440 | 2017-11-13 12:49:56 | 145.31 | 99% |
| 29700 | 2017-10-15 08:34:53 | 148.69 | 99% |
| 25781 | 2017-10-02 00:29:38 | 103.52 | 97% |
| 25643 | 2017-10-01 17:31:19 | 103.83 | 96% |