Talk:Faro shuffle

Derivation?

Why is it called a "faro" shuffle? Is that a name? The saint? -- Vonfraginoff 08:04, 23 September 2007 (UTC)

::after the game of faro maybe? Good question! Legotech (talk) 21:58, 4 January 2008 (UTC)

Most likely, after the game of Faro. Also note that perfect faro shuffles can be used to stack the deck while appearing completely honest. The better you were at the faro shuffle, the better you were at fleecing people without anyone being able to prove it. A skilled dealer would be able to keep track of which cards were where, and pick a pattern of shuffling designed to move extra pairs together. 2603:3006:1081:1C00:C1C9:DE9A:C8B7:D75 (talk) 20:25, 21 March 2020 (UTC)

Yes this is why the faro shuffle is used in Faro, and was named after is. By perfect in and out shuffles, you can bring more pairs together over the course of your playing. Note that a single perfect faro shuffle will bring every single pair right back together. following with 8 more in shuffles will keep them all together Once you have got yourself a pair rich deck, you can then keep it. Once it's set up, you can do as many cuts and overhand shuffles as you want. provided that you can pull down an even number of cards every time. then you do one final odd cut, to account for soda (the burned card). The overhand shuffle mixes up the order of the pairs, so its not obvious at all that you have a cold deck. And when people complain that they think it's rigged, you then do an ODD cut first, and then some overhand shuffles to break up many of the pairs (and maybe create some new ones). And as near as anyone can tell, you did nothing different. It's brilliant. 73.151.32.230 (talk) 05:54, 6 July 2024 (UTC)

Computer Science Aspects

This section is a waste of electrons. The only information that it contributes is that the faro shuffle is not a sorting algorithm. But since the point of shuffling is the very opposite of sorting, there is no reason to even think that the faro shuffle is a sorting algorithm. Describe what it is, not what it is not. Then space is wasted by giving not one, not two, but three coded implementations. It is completely baffling what the purpose of this is, but even if there were a purpose, certainly one implementation would be sufficient.

Also, nobody writes "computer science" with a hyphen.

2602:306:CEAE:E60:1171:BCB0:70FE:8FC0 (talk) 10:37, 24 November 2015 (UTC)

The Faro Shuffle is used almost exclusively by magicians, card mechanics, and the like. Though I agree with you in that we don't need the python, perl and perl 6 codes at all (not even sure if 1 person would find even 1 of them useful). 58.211.126.66 (talk) 09:07, 23 October 2016 (UTC)

Merge proposal

The "in shuffle" and "out shuffle" articles describe two possible forms of Faro shuffle. Both articles are very short and similar; they could be merged to "in and out shuffles", but may as well be merged here, I think. --Lord Belbury (talk) 13:01, 9 December 2019 (UTC)

  Y Merger complete. Klbrain (talk) 15:07, 30 October 2020 (UTC)

Citation for Alex Emsley

The current version reads "Magician Alex Elmsley discovered (...)" and "citation needed". I found a citation in https://books.google.nl/books?id=KEBloTvsjPIC&pg=PA4&hl=nl&source=gbs_selected_pages&cad=2#v=onepage&q&f=false. The book is called "Magic Tricks, Card Shuffling and Dynamic Computer Memories". On page 31, it reads: "Corollary 2.7 gives magicians a clever way of moving the top card to any location in a deck. A version of Corollary 2.7 was first stated (without proof) by Alex Elmsley in his "Work in Progress."". If this citation is good enough, can someone add it to the page? 2001:1C01:4206:9A00:C893:841C:3AC9:EEBE (talk) 19:58, 30 June 2022 (UTC)