On a Combinatorial game
On Nonadaptive Search Problem
2000 Mathematics Subject Classification: 91A46, 91A35.We consider nonadaptive search problem for an unknown element x from the set A = {1, 2, 3, . . . , 2^n}, n ≥ 3. For fixed integer S the questions are of the form: Does x belong to a subset B of A, where the sum of the elements of B is equal to S? We wish to find all integers S for which nonadaptive search with n questions finds x. We continue our investigation from [4] and solve the last remaining case n = 2^k , k ≥ 2.
On optimal play in the game of Hex.
On solving games constructed using both short and long conjunctive sums.
On the Chvàtal-Erdős triangle game.
On the complexity of -player Hackenbush.
On the periodicity of genus sequences of quaternary games.
On the problem in max algebra: every system of intervals is a spectrum
We consider the two-sided eigenproblem over max algebra. It is shown that any finite system of real intervals and points can be represented as spectrum of this eigenproblem.
On two problems regarding the Hamiltonian cycle game.
One pile Nim with arbitrary move function.
One-pile misère Nim for three or more players.
Optimal Penney Ante strategy via correlation polynomial identities.