Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[كتاب][B] Games, puzzles, and computation
RA Hearn, ED Demaine - 2009 - books.google.com
This book explores the underlying mathematical reasons for why games and puzzles are
challenging and so much fun. It shows how games and puzzles can serve as powerful …
challenging and so much fun. It shows how games and puzzles can serve as powerful …
Playing games with algorithms: Algorithmic combinatorial game theory
Combinatorial games lead to several interesting, clean problems in algorithms and
complexity theory, many of which remain open. The purpose of this paper is to provide an …
complexity theory, many of which remain open. The purpose of this paper is to provide an …
6-uniform Maker-Breaker game is PSPACE-complete
In a STOC 1976 paper, Schaefer proved that it is PSPACE-complete to determine the winner
of the so-called Maker-Breaker game on a given set system, even when every set has size at …
of the so-called Maker-Breaker game on a given set system, even when every set has size at …
[PDF][PDF] Combinatorial games: selected bibliography with a succinct gourmet introduction
AS Fraenkel - Games of no Chance, 2009 - nzdr.ru
Roughly speaking, the family of combinatorial games consists of two-player games with
perfect information (no hidden information as in some card games), no chance moves (no …
perfect information (no hidden information as in some card games), no chance moves (no …
Combinatorial games: selected bibliography with a succinct gourmet introduction
A Fraenkel - The Electronic Journal of Combinatorics, 2012 - combinatorics.org
Roughly speaking, the family of combinatorial games consists of two-player games with
perfect information (no hidden information as in some card games), no chance moves (no …
perfect information (no hidden information as in some card games), no chance moves (no …
Constraint logic: A uniform framework for modeling computation as games
We introduce a simple game family, called constraint logic, where players reverse edges in
a directed graph while satisfying vertex in-flow constraints. This game family can be …
a directed graph while satisfying vertex in-flow constraints. This game family can be …
Digraph placement games
This paper considers a natural ruleset for playing a partisan combinatorial game on a
directed graph, which we call Digraph Placement. Given a digraph $ G $ with a not …
directed graph, which we call Digraph Placement. Given a digraph $ G $ with a not …
Computational complexity of turning tiles
In combinatorial game theory, the winning player for a position in normal play is analyzed
and characterized via algebraic operations. Such analyses define a value for each position …
and characterized via algebraic operations. Such analyses define a value for each position …
[PDF][PDF] Selective search in games of different complexity
MPD Schadd - 2011 - cris.maastrichtuniversity.nl
This thesis investigates how selective-search methods can improve the performance of a
game program for a given domain. Selective-search methods aim to explore only the …
game program for a given domain. Selective-search methods aim to explore only the …
[كتاب][B] Board games: throughout the history and multidimensional spaces
J Kyppö - 2019 - World Scientific
Chess has been known as a game for some 2000 years. The basic form of this game was
called chaturanga, and the movements of the pieces in this game differed significantly from …
called chaturanga, and the movements of the pieces in this game differed significantly from …