Results 221 to 230 of about 39,228 (248)
Some of the next articles are maybe not open access.
Provably Difficult Combinatorial Games
SIAM Journal on Computing, 1979For a number of two-person combinatorial games, the problem of determining the outcome of optimal play from a given starting position (that is, of determining which player, if either, has a forced win) is shown to be complete in exponential time with respect to logspace-reducibility.
Stockmeyer, Larry J., Chandra, Ashok K.
openaire +2 more sources
This paper examines two classical combinatorial games, Nim and the Domino Game on Linear Strips, through the shared principles of parity, recursion, and binary structure. It begins by formalizing Nim, where each position’s outcome is determined by the Nim-sum (bitwise XOR) of heap sizes: positions with zero Nim-sum are losing, and optimal play involves
Elliot Mendelson, Daniel Zwillinger
openaire +2 more sources
Elliot Mendelson, Daniel Zwillinger
openaire +2 more sources
Combinatorial Games under Auction Play
Games and Economic Behavior, 1999The authors consider two-person games played on directed graphs where each player aims at reaching a designated vertex, and where the right to move next is determined either by chance (spinner game), or by some sort of auction (Richman games, after David Ross Richman).
Lazarus, Andrew J. +4 more
openaire +2 more sources
2008
Traditional game theory has been successful at developing strategy in games of incomplete information: when one player knows something that the other does not. But it has little to say about games of complete information, for example, tic-tac-toe, solitaire and hex. The main challenge of combinatorial game theory is to handle combinatorial chaos, where
openaire +1 more source
Traditional game theory has been successful at developing strategy in games of incomplete information: when one player knows something that the other does not. But it has little to say about games of complete information, for example, tic-tac-toe, solitaire and hex. The main challenge of combinatorial game theory is to handle combinatorial chaos, where
openaire +1 more source
Games with combinatorial constraints
Cybernetics and Systems Analysis, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yemets, O. A., Ustian, N. Yu.
openaire +2 more sources
Combinatorial Games and Machines
2015Mathematics and technology interact with each other for their respective benefit. This article will try to illustrate this unavoidable fact by studying the machines built to play games—especially combinatorial games (no chance moves)—and their impact on the development of mathematical ideas.
openaire +1 more source