Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"positional games"”.

  1. Nontraditional Positional Games: New methods and boards for playing Tic-Tac-Toe

    … explore variations on Tic-Tac-Toe. We consider positional games played using a new type of move called a hop. A hop involves two parts: move and replace. In a hop the positions occupied by both players will change: one will move a piece to a new position and one will gain a piece in play. We …

    montana-tech Repository record for Nontraditional Positional Games: New methods and boards for playing Tic-Tac-Toe (opens in a new tab)

  2. Nontraditional Positional Games: New methods and boards for playing Tic-Tac-Toe

    … explore variations on Tic-Tac-Toe. We consider positional games played using a new type of move called a hop. A hop involves two parts: move and replace. In a hop the positions occupied by both players will change: one will move a piece to a new position and one will gain a piece in play. We …

    montana Repository record for Nontraditional Positional Games: New methods and boards for playing Tic-Tac-Toe (opens in a new tab)

  3. Combinatorial Problems on the Integers: Colorings, Games, and Permutations

    … three colors.</p> <p>We then study Maker-Breaker positional games for equations with fractional powers in Chapter 3. In these games, Maker and Breaker take turns to select a previously unclaimed number in {1, 2, . . . , <em>n</em>}, Maker wins if they can form a solution to a given equation, and …

    denver Repository record for Combinatorial Problems on the Integers: Colorings, Games, and Permutations (opens in a new tab)

  4. Combinatorial Problems with Geometric Flavour

    … of the Boolean lattice. Chapter 10 is devoted to positional games. For two graphs $B$ and $H$ the strong Ramsey game $\mathcal{R}(B,H)$ on the board $B$ and with target $H$ is played as follows. Two players alternately claim edges of $B$. The first player to build a copy of $H$ wins. If none of …

    cambridge Repository record for Combinatorial Problems with Geometric Flavour (opens in a new tab)