Results 221 to 230 of about 53,582 (275)

Provably Difficult Combinatorial Games

SIAM Journal on Computing, 1979
For 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

Combinatorial Games

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

Combinatorial Games under Auction Play

Games and Economic Behavior, 1999
The 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

Home - About - Disclaimer - Privacy