Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Hmm, I wonder if this could be used to find a decent pub whilst in a strange city?

It's always a problem when you're on holiday and you know there are n pubs around, but you don't want to spend all your time going around and checking each and every pub 'cos that gets tedious. The question is - how many pubs should I visit before I give up?

As a general rule is this saying you should visit n/e pubs and then just pick the next best one?



It would. But you'd need to know, or at least guess, how many pubs there were in the city (to know when you'd reached n/e), and it would also depend on whether the pubs were randomly distributed or not. If there's nice end and a trashy end of town, you could easily have exhausted all of the good pubs before you hit the n/e.


Yes, I guess you'd have to use real world factors to try and trim down your n before you start with the n/e thing. Although if you're in a strange place you probably won't know that much about which areas are good or not.


However, to find merely a good pub, √n is enough, given the assumptions mentioned later in the article.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: