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 |
---|---|---|---|
220 | 2017-04-24 02:46:01 | 57.52 | 93% |
126 | 2017-04-14 06:58:28 | 42.35 | 81% |
106 | 2017-04-13 08:06:15 | 53.98 | 92% |