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 |
---|---|---|---|
20901 | 2019-10-29 07:47:14 | 165.48 | 99% |
20659 | 2019-10-03 16:00:03 | 135.20 | 96% |
18741 | 2019-06-03 01:05:37 | 166.78 | 98% |
17959 | 2019-04-25 22:06:14 | 188.72 | 100% |
16201 | 2019-03-22 01:06:53 | 166.23 | 99% |
14195 | 2019-02-15 05:17:47 | 135.36 | 97% |
11168 | 2019-01-29 07:02:35 | 147.78 | 99% |
8283 | 2018-09-05 22:14:22 | 173.13 | 99% |
7212 | 2018-07-29 18:47:31 | 159.46 | 99% |
2634 | 2018-04-13 01:27:23 | 150.36 | 98% |
793 | 2018-02-19 18:46:58 | 164.81 | 99% |