An Exploration of the Theoretical Support of the 24 Game

753 Words2 Pages

Mathematical Exploration: The 24 game An exploration of the theoretical support of the 24 game An introduction to the 24 game: Overview: The 24 game is a mathematical card game which originated from China in the 1960s and popularized in China and America later. It is a game which required its players to make fast calculations, and it can be competitive. After years of spreading and development, the game has derived into a lot of different rules. In this research paper, the topic is mainly focused on the original rule. Rules: In 24 game, the players are using a standard card deck where the jokers are eliminated from the card deck. By randomly selecting 4 cards from the 52 card deck, the players need to make a result of 24 by using addition, subtraction, multiplication and division. In the game, the card 2-10 represent numbers 2-10, A represent 1 and J, Q, K represents numbers 11, 12, 13. Every card has to be used and only could be used once. For example: A, A, 4, Q (1, 1, 4, 12) can be calculated as [4 - (1 + 1)] × 12 to get a result of 24. Generally, there are multiple ways of solving a 24 game question, however, questions with a unique answer or unsolvable questions are also exist. Fraction calculation: Usually in the game, only integers are used to make a result of 24. However, in some difficult 24 game questions, fraction calculation is required. For example: 2, 5, 5, 10 can be calculated as (5 − 2 ÷ 10) × 5 which is 24 over 5 multiplied by 5. Rationale: Reasons for 24 is chosen as the result of the calculation: The reason for 24 is chosen as the result of the instead of other numbers is because between 1-30, 24 has the most factors, 1, 2, 4, 6, 8, 12, 24. While other numbers such as 22, 23, or 17, 18 ... ... middle of paper ... ..., c, b, a) There are two ways in total of the 3 steps calculating: Let ⋇ represents +, -, ×, ÷ 1. [ ( a ⋇ b ) ⋇ c ] ⋇ d 2. ( a ⋇ b ) ⋇ ( c ⋇ d ) By calculating the 24 permutations above, and swap ⋇ with +, -, ×, ÷, it is possible for a computer program to obtain and record every unsolvable combinations. According to the data, there are 458 unsolvable combinations out of the total 1820 results. Hence, the probability of a random picked combination that can be solved is ((1820-458))/1820 × 100%≈ 74.84% However, the result above is only the theoretic result. Although in the game, suits do not matter, in realistic calculation the change in suits has to be counted. A study of the unsolvable question 4 cards 3 same 1 different 2 same 2 different 2 same the other 2 same 4 different Total Unsolvable Questions 8 70 33 239 108 458

More about An Exploration of the Theoretical Support of the 24 Game

Open Document