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 17 of 17 for “"combinatorial game theory"”.
-
Combinatorial Game Theory: An Introduction to Tree Topplers
The purpose of this thesis is to introduce 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 …
-
Systèmes de numération abstraits et combinatoire des mots (habilitation à diriger des recherches)
… and their links to combinatorics on words and combinatorial game theory.
-
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 …
-
Equitable Decompositions: A Gateway to Spectral Theory Through Graph Automorphisms
… the structure of molecules and network design to combinatorial game theory. A central question in spectral graph theory is how to compute or characterise the eigenvalues of the matrices associated with such graphs. Classical decomposition methods, such as diagonalisation or Jordan normal form, …
-
An Analysis of a New Partizan Game Using Combinatorial Techniques
John Horton Conway's combinatorial game theory was applied to a new partizan game with a complete analysis as the result. Mathematical values were assigned to the countably infinite number of positions in the game. Direct computation of the first eight values and extension via the Principle of …
-
The Game of Nim on Graphs
The ordinary game of Nim has 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 …
-
Construction, Operations, and Applications of the Surreal Numbers
… well as how they arise naturally in quantifying game positions in Section 1.2. Section 2 describes the operations unique to the surreals, allowing us to manipulate strange numbers such as 5 3 p ! ". The predominant application of surreal numbers thus far has been to combinatorial game theory, …
-
PermuNim : an impartial game of permutation avoidance.
PermuNim is an impartial combinatorial game played on a board of squares where each player takes turns playing in rows and columns of the board which have not been played in, avoiding zero or more permutations. The game comes to an end when neither player can move. The first player unable to move …
-
ENTERPRISE SECURITY ANALYSIS INCLUDING DENIAL OF SERVICE COUNTERMEASURES
… to date are insufficient. This thesis uses combinatorial game theory to analyze the dynamics of DDoS attacks on an enterprise and find traffic adaptations that counter the attack. This work builds on the DDoS analysis in [4]. The approach we present designs networks with a structure that …
-
Nim in Topological Spaces
Nim is a mathematical game played with piles of rocks. Two players take turns choosing a pile and removing some of its rocks, and whoever takes the last rock wins. Strategy in nim is well understood, but what happens if we replace the rocks with sets in a space and say the game ends when the chosen …
-
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 …
-
The Computational Complexity of Some Games and Puzzles With Theoretical Applications
… algorithmic properties of one- and two-player games people enjoy playing, such as Sudoku or Chess. Questions asked about puzzles and games in this context are of the following type: can we design efficient computer programs that play optimally given any opponent (for a two-player game), or …
-
Subtraction Games: Range and Strict Periodicity
… I introduce some background for subtraction games and explore the Sprague-Grundy functions defined on them. I exhibit some subtraction games where the functions are guaranteed to be strictly periodic. I also exhibit a class of subtraction games which have bounded range, and show there are …
-
Analysis of Distributed Denial of Service Attacks and Countermeasures
Network technology has experienced explosive growth in the past two decades. The vast connectivity of networks all over the world poses monumental risks. The generally accepted philosophy in the security world is that no system or network is completely secure [1] which makes network security a …
-
A Process Model of Non-Relativistic Quantum Mechanics
A process model of quantum mechanics utilizes a combinatorial game to generate a discrete and finite causal space upon which can be defined a self-consistent quantum mechanics. An emergent space-time and continuous wave function arise through a uniform interpolation process. Standard …
-
Algoritmy strojového hraní Hackenbushe s využitím surreálních čísel
Tato bakalářská práce se zabývá návrhem a implementací dvou metod převodu kombinatorické hry do algebraické formy. První metoda se zaměřuje na specifickou hru Hackenbush, která obsahuje červené a modré hrany. Pozici v této hře převádí na dyadické číslo rekurzivním procházením možných tahů levého a …