Continuing from this question: The buckets of water problem (All the definitions can be found there, so I will not repeat them). As seen there by Yuval's answer, the problem is NP-Hard. I was attempting to prove its Completeness, and while doing so - I was suddenly not sure whether or not it belo...

I'm working on a system that will require manual data entry of 10-digit numbers (Σ = 0123456789). To help prevent data errors, I want to avoid generating any two strings that have a hamming distance of 1. For example, if I generate the string 0123456789 then I never want to generate any of these ...