I'm attempting to use the MT19937 variant of the Mersenne Twister PRNG to accomplish something. Whether or not this something is feasible depends upon the answers to these two questions:
What is the greatest value of m for which the following statements hold true:
1 - For all seed values, the algorithm eventually produces every integer list of length m.
2 - There exists a seed value for which the algorithm would eventually produce a given integer list of length m.