In this paper we define a bridge between pairings and colorings of the hypergraphs by introducing a generalization of pairs called t-cakes for t ∈ ℕ, t ≥ 2. For t = 2 the 2-cakes are the same as the well-known pairs of system of distinct representatives, that can be turned to pairing strategies in Maker-Breaker hypergraph games, see Hales and Jewett . The two-colorings are the other extremity of t-cakes, in which the whole ground set of the hypergraph is one big cake that we divide into two parts (color classes). Starting from the pairings (2-cake placement) and two-colorings we define the generalized t-cake placements where we pair p elements by q elements (p, q ∈ ℕ, 1 ≤ p, q < t, p + q = t).
The method also gives bounds on the condition of winnings in certain biased Chooser-Picker games, which can be introduced similarly to Beck . We illustrate these ideas on the k-in-a-row games for different values of k on the infinite chessboard.
If the inline PDF is not rendering correctly, you can download the PDF file here.
 L. V. Allis H. J. van den Herik and M. P. Huntjens Go-Moku solved by new search techniques. Proc. 1993 AAAI Fall Symp. on Games: Planning and Learning AAAI Press Tech. Report FS93-02 1-9 Menlo Park.
 J. Beck Positional games and the second moment method. Combinatorica22 (2002) 169–216.
 J. Beck Positional Games Combinatorics Probability and Computing14 (2005) 649–696.
 J. Beck Combinatorial Games Tic-Tac-Toe Theory Cambridge University Press 2008.
 E. R. Berlekamp J. H. Conway and R. K. Guy Winning Ways for your mathematical plays Volume 2 Academic Press New York 1982.
 V. Chvátal and P. Erdős Biased positional games Annals of Discrete Math. 2 (1978) 221–228.
 A. Csernenszky The Chooser-Picker 7-in-a-row game. Publicationes Mathematicae76 (2010) 431–440.
 A. Csernenszky The Picker-Chooser diameter game. Theoretical Computer Science411 (2010) 3757–3762.
 A. Csernenszky R. Martin and A. Pluhár On the Complexity of Chooser-Picker Positional Games Integers12 (2012) 427–444.
 A. Dumitrescu and R. Radoičič On a coloring problem for the integer grid Towards a Theory of Geometric Graphs (2004) 67–74.
 R. K. Guy and J. L. Selfridge Problem S.10 Amer. Math. Monthly86 (1979); solution T.G.L. Zetters 87 (1980) 575–576.
 A. W. Hales and R. I. Jewett Regularity and positional games Trans. Amer. Math. Soc. 106 (1963) 222–229; M.R. # 1265.
 D. Hefetz M. Mikalački and M. Stojakovič Doubly biased Maker-Breaker Connectivity game. Electronic J. Combinatorics19 (2012) P61.
 M. Krivelevich The critical bias for the Hamiltonicity game is (1 + o(1))n/lnn Journal of the American Math. Soc. 24 (2011) 125–131.
 A. Pluhár The accelerated k-in-a-row game. Theoretical Comp. Science270 (2002) 865–875.