Number of ways a certain event will occur in a game

  • Thread starter Thread starter JimBob81345
  • Start date Start date
  • Tags Tags
    Game
Click For Summary
SUMMARY

The discussion focuses on calculating the number of valid arrangements of 2n people assigned numbers from 1 to x, where each number is assigned to exactly 2 people. The key condition is that after every round, the corner can contain at most 2 people. It is established that arrangements where two people with the same number are adjacent or separated by one person cannot satisfy this condition unless one is already in the corner. The analysis suggests starting with simple cases, such as 2 people with 1 number, to identify patterns that can be generalized for larger groups.

PREREQUISITES
  • Understanding of combinatorial mathematics
  • Familiarity with permutations and arrangements
  • Basic knowledge of probability theory
  • Experience with mathematical problem-solving techniques
NEXT STEPS
  • Explore combinatorial counting techniques for arrangements
  • Study the concept of derangements in permutations
  • Investigate the application of generating functions in combinatorial problems
  • Learn about recursive relations in combinatorial mathematics
USEFUL FOR

Mathematicians, game theorists, and anyone interested in combinatorial game design and analysis.

JimBob81345
Each of 2n people are assigned a number from 1 to x so that every number is assigned to exactly 2 people. The people are then arranged randomly in a line. Every round of the game, the person at the front of the line goes to the corner. If two people with the same number are in the corner, both people immediately exit the place and DO NOT go to the end of the line. The round ends after the two people exit the corner. Out of all the possible orderings of the people in a line, how many have the following property: After every round, the corner consists of at most 2 people.

My Work:
- If there are two people of the same number next to each other in the line, then the permutation of people cannot satisfy the previous condition unless one person is already in the corner.
- If there are 2 people of the same number one person apart, then the condition is not satisfied if a person is already in the corner.
 
Physics news on Phys.org
What can you say about the numbers in the row if the corner is empty after 2m people?
How many patterns can you find such that the corner is empty after 2m people but not before?
 
Start with some simple examples of the game and work through them. First with 2 people and 1 number (seems trivial but may give you some insight into a pattern for higher numbers), then with 4 people and 2 unique numbers. Then 6 people and 3 numbers. See if you can then figure out a general case.
 

Similar threads

Replies
3
Views
1K
Replies
4
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 23 ·
Replies
23
Views
3K
Replies
2
Views
4K
  • · Replies 8 ·
Replies
8
Views
2K
Replies
2
Views
2K