Re:Ugly Avatar
by txstc55 on Monday March 25, 2024 @04:25PM
(#39820893)
It’s not hard but I don’t see the use of this, so probably not. And also although it doesn’t seem like it but the computation is quite intense for them, having multiple will lag the browser
[ Parent
| on HN ]
no worry.
maybe i'll explain why, it's like the finding a mate for marriage problem. you dates enough ppl to have a taste of what you like, and then for the next one that comes along that is on par with the best you've seen, you take that.
i guess a 3x3 grid is not necessary, maybe when you click "another", push the old one up (or down) the stack but keep it around so I can always go back and pick the best one I liked so far after the sampling?
Anyway, don't sweat about it, thanks for creating this.
What you are looking for is called the secretary problem [0]. This states that in a search like yours, you can determine beforehand how often you are willing to press "another", and after 37% of attempts, you pick the first one that's better than the best one so far.