Below is a table showing patterns of Faro shuffles that will move a playing card from one location to another in a deck of 52 playing cards. This table was generated using the formulas in the paper “The Solutions to Elmsley’s Problem” by Persi Diaconis and Ron Graham (The Solutions to Elmsley’s Problem – Stanford University ).
Continue reading “Faro Shuffle table for moving any card to any location”Faro Table for moving cards from and to the top
In writing the Faro Simulator I used formulas for generating the in and out shuffle patterns needed to move cards from and to the top of the deck. These patterns can be seen when using the simulator but I thought it would be useful to see them all in a table.
Continue reading “Faro Table for moving cards from and to the top”Faro Shuffle Simulator
I have written a simple faro shuffle simulator which you can access here: https://robertjwallace.com///faro
It supports some common stacks and I will be adding more as time permits. Instructions are below.
Continue reading “Faro Shuffle Simulator”Faro Shuffle Tutorial
The Faro shuffle is a shuffling technique that causes two packets of cards to interleave perfectly. That is to say that only one card at a time from each packet is released, alternating with one card from the other packet. It is a semi-automatic technique, meaning that when properly executed the cards weave together without any effort by the individual doing the shuffle. That said, it is a technique that an individual must master with factors such as the conditions of the cards, the grip of the packets, pressure and angles are also playing a role.
Continue reading “Faro Shuffle Tutorial”