Search results

[[Image:Alexander's Star.jpg|thumb|Alexander's Star in a solved state.]] ...it, all of which could/should have different colours than the plane being solved. ...

{{short description| A combinatorial game solved using overheating }} ...ory)|overheating]], an operation for analyzing the theory of combinatorial games, and used Blockbusting as an example for that operation.<ref name=b87/> ...

...ctal games''' are a [[Subclass_(set_theory)|subclass]] of [[heap game|heap games]] that involve removing tokens (game pieces or stones) from heaps of tokens ...rial game theory]] as a generalization of [[Nim]], [[Kayles]], and similar games.<ref name="WW">{{cite book ...

...21–229|doi=10.1016/S0167-5060(08)70335-2|issn=0167-5060}}</ref>''' It was solved later by Hamidoune and Las-Vergnas.<ref name="Hamidoune 1987">{{Cite journa ...e following conditions is sufficient:'''<ref name="pg14">{{Cite Positional Games 2014}}</ref>'''{{Rp|36-39}} ...

...allowed.<ref name="eppstein">{{Cite web |title=Computational Complexity of Games and Puzzles |url=https://ics.uci.edu/~eppstein/cgt/hard.html |access-date=2 ...solitaire)|turtle]]", found that about 3 percent of the turtles cannot be solved even when looking below tiles is allowed.<ref>http://www.math.ru.nl/~debond ...

...adjacent pins, until all the pins are gone. Using the notation of [[octal games]], Kayles is denoted '''0.77'''. ...archive.org/web/20081012123544/http://www.plambeck.org/oldhtml/mathematics/games/misere/077/index.htm |archive-date=2008-10-12 |url-status=dead }}</ref> ...

{{Short description|Operations adjusting incentives of combinatorial games}} '''Overheating''' is an extension of heating used in Berlekamp's [[solved game|solution]] of [[Blockbusting (game)|Blockbusting]], ...

...ar language]], a problem that had been open since 1963 when Lawrence Eggan solved the related [[star height problem]], showing that there is no finite bound Earlier, in 1979, Hashiguchi had also solved another open problem on regular languages, of deciding whether, for a given ...

...'<ref name="Papadimitriou2007"/> (a formal definition, describing succinct games as a [[computational problem]], is given by Papadimitriou & Roughgarden 200 ==Types of succinct games== ...

The problem can be solved in <math>\mathcal{O}(n \cdot \log(k))</math> running time with <math>\mathc The problem can be solved by iteratively merging two of the k arrays using a 2-way merge until only a ...

SRS can be solved in polynomial time in the [[Real RAM]] model.<ref>{{Cite journal |last=Tiwa ...in O(poly(''k'',log(''n'')). A positive answer would imply that SRS can be solved in polynomial time in the Turing Machine model. Some currently known bounds ...

...ubset of a collection of [[unit disk]]s in the [[hyperbolic plane]] can be solved in time <math>n^{O(\log n)}</math>, and requires time <math>n^{\Omega(\log ...es that does not appear as an [[induced subgraph]] of a given graph can be solved in time <math>n^{O(\log n)}</math>, and requires time <math>n^{\Omega(\log ...

...s]], [[control systems]] and [[Artificial intelligence (video games)|video games]]. They describe switchings between a finite set of tasks in a modular fash ...trees extension to facilitate non-player multi-agent coordination in video games |url=https://cs.uns.edu.ar/~ragis/Agis%20et%20al.%20(2020)%20-%20An%20event ...

...y)|forests]] needed to cover all of its edges. Matroid partitioning may be solved in [[polynomial time]], given an [[matroid oracle|independence oracle]] for | title = Forests, frames, and games: algorithms for matroid sums and applications ...

...ands and values of all bidders are publicly known, then the problem can be solved by any algorithm for the [[knapsack problem]]. The problem is NP-hard, but ...tps://www.sciencedirect.com/science/article/pii/S089982560800050X |journal=Games and Economic Behavior |series=Special Issue in Honor of Michael B. Maschler ...

...problem für Spiele zu je dreien'', The tournament problem for three person games). Her dissertation was valued ''opus valde laudabile''<sup>([[:de:Dissertat Peltesohn solved the Difference Problems of {{ill|Lothar Heffter|de}} (1896) in combinatoric ...

...h-based engines work much faster than neural networks, a problem which was solved in '''Darkfores2''' by running the processes in parallel with frequent comm ...meters.<ref name=":1" /> Darkfmct3 was trained against 300 random selected games from an empirical dataset representing different game stages. The learning ...

...three.{{r|pv}} With the <math>3\times 3</math> [[Rook's graph]] and the [[Games graph]], it is one of only three possible strongly regular graphs whose par ...9 colors in any [[graph coloring]]; a 9-coloring of this graph describes a solved Sudoku puzzle.{{r|ghmu|hm}} In contrast, for the Brouwer–Haemers graph, the ...

[[File:4-cube solved.png|thumb|4-cube 3⁴ virtual puzzle, solved. In this projection one cell is not shown. The position of this cell is the ...lved close.png|thumb|5-cube 3⁵ virtual puzzle, close in view in solved state.]] ...

...e=COMPUTATION OF THE KERNELS OF SIMPLE GAMES AND THE NUCLEOLUS OF N-PERSON GAMES. |language=en}}</ref><ref>{{Cite journal |last=Kohlberg |first=Elon |date=1 | title=Games of Strategy: Theory and Applications ...