Computations Using Playing Cards

In summary, the conversation discussed the possibility of using playing cards as a means of performing computations, inspired by John Conway's "Game of Life". The potential for creating an automaton system with playing cards was explored, with the challenge to devise a sorting algorithm that displays negative entropy and does not tend to disorder. An example solution was provided, using two suits to sort a deck by color. The conversation also clarified that the site is for volunteers to help students with mainstream STEM questions, not for discussing speculative science topics or personal theories. Another potential solution for sorting playing cards was suggested, involving reserving space for 104 piles and dealing cards in a specific order.
  • #1
libervurto
6
4
EXPLORING THE POSSIBILITY OF PERFORMING COMPUTATIONS WITH PLAYING CARDS

I was listening to an interview with John Conway yesterday and the conversation turned to his "Game of Life". Conway mentioned that Life can be configured in such a way that it can perform arbitrary computations. This got me thinking about what other seemingly inanimate things can be given a sense of "Life" to and made to behave like automata that could potentially be used to perform computations.

In the same interview, Conway also spoke about a card game he played with his old professor, Besicovitch. I grabbed a deck of cards and made a few google searches to find rules for "Besicovitch's Game" but soon got distracted when I realized I'd just picked up a very good candidate for an automaton. The potential for such a system is intriguing: imagine playing a physical card game against an AI deck.

The first thing I decided to try was to devise a sorting algorithm, it seems to me that if a deck of cards can be automatically sorted into arbitrary, discrete configurations then computation should possible.

I set up a few basic rules for my algorithm to ensure the human component was simply following instructions and not influencing the sorting process. I decided to restrict myself to a "blind" sorting algorithm: the next action only being influenced by the previous card dealt. If I didn't specify this restriction I could have just looked at each card as it was dealt and sorted by eye, which is not interesting.

I spent a good few hours performing some very odd and largely useless operations on the cards, because I had no idea what might have a useful effect and what wouldn't. Eventually I hit upon an algorithm that worked! (Well, there is a single case where it does not work but that's good enough for a proof of concept in my eyes.)

I challenge you all to devise a sorting algorithm that works better than mine.HOW CAN REGULAR PLAYING CARDS BE "SELF-SORTED"?

A curious challenge! Devise an algorithm to automatically sort a deck of cards (or into suits or divide by colour) with the following limitations:

+ Starting with a thoroughly shuffled deck, your algorithm must sort by colour/suit/value or any combination of these.
+ Your algorithm must display negative entropy, that is, it tends towards a sorted state, and once sorted does not tend to disorder.
+ You may split the deck into multiple decks if you wish.
+ You may deal the cards face-up into one or more piles.
+ You must determine where a card is to be dealt BEFORE dealing it; you must not relocate cards after they have been dealt.
+ You may count the number of cards split or dealt.
+ To provide logic to your algorithm, you may use two types of input to trigger conditional operations: the colour/suit/value of the previously dealt card, and the depletion of a deck.EXAMPLE SOLUTION TO SORT A DECK BY COLOUR (using two suits)
(unfortunately doesn't work if bottom card is red)

1. Split the deck exactly in half to create left and right decks.
2. If this is the first iteration, the starting deck is the left deck.
3. Deal a card from the starting deck face up into the central pile.
4. If the previous card dealt was red, deal a card from the left deck as before, else deal a card from the right deck.
5. Repeat the previous step until one of the decks has been depleated.
6. If only the left deck remains, turn over the central pile and place the left deck on top of it. The left deck is the starting deck.
7. If only the right deck remains, turn over the central pile and place it on top of the right deck. The right deck is the starting deck.
8. Repeat the first step.
 
Computer science news on Phys.org
  • #2
Welcome to PF!

What are you expecting from this site?

We are a group of volunteers who help students with questions from mainstream STEM subjects. We don't discuss speculative science topics or personal theories here.

Are you expecting us to peer review your original work?
 
  • #3
  • #4
Horribly inefficient, but working: Reserve space for 104 piles, they are later picked up in that order (e. g. the bottom card of pile 1 becomes the bottom card of the final combined stack). Deal the first card on pile 2. If it is not the first card in your sorting order, deal all remaining cards on pile 1. If it is the first card, deal the next card on pile 4. If it is not the second card in your sorting order, deal all remaining cards on pile 3. If it is the second card, deal the next card on pile 6, and so on.

If your pile is sorted, you get your cards on all even piles in the right order. If a card doesn't fit to the sorting order, it is moved to the back while the first N sorted cards stay sorted.
 

1. How can playing cards be used for computations?

Playing cards can be used for computations by assigning numerical values to each card and using them as variables in equations. For example, the ace can represent a value of 1, the face cards can represent values of 11, 12, and 13, and the numbered cards can represent their corresponding values. These values can then be used in various mathematical operations.

2. Can playing cards be used for complex computations?

Yes, playing cards can be used for complex computations by using multiple cards to represent larger numbers or by combining different mathematical operations. For instance, using a combination of addition, subtraction, multiplication, and division, playing cards can be used to solve algebraic equations.

3. Are there any limitations to using playing cards for computations?

There are some limitations to using playing cards for computations. For instance, the numerical values assigned to each card are subjective and can vary depending on the individual. Also, playing cards may not be suitable for computations involving decimals or fractions.

4. How accurate are computations using playing cards?

The accuracy of computations using playing cards depends on the accuracy of the values assigned to each card and the precision of the mathematical operations used. With careful assignment of values and proper use of operations, computations using playing cards can be just as accurate as traditional methods.

5. Are there any practical applications of computations using playing cards?

Yes, there are practical applications of computations using playing cards. Some card games, such as Blackjack, involve computations using playing cards. Additionally, this method can be used as a fun and engaging way to teach mathematical concepts to students.

Similar threads

Replies
17
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
2K
  • Programming and Computer Science
Replies
7
Views
7K
Replies
15
Views
6K
  • Precalculus Mathematics Homework Help
Replies
4
Views
2K
  • Programming and Computer Science
Replies
29
Views
2K
Replies
29
Views
4K
  • Set Theory, Logic, Probability, Statistics
Replies
17
Views
7K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
2K
Back
Top