Nhan Bao Ho

activity

20122018

most citedTetris Hypergraphs and Combinations of Impartial Games

6 citations · 11 across the 11 of their papers we have counts for

collaborators

Showing 2015Show all

5 papers · 1 filter

math.CO2015

Slow $k$ -Nim

Vladimir Gurvich, Nhan Bao Ho

Given $n$ piles of tokens and a positive integer $k \leq n$ , we study the following two impartial combinatorial games Nim $_{n, \leq k}^{1}$ and Nim $_{n, = k}^{1}$ . In the first (resp. s…

math.CO2015

On tame, pet, domestic, and miserable impartial games

Vladimir Gurvich, Nhan Bao Ho

Playing impartial games under the normal and misere conventions may differ a lot. However, there are also many "exceptions" for which the normal and misere plays are very similar.…

math.CO2015★ 1 cited

On the Sprague-Grundy function of Exact $k$ -Nim

Endre Boros, Vladimir Gurvich, Nhan Bao Ho +2

Moore's generalization of the game of {\sc Nim} is played as follows. Let $n$ and $k$ be two integers such that $1 \leq k \leq n$ . Given $n$ piles of tokens, two players move alter…

math.CO2015

Three-pile Sharing Nim and the quadratic time winning strategy

Nhan Bao Ho

We study a variant of 3-pile Nim in which a move consists of taking tokens from one pile and, instead of removing then, topping up on a smaller pile provided that the destination p…

math.CO2015

On the Sprague-Grundy Function of Tetris Extensions of Proper {\sc Nim}

Endre Boros, Vladimir Gurvich, Nhan Bao Ho +1

Given a hypergraph $\cH \subseteq 2^I \setminus \{\emptyset\}$ on the ground set $I = {1, \dots, n}$ , we assign to each $i \in I$ a nonnegative integer $x_{i}$ , that is a pile of…

Slow k-Nim

On tame, pet, domestic, and miserable impartial games

On the Sprague-Grundy function of Exact k-Nim

Three-pile Sharing Nim and the quadratic time winning strategy

On the Sprague-Grundy Function of Tetris Extensions of Proper {\sc Nim}

Slow $k$ -Nim

On the Sprague-Grundy function of Exact $k$ -Nim