Results 11 to 20 of about 39,432 (269)

Two Pile Move-Size Dynamic Nim [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2005
The purpose of this paper is to solve a special class of combinational games consisting of two-pile counter pickup games for which the maximum number of counters that can be removed on each successive move changes during the play of the games.
Arthur Holshouser, Harold Reiter
doaj   +1 more source

Fast strategies in biased Maker--Breaker games [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2018
We study the biased $(1:b)$ Maker--Breaker positional games, played on the edge set of the complete graph on $n$ vertices, $K_n$. Given Breaker's bias $b$, possibly depending on $n$, we determine the bounds for the minimal number of moves, depending on ...
Mirjana Mikalački, Miloš Stojaković
doaj   +1 more source

Combinatorial Games with a Pass: A dynamical systems approach [PDF]

open access: yes, 2011
By treating combinatorial games as dynamical systems, we are able to address a longstanding open question in combinatorial game theory, namely, how the introduction of a "pass" move into a game affects its behavior.
Adam S. Landsberg   +9 more
core   +1 more source

On a combinatorial game

open access: yesJournal of Combinatorial Theory, Series A, 1973
Es wird das folgende verallgemeinerte Mühlespiel betrachtet: Gegeben seien die Mengen \(A_k\) und es sei \(S= \bigcup ^m_{k=1}A_k\). Die beiden Spieler wählen abwechselnd je ein Element aus \(S\). Wer als erster alle Elemente einer der Mengen \(A_k\) zusammen hat, hat gewonnen. Sei \(|A_k| =n\) und sei \(m^*(n)\) die kleinste Zahl \(m\) (= Anzahl der \(
Paul Erdös, John L. Selfridge
openaire   +2 more sources

An O(n)-Round Strategy for the Magnus-Derek Game

open access: yesAlgorithms, 2010
We analyze further the Magnus-Derek game, a two-player game played on a round table with n positions. The players jointly control the movement of a token. One player, Magnus, aims to maximize the number of positions visited while minimizing the number of
Zhivko Nedev
doaj   +1 more source

An Analysis on Video Game Creators’ Rights through Literary and Artistic Property Law in Iran and United States of America [PDF]

open access: yesپژوهش های حقوق تطبیقی, 2023
Video game has one of the biggest markets compared to other literary and artistic works. Therefore, it’s crucial to take effective steps for its protection. Of course, the intellectual property law, especially the literary and artistic property law plays
Pejman Mohammadi, Mohammad Bagher Balkh
doaj  

ELEMENTS OF GAME THEORY USED IN DIDACTICS [PDF]

open access: yesRevista de Pedagogie, 2013
This article proposes to bring forth a method that, at least after the end of the primary school, disappears almost entirely of school practice: the play method.
Luminita Catana
doaj   +1 more source

Strategy-Stealing Is Non-Constructive [PDF]

open access: yes, 2019
In many combinatorial games, one can prove that the first player wins under best play using a simple but non-constructive argument called strategy-stealing.
Bodwin, Greg, Grossman, Ofer
core   +2 more sources

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search [PDF]

open access: yesJournal of Artificial Intelligence and Data Mining, 2017
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be
M. B. Dowlatshahi, V. Derhami
doaj   +1 more source

Combinatorial structures to modeling simple games and applications [PDF]

open access: yes, 2017
We connect three different topics: combinatorial structures, game theory and chemistry. In particular, we establish the bases to represent some simple games, defined as influence games, and molecules, defined from atoms, by using combinatorial structures.
Molinero Albareda, Xavier
core   +1 more source

Home - About - Disclaimer - Privacy