This may already exist on Forum and I don't know it? I found the gsf code for generating that ~5.4 billion list of ED (essentially different) sudoku puzzles in minimal lexographic order. Is there a posting anywhere of the begin and end of this list., I would settle for now for the first and last 10. I played around with various text editors to see if it was practical to put this in one text file. Too big for one file in my experience. Maybe two? However for me splitting over about 100 files seemed more manageable. I know a few of you have done this, probably using Glen Fowler's code.
One question is can his code be stopped and started and perhaps restarted at arbitrary points? Could I for example generate and store the first 100 million or so of the sequence, the either let it run without generating output OR else restart the code toward the end and store the last 100 million or so?
Thoughts, Ideas? And would someone send me some of the first and last parts?