This method chooses N games of M numbers each which are guaranteed to be unique. The numbers are represented as N rows of M columns each. They are generated using a pseudo-random number generator with a flat probability distribution then sorted so that each number in the range one to N appears at most once in each column and also at most once in each row. This set of games will maximize the chances of winning to the statistical limit assuming a flat probability distribution.
Because each number 1-N is played exactly M times, the drawing will match M-squared of the numbers you have chosen among your N games. Because each invocation of this game-choosing program starts the random number generator at a non-deterministic seed value, the set of games generated will be unique. Therefore, multiple players playing unique sets of games generated by this system will add their overall probability of winning.