Zobrazeno 1 - 10
of 68
pro vyhledávání: '"Huggan, Melissa A."'
This paper considers the Cops and Attacking Robbers game, a variant of Cops and Robbers, where the robber is empowered to attack a cop in the same way a cop can capture the robber. In a graph $G$, the number of cops required to capture a robber in th
Externí odkaz:
http://arxiv.org/abs/2408.02225
We consider playing the game of Tic-Tac-Toe on block designs BIBD($v, k, \lambda$) and transversal designs TD($k, n$). Players take turns choosing points and the first player to complete a block wins the game. We show that triple systems, BIBD($v, 3,
Externí odkaz:
http://arxiv.org/abs/2402.11118
We consider a variation of Cops and Robber, introduced in [D. Cox and A. Sanaei, The damage number of a graph, [Aust. J. of Comb. 75(1) (2019) 1-16] where vertices visited by a robber are considered damaged and a single cop aims to minimize the numbe
Externí odkaz:
http://arxiv.org/abs/2308.09645
Autor:
Behague, Natalie C., Bonato, Anthony, Huggan, Melissa A., Marbach, Trent G., Pittman, Brittany
The localization game is a pursuit-evasion game analogous to Cops and Robbers, where the robber is invisible and the cops send distance probes in an attempt to identify the location of the robber. We present a novel graph parameter called the capture
Externí odkaz:
http://arxiv.org/abs/2105.09806
We introduce an impartial combinatorial game on Steiner triple systems called Nofil. Players move alternately, choosing points of the triple system. If a player is forced to fill a block on their turn, they lose. We explore the play of Nofil on all S
Externí odkaz:
http://arxiv.org/abs/2103.13501
We highlight new results on the localization number of a graph, a parameter derived from the localization graph searching game. After introducing the game and providing an overview of existing results, we describe recent results on the localization n
Externí odkaz:
http://arxiv.org/abs/2103.10587
We consider Flipping Coins, a partizan version of the impartial game Turning Turtles, played on lines of coins. We show the values of this game are numbers, and these are found by first applying a reduction, then decomposing the position into an iter
Externí odkaz:
http://arxiv.org/abs/2102.13225
Autor:
Huggan, Melissa A., Tennenhouse, Craig
Genetic programming is the practice of evolving formulas using crossover and mutation of genes representing functional operations. Motivated by genetic evolution we develop and solve two combinatorial games, and we demonstrate some advantages and pit
Externí odkaz:
http://arxiv.org/abs/2102.00476
Complex networks are pervasive in the real world, capturing dyadic interactions between pairs of vertices, and a large corpus has emerged on their mining and modeling. However, many phenomena are comprised of polyadic interactions between more than t
Externí odkaz:
http://arxiv.org/abs/2101.12560
When are all positions of a game numbers? We show that two properties are necessary and sufficient. These properties are consequences of that, in a number, it is not an advantage to be the first player. One of these properties implies the other. Howe
Externí odkaz:
http://arxiv.org/abs/2101.10178