<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Genus_theory</id>
	<title>Genus theory - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Genus_theory"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Genus_theory&amp;action=history"/>
	<updated>2026-06-02T02:16:12Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=Genus_theory&amp;diff=7954736&amp;oldid=prev</id>
		<title>imported&gt;Tc14Hd: Added short description</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Genus_theory&amp;diff=7954736&amp;oldid=prev"/>
		<updated>2024-07-24T13:31:14Z</updated>

		<summary type="html">&lt;p&gt;Added short description&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Short description|Mathematical theory of misère games}}&lt;br /&gt;
{{multiple issues|&lt;br /&gt;
{{confusing|date=March 2009}}&lt;br /&gt;
{{more citations needed|date=January 2019}}}}&lt;br /&gt;
&lt;br /&gt;
In the mathematical [[game theory|theory of games]], &amp;#039;&amp;#039;&amp;#039;genus theory&amp;#039;&amp;#039;&amp;#039; in [[impartial game]]s is a theory by which some games played under the [[misère play convention]] can be analysed, to predict the [[outcome (game theory)|outcome]] class of games.&lt;br /&gt;
&lt;br /&gt;
Genus theory was first published in the book &amp;#039;&amp;#039;[[On Numbers and Games]]&amp;#039;&amp;#039;, and later in &amp;#039;&amp;#039;[[Winning Ways for your Mathematical Plays]]&amp;#039;&amp;#039; Volume 2.&lt;br /&gt;
&lt;br /&gt;
Unlike the [[Sprague–Grundy theorem|Sprague–Grundy theory]] for normal play impartial games, genus theory is not a complete theory for misère play impartial games.&lt;br /&gt;
&lt;br /&gt;
==Genus of a game==&lt;br /&gt;
The genus of a game is defined using the [[Mex (mathematics)|mex]] (minimum excludant) of the options of a game.&lt;br /&gt;
&lt;br /&gt;
g+ is the grundy value or [[nimber]] of a game under the normal play convention.&lt;br /&gt;
&lt;br /&gt;
g- or &amp;#039;&amp;#039;λ&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;0&amp;lt;/sub&amp;gt; is the outcome class of a game under the misère play convention.&lt;br /&gt;
&lt;br /&gt;
More specifically, to find g+, *0 is defined to have g+ = 0, and all other games have g+ equal to the mex of its options.&lt;br /&gt;
&lt;br /&gt;
To find g−, *0 has g− = 1, and all other games have g− equal to the mex of the g− of its options.&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;λ&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;, &amp;#039;&amp;#039;λ&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;..., is equal to the g− value of a game added to a number of *2 nim games, where the number is equal to the subscript.&lt;br /&gt;
&lt;br /&gt;
Thus the genus of a game is g&amp;lt;sup&amp;gt;&amp;#039;&amp;#039;λ&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;0&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039;λ&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;1&amp;lt;/sub&amp;gt;&amp;#039;&amp;#039;λ&amp;#039;&amp;#039;&amp;lt;sub&amp;gt;2&amp;lt;/sub&amp;gt;...&amp;lt;/sup&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
&amp;lt;nowiki&amp;gt;*&amp;lt;/nowiki&amp;gt;0 has genus value 0&amp;lt;sup&amp;gt;120&amp;lt;/sup&amp;gt;. Note that the superscript continues indefinitely, but in practice, a superscript is written with a finite number of digits, because it can be proven that eventually, the last 2 digits alternate indefinitely...&lt;br /&gt;
&lt;br /&gt;
==Outcomes of sums of games==&lt;br /&gt;
It can be used to predict the outcome of:&lt;br /&gt;
* The sum of any nimbers and any tame games&lt;br /&gt;
* The sum of any one game given its genus, any number of nim games *1, *2 or *3, and optionally one other nim game with nimber 4 or higher&lt;br /&gt;
* The sum of a restive game and any number of nim games of any size&lt;br /&gt;
&amp;lt;!-- These points can be found listed in Winning Ways --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
In addition, some restive or restless pairs can form tame games, if they are equivalent. Two games are equivalent if they have the same options, where the same options are defined as options to equivalent games. Adding an option from which there is a reversible move does not affect equivalency.&lt;br /&gt;
&lt;br /&gt;
Some restive pairs, when added to another restive game of the same species, are still tame.&lt;br /&gt;
&lt;br /&gt;
A half tame game, added to itself, is equivalent to *0.&lt;br /&gt;
&lt;br /&gt;
==Reversible moves==&lt;br /&gt;
It is important for further understanding of Genus theory, to know how reversible moves work. Suppose there are two games A and B, where A and B have the same options (moves available), then they are of course, equivalent.&lt;br /&gt;
&lt;br /&gt;
If B has an extra option, say to a game X, then A and B are still equivalent if there is a move from X to A.&lt;br /&gt;
&lt;br /&gt;
That is, B is the same as A in every way, except for an extra move (X), which can be reversed.&lt;br /&gt;
&lt;br /&gt;
==Types of games==&lt;br /&gt;
Different games (positions) can be classified into several types:&lt;br /&gt;
* Nim&lt;br /&gt;
* Tame&lt;br /&gt;
* Restive&lt;br /&gt;
* Restless&lt;br /&gt;
* Half tame&lt;br /&gt;
* Wild&lt;br /&gt;
&lt;br /&gt;
===Nim===&lt;br /&gt;
This does not mean that a position is exactly like a nim heap under the misère play convention, but classifying a game as nim means that it is equivalent to a nim heap.&lt;br /&gt;
&amp;lt;!-- Note that this is not a classification explicitly mentioned in Winning Ways, however, it can be deduced by following that games which do not look like nim, but has the exact same game tree as a nim heap, is in every sense, a nim heap anyways. [[User:Ronald Ping Man Chan|Ronald Ping Man Chan]] ([[User talk:Ronald Ping Man Chan|talk]]) 04:55, 8 March 2009 (UTC)--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
A game is a nim game, if:&lt;br /&gt;
* it has a genus 0&amp;lt;sup&amp;gt;1&amp;lt;/sup&amp;gt;, 1&amp;lt;sup&amp;gt;0&amp;lt;/sup&amp;gt;, 2&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;, 3&amp;lt;sup&amp;gt;3&amp;lt;/sup&amp;gt;...&lt;br /&gt;
* it has moves only to single nim heaps, i.e. move to a position *1, or *2, but not e.g. *x+*y (but see next point)&lt;br /&gt;
* it may also have moves to games which are not nim, provided they are not required to determine the genus, and those games each have at least one option to a nim game of the same genus&lt;br /&gt;
&amp;lt;!-- While the first two points are obviously correct immediately (look at previous comment on same game tree), the 3rd point which modifies the 2nd point, I have added even though Winning Ways does not mention it to the point where one may say that the 3rd point cannot be found from Winning Ways. However, I have added that point, because, the same point (on reversible moves) is found for the tame classification, and explicitly stated. It so happens that the 3rd point applies here. And because reversible moves is explicitly stated as a valid simplification, I have included it here (ie, by using reversible move simplification, if the first 2 points are correct, so is the 3rd). Please discuss this before deleting. [[User:Ronald Ping Man Chan|Ronald Ping Man Chan]] ([[User talk:Ronald Ping Man Chan|talk]]) 04:55, 8 March 2009 (UTC) --&amp;gt;&lt;br /&gt;
&lt;br /&gt;
===Tame===&lt;br /&gt;
These are positions which we can pretend are nim positions (note difference between nim positions, which can be many nim heaps added together, and a single nim heap, which can only be 1 nim heap). A game G is tame if:&lt;br /&gt;
* it has a genus 0&amp;lt;sup&amp;gt;1&amp;lt;/sup&amp;gt;, 1&amp;lt;sup&amp;gt;0&amp;lt;/sup&amp;gt;, or 0&amp;lt;sup&amp;gt;0&amp;lt;/sup&amp;gt;, 1&amp;lt;sup&amp;gt;1&amp;lt;/sup&amp;gt;, 2&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;, 3&amp;lt;sup&amp;gt;3&amp;lt;/sup&amp;gt;...&lt;br /&gt;
* all options of G are tame&lt;br /&gt;
* G may also have wild options (positions which are not tame or nim) if they do not affect the genus, and each option have reversible moves to tame games with genus g&amp;lt;sup&amp;gt;?&amp;lt;/sup&amp;gt; and ?&amp;lt;sup&amp;gt;&amp;#039;&amp;#039;λ&amp;#039;&amp;#039;&amp;lt;/sup&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
Note the moves to g&amp;lt;sup&amp;gt;?&amp;lt;/sup&amp;gt; and ?&amp;lt;sup&amp;gt;&amp;#039;&amp;#039;λ&amp;#039;&amp;#039;&amp;lt;/sup&amp;gt; may actually be the same option. ? means any number.&lt;br /&gt;
&amp;lt;!-- Now this section definitely shouldn&amp;#039;t be deleted, these conditions can be found in Winning Ways --&amp;gt;&lt;br /&gt;
&amp;lt;!--&lt;br /&gt;
Sections to be added, but I can&amp;#039;t be bothered adding them right now, if nobody adds them, I will eventually add them when I feel like it. ~~~~&lt;br /&gt;
===Restive===&lt;br /&gt;
===Restless===&lt;br /&gt;
===Half tame===&lt;br /&gt;
--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
* [[Indistinguishability quotient]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
* &amp;#039;&amp;#039;[[On Numbers and Games]]&amp;#039;&amp;#039; by [[John Horton Conway]]&lt;br /&gt;
* &amp;#039;&amp;#039;[[Winning Ways for Your Mathematical Plays]]&amp;#039;&amp;#039; by Elwyn Berlekamp, John Conway and [[Richard K. Guy|Richard Guy]].&lt;br /&gt;
&lt;br /&gt;
[[Category:Combinatorial game theory]]&lt;/div&gt;</summary>
		<author><name>imported&gt;Tc14Hd</name></author>
	</entry>
</feed>