shortest location option

Home Forums Code, Bugs, Suggestions, Questions shortest location option

This topic contains 1 reply, has 2 voices, and was last updated by  Delengroth 6 months, 3 weeks ago.

Viewing 2 posts - 1 through 2 (of 2 total)
  • Author
    Posts
  • #25915 Reply

    Philip

    Is there any way to find the shortest version of a location for a search (e.g. for “hello world” which would obviously appear many times)? I have no real idea how the search algorithm works so I’m guessing that it uses hashing meaning that it’s simply not possible without a search algorithm that would take a very long time but I’d be interested to know if it was doable.

    #25919 Reply

    Delengroth
    Participant

    I’m afraid not, else there would be a lot more believable finds being shared here. The search function doesn’t actually search all of the books, as that would be impossible (or just very slow). Instead, it generates backwards where the location would be by surrounding your search term with randomness (or words/blank space depending which option you picked) and finding the book where that page is. The book location isn’t actually a hash, but is a PRNG seed instead. To generate the rest of the book’s pages, the algorithm then switches directions and generates it forward as normal.

Viewing 2 posts - 1 through 2 (of 2 total)
Reply To: shortest location option
Your information: