The following pages link to (Q3023366):
Displaying 6 items.
- UNO is hard, even for a single player (Q389942) (← links)
- The polyharmonic Dirichlet problem and path counting (Q401291) (← links)
- How to play Reverse Hex (Q658031) (← links)
- Monochromatic equilateral triangles in the unit distance graph (Q5135349) (← links)
- The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances (Q6048774) (← links)
- Randomly evolving Platonic Solids: a zero-player game (Q6105807) (← links)
