Abstract: In synchronized games players make their moves simultaneously
rather than alternately. Synchronized Quadromineering is
the synchronized version of Quadromineering, a variants of a classical
two-player combinatorial game called Domineering. Experimental
results for small m × n boards (with m + n < 15) and some
theoretical results for general k × n boards (with k = 4, 5, 6) are
presented. Moreover, some Synchronized Quadromineering variants
are also investigated.
Abstract: The game of Maundy Block is the three-player variant
of Maundy Cake, a classical combinatorial game. Even though to
determine the solution of Maundy Cake is trivial, solving Maundy
Block is challenging because of the identification of queer games,
i.e., games where no player has a winning strategy.
Abstract: Domineering is a classic two-player combinatorial
game usually played on a rectangular board. Three-player Domineering
is the three-player version of Domineering played on a three
dimensional board. Experimental results are presented for x×y ×z
boards with x + y + z < 10 and x, y, z ≥ 2. Also, some theoretical
results are shown for 2 × 2 × n board with n even and n ≥ 4.
Abstract: In synchronized games players make their moves simultaneously
rather than alternately. Synchronized Triomineering
and Synchronized Tridomineering are respectively the synchronized
versions of Triomineering and Tridomineering, two variants of a
classic two-player combinatorial game called Domineering. Experimental
results for small m × n boards (with m + n ≤ 12 for
Synchronized Triomineering and m + n ≤ 10 for Synchronized
Tridomineering) and some theoretical results for general k×n boards
(with k = 3, 4, 5 for Synchronized Triomineering and k = 3
for Synchronized Tridomineering) are presented. Future research is
indicated.
Abstract: Col is a classic combinatorial game played on graphs
and to solve a general instance is a PSPACE-complete problem.
However, winning strategies can be found for some specific graph
instances. In this paper, the solution of Col on complete k-ary trees
is presented.