Abstract: When are all positions of a game numbers? We show that two properties are necessary and sufficient. These properties are consequences of that, in a number, it is not an advantage to be the first player. One of these properties implies the other. However, checking for one or the other, rather than just one, can often be accomplished by only looking at the positions on the `board'. If the stronger property holds for all positions, then the values are integers.
Recommendations
Cites work
Cited in
(11)- Enumeration by kernel positions
- The arithmetic of reversed positional games
- The arithmetic or reversed positional games
- A Generalization of Conway Number Games to Multiple Players
- scientific article; zbMATH DE number 2076805 (Why is no real title available?)
- scientific article; zbMATH DE number 2151238 (Why is no real title available?)
- A note on numbers
- A few ripe red-blue cherries
- scientific article; zbMATH DE number 2219217 (Why is no real title available?)
- A complete solution for the partisan chocolate game
- A note on class numbers
This page was built for publication: A note on numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3390715)