Intereting Posts

Existence of increasing sequence $\{x_n\}\subset S$ with $\lim_{n\to\infty}x_n=\sup S$
Conditional probabilties in the OR-gate $T=A\cdot B$ with zero-probabilities in $A$ and $B$?
Polynomial rings in an arbitrary set of indeterminates
Integrate $\int_0^\pi{{x\sin x}\over{1+\cos^2x}}dx$.
Can someone explain Cayley's Theorem step by step?
Using Modularity Theorem and Ribet's Theorem to disprove existence of rational solutions
Difference between “Show” and “Prove”
space of bounded measurable functions
Cancelling matrices
Help me put these enormous numbers in order: googol, googol-plex-bang, googol-stack and so on
Ring of Polynomials is a Principal Ideal Ring implies Coefficient Ring is a Field?
Proof of Dedekind's Theorem on the Galois Groups of rational polynomials
What software is used to draw undirected graphs?
number of pairs formed from $2n$ people sitting in a circle
Polynomials irreducible over $\mathbb{Q}$ but reducible over $\mathbb{F}_p$ for every prime $p$

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.

- Ring structure on subsets of the natural numbers
- The Ring Game on $K$
- Placing stones on vertices of polygon
- Sharing a pepperoni pizza with your worst enemy
- A Tic-Tac-Toe Variant
- In the card came “Projective Set”, show that 7 cards do always contain a set.

- What are $E_\infty$-rings?
- Does $i^i$ and $i^{1\over e}$ have more than one root in $$
- Is there an introduction to probability and statistics that balances frequentist and bayesian views?
- Continued fraction for $c= \sum_{k=0}^\infty \frac 1{2^{2^k}} $ - is there a systematic expression?
- Convergence in distribution of conditional expectations
- Reference request: algebraic methods in geometry
- What was the book that opened your mind to the beauty of mathematics?
- The graph of the function $f(x)= \left\{ \frac{1}{2 x} \right\}- \frac{1}{2}\left\{ \frac{1}{x} \right\} $ for $0<x<1$
- Learning Combinatorial Species.
- What's a good book on advanced linear algebra?

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”).

- For integers $n \neq 0$ is $\sin n$ irrational or transcendental?
- Beautiful, simple proofs worthy of writing on this beautiful glass door
- Analytic method for determining if a function is one-to-one
- Exponential function properties for rational numbers.
- Is there a function with infinite integral on every interval?
- Discrete non archimedean valued field with infinite residue field
- The geometric interpretation for extension of ideals?
- Irreducibility in $\mathbb{F_2}$ and field extensions
- Disprove the Twin Prime Conjecture for Exotic Primes
- Is the empty graph connected?
- Classifying complex $2\times 2$ matrices up to similarity
- drawing at least 90% of colors from urn with large populations
- How to show that $\sum\limits_{k=1}^{n-1}\frac{k!k^{n-k}}{n!}$ is asymptotically $\sqrt{\frac{\pi n}{2}}$?
- Is the submodule of a finitely generated free module finitely generated?
- Prob. 4, Chap. 4 in Baby Rudin: A continuous image of a dense subset is dense in the range.