Related papers: Party Game for a 500th Anniversary
This article, based on a talk, treats some elementary, but not completely simple examples from probability. They concern multiple birthday coincidences, throwing dice, the combinatorics of the German card game "Doppelkopf", and the…
Duerer's engraving ``MELENCOLIA I'' was circulated in two versions not previously distinguished. Besides their conspicuous early Renaissance scientific instruments and tools, they contain numerous apparently unreported concealments whose…
We introduce a new combinatorial game, named Triangle Game. In this game, a directed $3$-cycle graph is given, and tokens are placed on each vertex. The player chooses an edge and takes at least one token from the initial vertex. At the…
We present an algebraic framework for the analysis of combinatorial games. This framework embraces the classical theory of partizan games as well as a number of misere games, comply-constrain games, and card games that have been studied…
This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…
There are two hypotheses on Leonardo's polyhedron based on the Pseudo-RCO and drawn for Luca Pacioli's book: Leonardo made an error, or: Leonardo draw it with intention, as it is. We give arguments, which support the Intention-hypothesis.
This brief paper describes the single-player card game called "Perpetual Motion" and reports on a computational analysis of the game's outcome. The analysis follows a Monte Carlo methodology based on a sample of 10,000 randomly generated…
Much has been written about the golden ratio $\phi=\frac{1+\sqrt{5}}{2}$ and this strange number appears mysteriously in many mathematical calculations. In this article, we review the appearance of this number in the graph theory. More…
Over the past twenty years, lecture hall partitions have emerged as fundamental combinatorial structures, leading to new generalizations and interpretations of classical theorems and new results. In recent years, geometric approaches to…
A query game is a pair of a set $Q$ of queries and a set $\mathcal{F}$ of functions, or codewords $f:Q\rightarrow \mathbb{Z}.$ We think of this as a two-player game. One player, Codemaker, picks a hidden codeword $f\in \mathcal{F}$. The…
A strategy for playing the game of roulette is presented in this paper. The strategy is based on the same probabilistic argument that leads to the well-known Birthday Paradox in Probability theory. Following the strategy, a player will have…
Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investigated in the literature since then. These games are played on a hypergraph where two players alternately select an unclaimed vertex of it. In…
We introduce Quintessence: a family of burr puzzles based on the geometry and combinatorics of the 120-cell. We discuss the regular polytopes, their symmetries, the dodecahedron as an important special case, the three-sphere, and the…
We introduce a one-person game that we call Padlock Solitaire which resembles the well-known clock solitaire card game. Analyzing variants of this game we obtain simple proofs of some classical results of combinatorics including ballot…
A statistical study on 565 works of art of different great painters was done and it was calculated the ratio of the 2 sides of a paintings. Assuming that all the painters under discussion enter in a statistics with equal weights it is shown…
The numbers game is a one-player game played on a finite simple graph with certain ``amplitudes'' assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…
This paper studies the complexity of computing a representation of a simple game as the intersection (union) of weighted majority games, as well as, the dimension or the codimension. We also present some examples with linear dimension and…
Given an integer-valued matrix $A$ of dimension $\ell \times k$ and an integer-valued vector $b$ of dimension $\ell$, the Maker-Breaker $(A,b)$-game on a set of integers $X$ is the game where Maker and Breaker take turns claiming previously…
We present a deterministic algorithm, solving discounted games with $n$ nodes in $n^{O(1)}\cdot (2 + \sqrt{2})^n$-time. For bipartite discounted games our algorithm runs in $n^{O(1)}\cdot 2^n$-time. Prior to our work no deterministic…
We will discuss the generalization of entropic uncertainty principles in terms of a game. The game involves k-players, each measuring one of k possible observables. The question is, what is the maximum number of players that can play such…