摘要 |
A method of generating an efficient sequence of "n<SUP>m</SUP>+m- 1 " level random numbers, each sub-sequence of "m" successive random numbers thereof having a different pattern, including the steps of generating a sequence of n-level random numbers based on an initial value, a number being generated at a time, determining whether a pattern of a sub-sequence is "used", if the pattern of the sub-sequence is "used", setting a different value to the initial value, if the pattern of the sub-sequence is not "used", accepting the newly generated number and marking the pattern as "used". All of the steps are repeated until all of "n<SUP>m</SUP>" patterns are exhausted. Since the newly generated number is rejected if the pattern of the sub-sequence is "used", the sequence becomes the shortest one of which all of "n<SUP>m</SUP>" patterns are exhausted.
|