For every one of those special coordinates, there is a list of the surrounding special coordinates. I don't want to directly give out which coordinates a certain "jump" results in, so instead they get a letter identifying each "jump" possible from the current spot.
The idea here is that the coordinate is the randomness telling how to shuffle the coordinates. This way, the jumps from a given coordinate are consistent forever in the future so they could record them and say "oh, to get to (1, 2, 5) from (10, 2, 4) I can jump A, C, G, Y."
The alternative is to generate the list of jumps once and store it. I do not want to do this, since the coordinate lists won't be used too often. The seed is already there in the form of the coordinates. The major problem, though, is the addition of a coordinate to the list of jumps. I would have to update every neighboring coordinate list. Removal would be a similar pain, and I'd need to ensure that the other items aren't disturbed.
There are also other applications that I have in mind, but this is the one that would benefit from this the most.
In reply to Re^2: A reproducible shuffle? ("stable shuffle")
by AK108
in thread A reproducible shuffle? ("stable shuffle")
by AK108
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |