We study Maker/Breaker games on the edges of sparse graphs. Maker and Breaker take turns in claiming previously unclaimed edges of a given graph H . Maker aims to occupy a given target graph G and Breaker tries to prevent Maker from achieving his goal. We define a function f on the integers and show that for every d-regular graph G on n vertices there is a graph H with at most f(d)n edges such ...

Two new versions of the so-called Maker-Breaker Positional Games are defined by József Beck. In these variants Picker takes unselected pair of elements and Chooser keeps one of these elements and gives back the other to Picker. In the Picker-Chooser version Picker is Maker and Chooser is Breaker, while the roles are swapped in the Chooser-Picker version. It seems that both the Picker-Chooser an...

The above is called the “strong” version of the game. In the “weak” version, also called “maker-breaker”, the second player’s aim is not to occupy a winning set but just to prevent the first player from doing so. The interest is both for general theorems about games and also in particular games of interest, like the Hales-Jewett game (multi-dimensional noughts & crosses). Roughly speaking, a fa...

This paper describes our submission to the sentiment analysis sub-task of “Build It, Break It: The Language Edition (BIBI)”, on both the builder and breaker sides. As a builder, we use convolutional neural nets, trained on both phrase and sentence data. As a breaker, we use Q-learning to learn minimal change pairs, and apply a token substitution method automatically. We analyse the results to g...

We consider a tic-tac-toe game played on the d-dimensional integer lattice. The game that we investigate is a Maker–Breaker version of tic-tac-toe. In a Maker– Breaker game, the first player, Maker, only tries to occupy a winning line and the second player, Breaker, only tries to stop Maker from occupying a winning line. We consider the bounded number of directions game, in which we designate a...

In order to guarantee the operation stability of high-voltage circuit-breaker, this paper extracts eigenvector of vibration signals based on mining of characteristic entropy of the wavelet packet obtained under the state of circuit breaker. Besides, the eigenvector of various fault samples is adopted as the input information of the BP network. After that, the author conducts training of the wel...

We study the Maker-Breaker H-game played on the edge set of the random graph G(n, p). In this game, two players, Maker and Breaker, alternately claim unclaimed edges of G(n, p), until all the edges are claimed. Maker wins if he claims all the edges of a graph H; Breaker wins otherwise. Recently, Müller and Stojaković determined the threshold for the graph property that Maker can win this game i...

A slip-line field model for orthogonal cutting with step-type chip breaker assuming adhesion friction at chip/tool interface is developed using Kudo’s basic slip-line field. An alternative method is suggested for estimation of breaking strain in the chip. The model proposed predicts that with decrease in distance of chip breaker from the cutting edge of the tool, the breaking strain and shear s...

We consider a Maker-Breaker type game on the square grid, in which each player takes t points on their tth turn. Maker wins if he obtains n points on a line (in any direction) without any of Breaker’s points between them. We show that, despite Maker’s apparent advantage, Breaker can prevent Maker from winning until about his nth turn. We actually prove a stronger result: Breaker only needs to c...

Symmetry breaking has been proven to be an efficient preprocessing technique for satisfiability solving (SAT). In this paper, we port the state-of-the-art SAT symmetry breaker BreakID to answer set programming (ASP). The result is a lightweight tool that can be plugged in between the grounding and the solving phases that are common when modelling in ASP. We compare our tool with sbass, the curr...