Hacker News new | past | comments | ask | show | jobs | submit login

That's a funny idea :)

I think the first one should be very much doable, but I am not sure how I would build the "almost complete" and the "similar colors" features.




I guess calculating the Levenshtein distance between the sets would work somehow?

Edit: scratch that, just intersect the set of available pieces with each set. If there are fewer than n--or m%--missing pieces, suggest those.




Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4

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

Search: