>    restart; read`\c:/Users/Asus/Google Drive/Aek/CardShuffling/Shuffle.txt`;

>    # Example1

>    FastBestGuess(10,[6,1,3],4);

7

>    #Example 2

>    FastBestGuess(15,[1,12,5],4);

6

>    # Counter example to Bayer, Diaconis (1992) optimal strategy

>    FastBestGuess(10,[5],4);

1

>    # We can also try this program for 2 shuffles

>    BestGuess(10,[5]);

[31752, 6384, 6384, 2296, 0, 31570, 7280, 10080, 7280, 2310]

1

>