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.
—from Artificial Intelligence Second Edition, a book by Patrick Henry Winston
Active since March 3, 2020.
278 total characters in this text.
View Pit Stop page for this text
| Rank | Username | WPM | Accuracy | Date |
|---|---|---|---|---|
| 1. | mako (mako640) | 171.83 | 100% | 2020-05-06 |
| 2. | (delirious) | 157.08 | 100% | 2020-03-03 |
| 3. | anT (gregorpingic) | 116.14 | 100% | 2020-11-16 |
| 4. | Achromatic - youtu.be/VuzE7... | 101.70 | 100% | 2020-04-27 |
| 5. | Bee (beejbeeabeey) | 92.88 | 100% | 2020-10-25 |
| 6. | watchdominion.com (leegunner) | 83.82 | 100% | 2020-09-06 |
| 7. | Daniel (bigjijiman) | 73.50 | 100% | 2020-09-19 |
| 8. | Nitish (nitishnevergiveup) | 62.73 | 100% | 2020-12-17 |
| 9. | Stefano (pasuxable) | 60.90 | 100% | 2020-11-18 |
| Universe | Races | Average WPM | First Race |
|---|---|---|---|
| Default (English) | 13,936 | 78.23 | January 9, 2017 |
| Instant Death Mode | 10 | 103.06 | March 3, 2020 |
| ᗜ Stenography | 9 | 58.33 | July 14, 2021 |
| New English Texts Are Here | 1 | 122.93 | April 25, 2023 |