There is an interesting paper called The Truel. It is about 3 players A , B and C shooting under some rules.The two snippets of the pages relevant to my Question are given below, the full paper is given in the above link. My question is about the first tree, Length 1, Outcome AB. I do not follow how have arisen the outcomes in the first 5 edges in that tree 2 of them thin and next two thick and the last thin again. For the first edge A kills B and C kills A is clear. But now for the second edge A kills C why there is an outcome B; why B kills A as A is not his antagonist ? Also if A doesn't shoot (~) and B kills A why the remaining is C; i.e. the fifth edge. Which rule determines the remaining player if the shooter shoots as given ? I think that there are some concealed procedure behind the one who shoots whom which is displayed? I do not understand the rules of this.
2026-03-26 12:35:01.1774528501
An interesting game "The Truel"
136 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GAME-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- Perfect Information Game and Chance node
- Valid operations to the value of a matrix game
- Rook Game Problem Solving
- Proof of Axiom of Transparency in Aumman's model of knowledge
- Sion's MinMax theorem over matrices
- Can Zermelo's theorem be extended to a game which always has a winner?
- a risk lover agent behave as if risk natural.
- How to prove that a strategy profile is a Proper Equilibrium?
Related Questions in TREES
- Explanation for the static degree sort algorithm of Deo et al.
- Finding height of a $k$-ary tree
- Clique-width of a tree
- count "informative" paths in tree
- If the weight of edge E $e$ of an MST is decreased by $\delta$. Could total weight of MST decrease by more than $\delta$.
- Probability of two randomly selected leaves of a tree to be connected only at the root
- Proof in graph theory: maximum degree and number of leaves.
- Graph Theory: Number of vertices in a tree.
- The number of, and an enumeration for, the set of full subtrees of the full complete binary tree
- Is the maximum link length function convex?
Related Questions in COMBINATORIAL-GAME-THEORY
- Can Zermelo's theorem be extended to a game which always has a winner?
- Unrestricted Gomoku on a small board
- combinatorial game of sheets
- Analysis of a combinatorial game with prime numbers
- Even numbers combinatorial game
- Show that there exists at least one player who wins a trophy
- Tower Of Hanoi (4 Pegs)
- Queues and permutation/combination
- Maths strategy games
- Find number of solutions to special "Lights Out!" puzzle scenarios
Related Questions in DECISION-THEORY
- Generating cycles on a strongly connected graph
- Stochastic decision problem with normal distribution
- Is the halting problem also undecideable for turing machines always writing a $1$ on the tape?
- How to prove inadmissibility of a decision rule?
- Can the halting problem for bounded Turing machines be efficiently decided?
- Can these statements help to take above conclusion?
- How to prove an estimator is minimax
- Finding P(Error) in a Hypothesis Test for Population Mean $\mu$
- What are some natural ways to compare random variables?
- Maximum likelihood decision rule
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?


The players’ preferences are defined in Section $4$, “Perfect Marksmanship and Additional Goals”. The answer to both of your questions is that killing the antagonist is merely the tertiary goal – the primary goal is to survive, and the secondary goal is to kill as many opponents as possible. Thus, if a player’s antagonist is already dead but the other opponent is still alive, the player will kill the other opponent.