For example, assume one holds the jackpot ticket. Having 100 tickets all of the same numbers might not make much difference to the total win. This adds up to the same total win. Those questions demonstrate the concept behind unique combinations. A unique combination finder helps cover as many combinations of numbers within the given number of combinations as possible.
Unique combinations require a seed combination.
Theoretically, any seed combination will do. However, finding this seed affects the total number of combinations that can be found. Compliant combinations are then searched systematically by programatic means. New combinations are checked individually against all previously included combinations. This means chosen combinations are not only unique compared to the seed, but are individually unique.