You are right, I probably should have a copyright file there, just so that if people use this project they have to cite me, other than that I don’t care about how people use it
I believe for avatar generations i have including this one, three of them. I thought i pushed the code already. For any code that requires a database access I don't push the code
Thanks, I appreciate seeing the code! For code with database access, you could use an environment variable from a .env file and gitignore that file, making it safe to share. (you're probably already aware of this practice and may have another reason not to want to push it)
For things working with database I mainly don’t want to expose the rpc calls or the database queries. I know people can just get it by checking dev tool but it’s one layer of labor and can filter out many people with millacious intent
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
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.
The infinite monkey theorem states that a monkey hitting keys at random on a typewriter keyboard for an infinite amount of time will almost surely type any given text, including the complete works of William Shakespeare.
Since it's basically pratically impossible to achieve that, I made a website with some house rules:
1. Any characters between two words will be ignored
2. We will only check for the next word in Shakespeare's work, so if the next word is 'thy', and the monkey magically typed 'hell', it won't count.
3. Every couple characters the monkey typed without hitting a word, we will increase an error tolerance, if the error tolerance is 3, and the current word is 'thee', if the monkey typed 'tahbeke', it will count since removing 'abk' which is 3 characters, we get 'thee'
4. Any user on the website can insert a new character every 30 seconds.
With those rules, maybe, just maybe we get to see the entirety of Shakespeare's work being typed out by the monkey.
Had this thought of making a website like this for a long time, if you have a special mesh with a specific piece of text in mind that could be represented in this way let me know