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 20 of 28 for “"combinatorial games"”.

  1. Combinatorial Games on Graphs

    Combinatorial Games are intriguing and have a tendency to engross students and lead them into a serious study of mathematics. The engaging nature of games is the basis for this thesis. Two combinatorial games and some educational tools are presented which were developed by the author in the pursuit …

    utahstate Repository record for Combinatorial Games on Graphs (opens in a new tab)

  2. Some Combinatorial Games on Hypergraphs

    … graph-theoretical problems and presents three games played on hypergraphs. In Chapter 2, we present theoretical results related to the existence of paths and expanders in hypergraphs. Chapters 3 and 4 discuss properties of random graph processes and an approximation of the number of edges in a …

    cau-kiel Repository record for Some Combinatorial Games on Hypergraphs (opens in a new tab)

  3. Greedy quasigroups and combinatorial games

    … out of a desire to better understand certain combinatorial games. In this paper, I will discuss some basis combinatorial game theory to provide motivation and quasigroup theory as background information. Greedy quasigroups have remarkable algebraic properties. In particular, I will answer the …

    iastate Repository record for Greedy quasigroups and combinatorial games (opens in a new tab)

  4. Greedy quasigroups and greedy algebras with applications to combinatorial games

    … out of a desire to better understand certain combinatorial games. Greedy and Wythoff quasigroups have remarkable algebraic properties. In particular, I will investigate the existence of subquasigroups and isomorphism classes. Natural generalizations of greedy quasigroups are also investigated …

    iastate Repository record for Greedy quasigroups and greedy algebras with applications to combinatorial games (opens in a new tab)

  5. On the parameterized complexity of finding short winning strategies in combinatorial games

    A combinatorial game is a game in which all players have perfect information and there is no element of chance; some well-known examples include othello, checkers, and chess. When people play combinatorial games they develop strategies, which can be viewed as a function which takes as input a game …

    uvic Repository record for On the parameterized complexity of finding short winning strategies in combinatorial games (opens in a new tab)

  6. Distributionally Ambiguous Stackelberg Combinatorial Games for Submodular Optimization and Camera View-Frame Placement

    … solution methodologies for Stackelberg zero-sum games, which model sequential decision-making between an attacker and a defender. Our work specifically addresses challenging settings where the defender's recourse is a complex com- binatorial optimization problem and the attacker faces uncertainty …

    vt Repository record for Distributionally Ambiguous Stackelberg Combinatorial Games for Submodular Optimization and Camera View-Frame Placement (opens in a new tab)

  7. Survey of results in impartial combinatorial games and an extension to three-player game

    … to find winning strategies for two-player combinatorial games. This thesis surveys results known for two-player combinatorial games and elucidates a particular winning strategy for a three player game using graph theory. The motivation for work in this area is a belief on the ability of …

    rice Repository record for Survey of results in impartial combinatorial games and an extension to three-player game (opens in a new tab)

  8. Can some simple games lead to chaos?

    Some combinatorial games, like GRUNDY'S GAME, are simple to describe, but follow chaotic patterns and can prove very difficult to analyze entirely. In this thesis we will look at some games, including a combinatorial version of Mancala; the game of BLASH & SLASH, played by drawing diagonals on a …

    calgary Repository record for Can some simple games lead to chaos? (opens in a new tab)

  9. Combinatorial Game Theory: An Introduction to Tree Topplers

    … a new game, Tree Topplers, into the field of Combinatorial Game Theory. Before covering the actual material, a brief background of Combinatorial Game Theory is presented, including how to assign advantage values to combinatorial games, as well as information on another, related game known as …

    gsu Repository record for Combinatorial Game Theory: An Introduction to Tree Topplers (opens in a new tab)

  10. Unbounded unimodal search and pursuit problems

    … lead to new complexity results on some combinatorial games. Upper and lower bounds on the time for capture are developed for the continuous Lion-Man problem.

    uiuc Repository record for Unbounded unimodal search and pursuit problems (opens in a new tab)

  11. Computational methods in codes and games

    … algorithms and heuristic search methods in combinatorial optimization, including combinatorial games. In this work unidirectional covering codes are introduced and some theoretical foundations for them are laid. Exhaustive search is used to construct asymmetric covering codes, unidirectional …

    aalto Repository record for Computational methods in codes and games (opens in a new tab)

  12. The Game of Nim on Graphs

    … a long history and is well-known in the area of combinatorial game theory. The solution to the ordinary game of Nim has been known for many years and lends itself to numerous other solutions to combinatorial games. Nim was extended to graphs by taking a fixed graph with a playing piece on a given …

    ndsu Repository record for The Game of Nim on Graphs (opens in a new tab)

  13. Positional and Detection Games

    … clear and specific in the field of recreational games. In games like chess or tic-tac-toe, every player has complete information and the player’s position decides over win and loss. On the contrary, in games like poker every player tries to find out the value of the other players’ hands to play …

    cau-kiel Repository record for Positional and Detection Games (opens in a new tab)

  14. Jogos combinatórios em grafos: jogo Timber e jogo de Coloração

    Studies three competitive combinatorial games. The timber game is played in digraphs, with each arc representing a domino, and the arc direction indicates the direction in which it can be toppled, causing a chain reaction. The player who topples the last domino is the winner. A P-position is an …

    brazil-uerj Repository record for Jogos combinatórios em grafos: jogo Timber e jogo de Coloração (opens in a new tab)

  15. Graph colourings and games

    <p>Graph colourings and combinatorial games are two very widely studied topics in discrete mathematics. This thesis addresses the computational complexity of a range of problems falling within one or both of these subjects.</p><p>Much of the thesis is concerned with the computational complexity of …

    oxford Repository record for Graph colourings and games (opens in a new tab)

  16. Applications of Games to Propositional Proof Complexity

    … this thesis we explore a number of ways in which combinatorial games can be used to help prove results in the area of propositional proof complexity. The results in this thesis can be divided into two sets, the first being dedicated to the study of Resolution space (memory) requirements, whereas …

    toronto-retro Repository record for Applications of Games to Propositional Proof Complexity (opens in a new tab)

  17. Two-player games on graphs

    In this thesis we study different kinds of combinatorial games between two players, which are played on a board that consists of the edges of some given graph G. We distinguish unbiased games, in which both players claim/orient one edge in each round, and b-biased games in which the second player …

    fu-berlin Repository record for Two-player games on graphs (opens in a new tab)

  18. The Angel Problem, Positional Games, and Digraph Roots

    This thesis is about combinatorial games -- mostly. It is also about graphs, directed graphs and hypergraphs, to a large extent; and it deals with the complexity of certain computational problems from these two areas. We study three different problems that share several of the above aspects, yet, …

    fu-berlin Repository record for The Angel Problem, Positional Games, and Digraph Roots (opens in a new tab)

  19. Colorings of Randomly Augmented Graphs and a Maker-Strategy for the k-Edge-Connectivity Game

    … are studied, as well as multiple Maker-Breaker games. It contains tight upper bounds for the chromatic number and the choice number of randomly augmented graphs. Furthermore it gives an upper bound for the number of turns it takes Maker to win several Maker-Breaker games.

    cau-kiel Repository record for Colorings of Randomly Augmented Graphs and a Maker-Strategy for the k-Edge-Connectivity Game (opens in a new tab)

Page 1 of 2