Generalized Harary games

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 alte...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerző: Pluhár András
Dokumentumtípus: Cikk
Megjelent: 1997
Sorozat:Acta cybernetica 13 No. 1
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12580
LEADER 01329nab a2200217 i 4500
001 acta12580
005 20220613152020.0
008 161015s1997 hu o 0|| eng d
022 |a 0324-721X 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Pluhár András 
245 1 0 |a Generalized Harary games  |h [elektronikus dokumentum] /  |c  Pluhár András 
260 |c 1997 
300 |a 77-83 
490 0 |a Acta cybernetica  |v 13 No. 1 
520 3 |a 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. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika 
856 4 0 |u http://acta.bibl.u-szeged.hu/12580/1/cybernetica_013_numb_001_077-083.pdf  |z Dokumentum-elérés