Combinatorial Game Theory
who wins, and by how much
Generator

End-Nim: a player at each end of the row

End-Nim: a player at each end of the row
End-Nim: a player at each end of the row. Rows of heaps in which Left may take from the leftmost heap and Right from the rightmost. The value beside each row was computed by the game recursion and reduced to canonical form; the outcome beside it says who wins. A single heap is a Nim heap, because both players may take from it — and that is the last thing about this game that looks like Nim.

Rows of heaps in which Left may take from the leftmost heap and Right from the rightmost. The value beside each row was computed by the game recursion and reduced to canonical form; the outcome beside it says who wins. A single heap is a Nim heap, because both players may take from it — and that is the last thing about this game that looks like Nim.

4 essays call endnim-row. The drawing above is what it returns with no arguments at all; every call below passes it something, because a placement that passes nothing draws whichever member of the family the generator happens to default to rather than the one its essay argues about.

The positions it draws

25 distinct positions, harvested by running this generator again at the options each essay passed it.

PositionWorth OutcomeDrawn in
1 ∗ N Taking from the ends
1, 1 0 P Taking from the ends · Where the nimbers run out
1, 1, 1 ∗ N Taking from the ends
1, 2 {∗2 | 0} R Taking from the ends
1, 2, 1 ∗2 N Taking from the ends · Where the nimbers run out
1, 2, 2 ↓∗ N Taking from the ends
1, 2, 2, 1 0 P Taking from the ends · Where the nimbers run out
1, 2, 3 {{{∗3 | 0}, ∗3 | 0} | 0} R Taking from the ends · Where the nimbers run out
1,2,1,3 0 P The rows that are their own mirror · Where the nimbers run out
1,3,1,4 0 P The rows that are their own mirror · Where the nimbers run out
1,3,2,4 0 P The rows that are their own mirror · Where the nimbers run out
2 ∗2 N Taking from the ends
2, 1 {0 | ∗2} L Taking from the ends
2, 1, 2 0 P Taking from the ends · Where the nimbers run out
2, 2 0 P Taking from the ends
2, 2, 2 ∗ N Taking from the ends · Where the nimbers run out
2,2,1,4 0 P The rows that are their own mirror · Where the nimbers run out
3 ∗3 N Taking from the ends
3, 1 {0 | ∗3} L Taking from the ends · Where the nimbers run out
3, 2, 3 0 P Taking from the ends · Where the nimbers run out
3,1,2,1 0 P Where the nimbers run out
4 ∗4 N Taking from the ends
4, 4 0 P Taking from the ends · Where the nimbers run out
4,1,2,2 0 P Where the nimbers run out
5 ∗5 N Taking from the ends

Where it is called

Changing this generator changes every one of these figures.

End-Nim: a player at each end of the row. Rows of heaps in which Left may take from the leftmost heap and Right from the rightmost. The value beside each row was computed by the game recursion and reduced to canonical form; the outcome beside it says who wins. A single heap is a Nim heap, because both players may take from it — and that is the last thing about this game that looks like Nim. Particular games

Taking from the ends

End-Nim is Nim's board with a player at each end, and it takes one sentence to state. Not one of its 5,460 small positions is worth a non-zero number — the game is all-small, so zero is the only number any of them can reach — and there are 2,693 distinct values between them. The outcome says a great deal more: 4,738 of those positions are won by the same player whoever moves, and on two heaps the rule is that the larger end wins.

 How much of End-Nim is a Nim heap. Rows of End-Nim by length, with the share worth a nimber beside the share that are palindromes and the number of distinct values. The impartial share falls from all of the one-heap rows to a fifteenth of the six-heap rows, while the values multiply. Particular games

Where the nimbers run out

A single End-Nim heap is a Nim heap and every palindromic row is worth a nimber, so the impartial theory looks as though it might get a long way into a partizan game. It gets one row in thirteen. Five nimbers occur in five and a half thousand rows, the palindromes account for two fifths of them, and the rows worth something else run to 2,693 distinct values.

 Three counts, and two of them are the same number. Rows of End-Nim that read the same backwards, rows equal to their own negative, and rows worth a nimber. The second and third counts are identical over every row in the sweep, so being its own negative is exactly the condition for being worth a nimber in this game. Particular games

The rows that are their own mirror

Four hundred and ten End-Nim rows are worth nimbers and 168 of them are palindromes, so a condition covering the other 242 was outstanding. It is that the row is equal to its own negative — and on this game that condition is not merely sufficient but exact, which is more than the group law promises and is a fact about End-Nim rather than about games.

 Two thousand values and no temperature. Every End-Nim row of up to six heaps, with its temperature. Not one of the 5,460 is hot, every one of them is worth an infinitesimal, and the 361 worth numbers are 361 rows worth nought. Particular games

A game with nothing at stake

The rung below explained a coincidence with a claim it did not compute: that End-Nim carries no hot self-negative values. The census says something stronger. Not one of 10,919 rows across three shapes of board is hot, every one of them is worth an infinitesimal, and the 361 rows the earlier census called numbers are 361 rows worth nought. The reason is one line of the rule, and 2,693 distinct values sit underneath it.

The whole library · The position index · The figures that play back