Pluhár András: Generalized Harary games. In: Acta cybernetica, (13) 1. pp. 77-83. (1997)
Preview |
Cikk, tanulmány, mű
cybernetica_013_numb_001_077-083.pdf Download (537kB) | Preview |
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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 1997 |
| Volume: | 13 |
| Number: | 1 |
| ISSN: | 0324-721X |
| Page Range: | pp. 77-83 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38503/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: p. 82-83. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:26 |
| Last Modified: | 2022. Jun. 13. 15:20 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12580 |
Actions (login required)
 |
View Item |
