The following pages link to (Q5524370):
Displaying 31 items.
- The forest hiding problem (Q633206) (← links)
- The rook problem on saw-toothed chessboards (Q847376) (← links)
- The Sprague-Grundy function for Wythoff's game (Q914374) (← links)
- The orchard visibility problem and some variants (Q927876) (← links)
- A two-parameter family of an extension of Beatty sequences (Q941402) (← links)
- The use and usefulness of numeration systems (Q1119959) (← links)
- Nimhoff games (Q1177944) (← links)
- The number of product-weighted lead codes for ballots and its relation to the Ursell functions of the linear Ising model (Q1230783) (← links)
- Adjoining to Wythoff's game its P-positions as moves (Q1275087) (← links)
- Heap games, numeration systems and sequences (Q1293425) (← links)
- Chessboard graphs, related designs, and domination parameters (Q1298906) (← links)
- The ring of \(k\)-regular sequences. II. (Q1426034) (← links)
- Recent results and questions in combinatorial game complexities (Q1583532) (← links)
- A new heap game (Q1589501) (← links)
- Arrays, numeration systems and Frankenstein games (Q1603715) (← links)
- Patterns in the generalized Fibonacci word, applied to games (Q1744753) (← links)
- Rulesets for Beatty games (Q1791291) (← links)
- Explicit evaluations and reciprocity theorems for finite trigonometric sums (Q1866176) (← links)
- Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
- Scaling properties of generalized Carlitz sequences of polynomials (Q1887052) (← links)
- The trace method for cotangent sums (Q2005195) (← links)
- Games played by Boole and Galois (Q2473039) (← links)
- Sur un théorème de Thue (Q2555163) (← links)
- Characterization of the set of values \(f(n)=[n \alpha ], n=1,2,\dots \) (Q2555512) (← links)
- A generalization of Wythoff's game (Q2562046) (← links)
- Euclid and Wythoff games (Q2576836) (← links)
- Combinatorial and probabilistic properties of systems of numeration (Q2808036) (← links)
- Generalized Riemann Sums (Q4607238) (← links)
- The most elementary proof that <i />? (Q5367034) (← links)
- Efficient presolving methods for solving maximal covering and partial set covering location problems (Q6168589) (← links)
- Variants of the domination number for flower snarks (Q6597991) (← links)
