. . .
About Us
Education
Research
PhD
Acta Cybernetica
Conferences
Sponsors

Departments:
- Image Processing and Computer Graphics
- Foundations of Computer Science
- Computer Algorithms and Artificial Intelligence
- Computational Optimization
- Software Engineering
- Research Group on Artificial Intelligence

[University of Szeged]
Research>>> Acta Cybernetica>>> Previous Volumes>>> Magyarul

Generalized Harary Games

 

 1

 


András Pluhár 3

 


Abstract

 

 There are a number of positional games known on the infinite chessboard. One of the most studied is the 5-in-a-row, whose rules are almost identical to the ancient Japanese Go-Moku. Along this line Harary asked if a player can achieve a translated copy of a given polymino P when the two players alternately take the squares of the board. Here we pose his question for general subsets of the board, and give a condition under which a draw is possible. Since a drawing strategy corresponds to a good 2-coloration of the underlying hypergraph, our result can be viewed as a derandomization of the Lovász Local Lemma.


Footnotes:

 

  1 The author was partially supported by the Austrian-Hungarian Action Fund ``Combinatorial optimization - research and education'' 20u2 and the Bilateral Intergovermental S & T Cooperation between Italy and Hungary I-14/95.

  2 The author was partially supported by the Austrian-Hungarian Action Fund ``Combinatorial optimization - research and education'' 20u2 and the Bilateral Intergovermental S & T Cooperation between Italy and Hungary I-14/95.

  3 Department of Computer Science, Attila József University, Árpád tér 2, H-6720 Szeged, Hungary

Webmaster:webmaster@inf.u-szeged.hu