Intereting Posts

Showing something isn't a manifold
Properties of $x_k=\frac{a_{k+1}-a_{k}}{a_{k+1}}$ where $\{a_n\}$ is unbounded, strictly increasing sequence of positive reals
Can any smooth manifold be realized as the zero set of some polynomials?
How to prove a trigonometric identity
Are there parabolic and elliptical functions analogous to the circular and hyperbolic functions sin(h),cos(h), and tan(h)?
If $E \in \sigma(\mathcal{C})$ then there exists a countable subset $\mathcal{C}_0 \subseteq \mathcal{C}$ with $E \in \sigma(\mathcal{C}_0)$
Möbius map from circles to lines
Closed form solution for the zeros of an infinite sum
Expressing in the form $A \sin(x + c)$
If H ≤ Z(G) ≤ G, where G is a finite group,Z(G) is its center, and (G:H) = p for some prime p, then G is abelian.
Hypergeometric formulas for the Rogers-Ramanujan identities?
Newton's method for square roots 'jumps' through the continued fraction convergents
How do we find specific values of sin and cos given the series definition
Where's the error in this $2=1$ fake proof?
Primal- degenerate optimal, Dual – unique optimal

Let $G$ be an impartial combinatorial game. I claim that there is a game $G’$ such that $G$ (without terminal positions; see below) under the misère play rule is equivalent to $G’$ under the normal play rule. I wonder if this construction is already known and written down somewhere in the literature (so that I can cite it)? Any reference would be appreciated. Here is the construction of $G’$:

- The positions of $G’$ are the non-terminal positions of $G$.
- A move in $G’$ is a move in $G$ which does not lead to a terminal position of $G$.
- Hence, the terminal positions of $G’$ are those non-terminal positions of $G$ which only move to terminal positions of $G$, i.e. which have nimber $1$ under the normal play rule.

Then I think that $G$ wins/loses under the misère play rule iff $G’$ wins/loses under the normal play rule. Basically this just captures the following philosophy behind misère games: Try to avoid the terminal positions!

I am interested in this because of the following: I have read at various places that there are no nimbers for misère games. However, with the replacement of $G$ by $G’$ above, we can just define the nimber of a non-terminal position of $G$ to be the nimber of the corresponding position of $G’$ under the normal play rule. Terminal positions are boring, they get no nimber. As soon as we know them, we can discard them from the analysis of our misère game $G$. What’s wrong with that? This has been applied in the game of noetherian rings.

- Reference for combinatorial game theory.
- In the card came “Projective Set”, show that 7 cards do always contain a set.
- Name for a certain “product game”
- Trying to find the name of this Nim variant
- Prime Numbers and a Two-Player Game
- Extending Conway Games to $n$ players

- Need good material on multifractal analysis
- What kind of book would show where the inspiration for the Laplace transform came from?
- Notation to work with vector-valued differential forms
- Approximating roots of the truncated Taylor series of $\exp$ by values of the Lambert W function
- What is the modern axiomatization of (Euclidean) plane geometry?
- Strength of the statement “$\mathbb R$ has a Hamel basis over $\mathbb Q$”
- Good books on conic section.
- Where can I learn about complex differential forms?
- General Steinitz exchange lemma
- A game on a graph

The misère Grundy number is defined almost exactly as you have defined the “nimber for misère games”: terminal positions get misère Grundy number $1$, and all others get the mex (minimal excludant) of the options’ misère Grundy numbers, as usual (so that positions that can only move to terminal positions have misère Grundy number $\mathrm{mex}(\{1\})=0$). This can be found in Meghan Rose Allen’s MSc thesis at http://miseregames.org/docs/meghan.pdf , as well as in On Numbers and Games, and perhaps Winning Ways for your Mathematical Plays as well.

Why then, have you found the claim that there are “no nimbers for misère games”? Because unlike in the normal play case, these misère Grundy numbers don’t tell you nearly enough information for how to play sums with all sorts of games under misère play. They don’t even tell you enough to play misère Nim! Two heaps of size $2$ (call the position $G$) has misère Grundy number $0$, and so does a single heap of size $1$. But $G+G$ is a $\mathcal{P}$ position, whereas $1+1$ is a $\mathcal{N}$ position under misère play.

You also asked for a reference for something like your $G’$ construction. I think the closest standard object to what you are looking for is the “mate” of $G$, denoted by $G^-$. It is defined by: $$G^{-}=\begin{cases}

\left\{ \emptyset\right\} & \text{ if }G\cong\emptyset\text{;}\\

\left\{ \left(G’\right)^{-}:G’\in G\right\} & \text{ otherwise}.

\end{cases}$$

For references, you can find this as definition V.3.1 of Aaron N. Siegel’s “Combinatorial Game Theory”. It can also be found in “On Numbers and Games” (check the index for “mate”).

- Show that $\gcd\left(\frac{a^n-b^n}{a-b},a-b\right)=\gcd(n d^{n-1},a-b)$
- Can we introduce new operations that make quintics solvable?
- If $T:X \to Y$ is a linear homeomorphism, is its adjoint $T^*$ a linear homeomorphism?
- Combinatorial proof of $\binom{3n}{n} \frac{2}{3n-1}$ as the answer to a coin-flipping problem
- Probability of having a Girl
- What is the value of $\int_0^1 \frac{\arctan x}{1+x^{2}} dx$?
- Diagonalization of a projection
- Axiom of choice confusion: what does it mean an element to have no distinguishing features?
- $\int_{-\infty}^{\infty}{e^x+1\over (e^x-x+1)^2+\pi^2}\mathrm dx=\int_{-\infty}^{\infty}{e^x+1\over (e^x+x+1)^2+\pi^2}\mathrm dx=1$
- 30 positive integers
- How find $a_{n}$ if the sequence $a_{n}=2a_{n-1}+(2n-1)^2a_{n-2},n\ge 1$
- Can we make $\tan(x)$ arbitrarily close to an integer when $x\in \mathbb{Z}$?
- Higher dimensional analogues of the argument principle?
- Does maximal Cohen-Macaulay modules localize?
- What is the quotient ring $\Bbb Z/(2x-3)$?