the most efficient way would be to implement "the random playlist algorithm" http://stackoverflow.com/questions/5467174/how-to-implement-a-repeating-shuffle-thats-random-but-not-too-random https://stackoverflow.com/questions/5467174/how-to-implement-a-repeating-shuffle-thats-random-but-not-too-random, it is basic simple well know algorithm.
***some one already gave this answer - "Fisher–Yates shuffle"
It seems like the most obvious way would be to start with an array[54] containing 1..54, then shuffle that, and keep the first three values in it.
no need to shuffle all the array, just the first three items..
the most efficient way would be to implement "the random playlist algorithm" http://stackoverflow.com/questions/5467174/how-to-implement-a-repeating-shuffle-thats-random-but-not-too-random, it is basic simple well know algorithm.
***some one already gave this answer - "Fisher–Yates shuffle"
It seems like the most obvious way would be to start with an array[54] containing 1..54, then shuffle that, and keep the first three values in it.
no need to shuffle all the array, just the first three items..
the most efficient way would be to implement "the random playlist algorithm" https://stackoverflow.com/questions/5467174/how-to-implement-a-repeating-shuffle-thats-random-but-not-too-random, it is basic simple well know algorithm.
***some one already gave this answer - "Fisher–Yates shuffle"
It seems like the most obvious way would be to start with an array[54] containing 1..54, then shuffle that, and keep the first three values in it.
no need to shuffle all the array, just the first three items..
the most efficient way would be to implement "the random playlist algorithm" http://stackoverflow.com/questions/5467174/how-to-implement-a-repeating-shuffle-thats-random-but-not-too-random, it is basic simple well know algorithm.
***some one already gave this answer - "Fisher–Yates shuffle"
It seems like the most obvious way would be to start with an array[54] containing 1..54, then shuffle that, and keep the first three values in it.
no need to shuffle all the array, just the first three items..
the most efficient way would be to implement "the random playlist algorithm" http://stackoverflow.com/questions/5467174/how-to-implement-a-repeating-shuffle-thats-random-but-not-too-random, it is basic simple well know algorithm.
***some one already gave this answer - "Fisher–Yates shuffle"
the most efficient way would be to implement "the random playlist algorithm" http://stackoverflow.com/questions/5467174/how-to-implement-a-repeating-shuffle-thats-random-but-not-too-random, it is basic simple well know algorithm.
***some one already gave this answer - "Fisher–Yates shuffle"
It seems like the most obvious way would be to start with an array[54] containing 1..54, then shuffle that, and keep the first three values in it.
no need to shuffle all the array, just the first three items..
the most efficient way would be to implement "the random playlist algorithm" http://stackoverflow.com/questions/5467174/how-to-implement-a-repeating-shuffle-thats-random-but-not-too-random, it is basic simple well know algorithm.
***some one already gave this answer - "Fisher–Yates shuffle"