[Problem Solving] See if you can answer my question.

  • Context: Undergrad 
  • Thread starter Thread starter Albert C
  • Start date Start date
  • Tags Tags
    Problem solving
Click For Summary

Discussion Overview

The discussion revolves around a hypothetical game involving two subjects (SUBJECT 1 and SUBJECT 2) who take turns hitting each other to reduce their points from 990 to 0. The mechanics of the game, including the possibility of cheating and the implications of player advantage, are explored. Participants question the game's design and seek clarification on its rules and dynamics.

Discussion Character

  • Debate/contested
  • Conceptual clarification
  • Exploratory

Main Points Raised

  • Some participants express confusion about the game's mechanics, particularly regarding how players hit numbers and whether they know each other's numbers.
  • One participant suggests that the only way to gain an advantage is to always play as SUBJECT 1, who has the first turn.
  • Another participant questions the game's design, noting that if players can hit the maximum points every time, it reduces the game's competitiveness.
  • There is a suggestion that if both players share a single set of points, the strategy changes significantly, but it still may not improve the game.
  • Participants inquire about the possibility of hitting the same number multiple times and whether the game allows for such repetition.
  • Concerns are raised about the clarity of who plays first and how cheating is defined and controlled within the game.
  • Some participants express skepticism about the game's enjoyment factor and its overall design.

Areas of Agreement / Disagreement

Participants generally disagree on the clarity and fairness of the game mechanics, with multiple competing views on how the game should function and whether it is well-designed. The discussion remains unresolved regarding the optimal strategies and the implications of player advantage.

Contextual Notes

Limitations include unclear rules about player turns, the nature of cheating, and the randomness of number selection. These factors contribute to the uncertainty in assessing the game's strategy and fairness.

Albert C
Messages
4
Reaction score
0
Here we go.

Lets say SUBJECT 1 and SUBJECT 2 have a fight. They both have 990 Points. Each SUBJECT can hit a number from nothing (0) to 112. And they both take turns evenly. Let's say SUBJECT 1 starts to hit a number first and hits 20. Then the Subject 2 would be (990-20)= 970. And they all take turns until one of them gets to 0 points, and then the person who gets to 0 points first loses.

Get it still?

Now there is thing where SUBJECT 1 cheats and can always hit a number first before SUBJECT B. Let's call that PA (Player Advantage).
_______________________________________________________________________________
Now there are times where SUBJECT 1 and 2 can hit numbers at the same time so their points get deducted at the same time.
My question is: Is there any way to have a advantage to win the most out of 10?
They do not know which number they are going to hit.
 
Last edited:
Mathematics news on Phys.org
Your question doesn't seem to make any sense.
 
Hey Albert C and welcome to the forums.

You should make your statements more specific by saying how the game is played in terms of dynamics. Does each player know the others number or not (like in Battleships)? Is the number generated at random or not at random? Does each player have to wait until the other has taken a turn?

You need to outline these things before you can get a specific answer.
 
Albert C said:
My question is: Is there any way to have a advantage to win the most out of 10?
Well from what you've told us, the only way to have an advantage is to always play as "subject 1".
 
Albert C said:
Lets say SUBJECT 1 and SUBJECT 2 have a fight.
...
SUBJECT 1 cheats and can always hit a number first before SUBJECT B.

Subject 1 should be allowed to cheat since he's taking on 2 opponents!
 
Albert C said:
Here we go.

Lets say SUBJECT 1 and SUBJECT 2 have a fight. They both have 990 Points. Each SUBJECT can hit a number from nothing (0) to 112. And they both take turns evenly. Let's say SUBJECT 1 starts to hit a number first and hits 20. Then the Subject 2 would be (990-20)= 970. And they all take turns until one of them gets to 0 points, and then the person who gets to 0 points first loses.

Get it still?

Now there is thing where SUBJECT 1 cheats and can always hit a number first before SUBJECT B. Let's call that PA (Player Advantage).
_______________________________________________________________________________
Now there are times where SUBJECT 1 and 2 can hit numbers at the same time so their points get deducted at the same time.



My question is: Is there any way to have a advantage to win the most out of 10?

acabus said:
Your question doesn't seem to make any sense.
I agree. What does it mean to "hit a number?"
 
If they both have 990 points each, and they hit the other player's points, it seems to me you should just hit the max points possible every time. Of course this is not much of a game since the first player always wins.

However, the game is better if they share one set of 990 points. But then, it's still not great because as soon as you get to 224 points or less, the strategy should be to keep the points above 112. When that is reached, the next player just takes out the rest of the points and the other loses.

Question, can you hit the same number more than once?

This game doesn't seem particularly well designed.
 
ArcanaNoir said:
If they both have 990 points each, and they hit the other player's points, it seems to me you should just hit the max points possible every time. Of course this is not much of a game since the first player always wins.

However, the game is better if they share one set of 990 points. But then, it's still not great because as soon as you get to 224 points or less, the strategy should be to keep the points above 112. When that is reached, the next player just takes out the rest of the points and the other loses.

Question, can you hit the same number more than once?

This game doesn't seem particularly well designed.
No no, you cannot choose which number to hit, it is randomly generated.
And they both have 990 Points.
 
It still isn't clear what controls who gets to play when. Who starts? If cheating is possible, what form does this take and what is there to prevent it? Why wouldn't a player always cheat? It seems obvious that a player should always endeavour to strike first.
 
  • #10
If you can't choose the number, then is the only choice who gets to be player one?
 
  • #11
Indeed... Doesn't sound like an enjoyable game :confused:
 
  • #12
OP, if you give us the name to this game we could take a look at it on youtube or something to get a better feel for what we're dealing with.
 

Similar threads

Undergrad Find an explicit formula for this n-sum problem
  • · Replies 7 ·
Replies
7
Views
3K
High School Can you solve this geometry problem for nine year olds?
  • · Replies 30 ·
2
Replies
30
Views
11K
Undergrad Alternating Harmonic Numbers are cool, spread the word!
  • · Replies 4 ·
Replies
4
Views
3K
Undergrad What is the role of geometry and dimensional operations?
  • · Replies 3 ·
Replies
3
Views
2K
Graduate About a natural extension of Collatz conjecture
  • · Replies 3 ·
Replies
3
Views
1K
Undergrad Optimization problem with multiple outputs: impossible?
  • · Replies 6 ·
Replies
6
Views
3K
Undergrad Solving simultaneous vector equations
  • · Replies 11 ·
Replies
11
Views
3K
Undergrad Interception problem with curve (computer simulation)
  • · Replies 9 ·
Replies
9
Views
2K
Undergrad Questions regarding Kurepa's Conjecture
  • · Replies 1 ·
Replies
1
Views
3K
High School A symmetric problem has an asymmetric solution - why?
  • · Replies 21 ·
Replies
21
Views
3K